

A279407


Domination number for knights' graph on an n X n toroidal board.


1




OFFSET

1,2


COMMENTS

That is, the minimal number of knights needed to cover an n X n toroidal chessboard so that every square either has a knight on it, or is under attack by a knight, or both.


REFERENCES

John J. Watkins, Across the Board: The Mathematics of Chessboard Problem, Princeton University Press, 2004, pages 140144.


LINKS

Table of n, a(n) for n=1..8.


EXAMPLE

For an 8 X 8 board, the solution is:
N......N
........
..N..N..
........
...NN...
........
.N....N.
........


CROSSREFS

Cf. A006075, A279402.
Sequence in context: A270194 A055170 A068384 * A222253 A269838 A246376
Adjacent sequences: A279404 A279405 A279406 * A279408 A279409 A279410


KEYWORD

nonn,hard,more


AUTHOR

Andrey Zabolotskiy, Dec 12 2016


STATUS

approved



