OFFSET
1,2
COMMENTS
How many knights are needed to occupy or attack every square of a k X n board?
I do not know how many of these numbers have been proved to be optimal. - N. J. A. Sloane, Nov 08 2004
LINKS
Lee Morgenstern, Knight Domination.
Frank Rubin, Knight coverings for large chessboards, 2000.
Eric Weisstein's World of Mathematics, Knights Problem.
EXAMPLE
Triangle (with rows n >= 1 and columns k >= 1) begins as follows:
1
2 4
3 4 4
4 4 4 4
5 4 4 4 5
6 4 4 4 6 8
7 6 6 6 7 8 10
...
CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
Morgenstern's table extends a long way beyond what is shown here.
STATUS
approved