The problem of determining how many nonattacking kings can be placed on an Chessboard. For , the
solution is 16, as illustrated above (Madachy 1979). In general, the solutions are

(1) |

(2) |

The minimum number of kings needed to attack or occupy all squares on an Chessboard is nine, illustrated above (Madachy 1979).

**References**

Madachy, J. S. *Madachy's Mathematical Recreations.* New York: Dover, p. 39, 1979.

© 1996-9

1999-05-26