Puzzle of the Week for 22 March 1999: Solution
At least twelve knights are needed to occupy or attack all squares.
One solution is shown in the diagram; if you found another (not counting
the mirror image of this solution), please
tell me about it!
If you enjoyed this puzzle, here are two more you may also like:
- What is the maximum number of knights that can be placed on a chessboard
so that no two attack each other, and how can they be arranged?
- Arrange the knights as required by the previous question. Now make one
move with each knight. Any knight that moves to an occupied square
captures the occupant. What is the minimum number of knights remaining?
(This problem was posed by Jeremy Moody.)
Links