MathPuzzle

Free puzzles / Question / Chessboard Problems

The Hat-Peg Puzzle.

Here is a five-queen puzzle that I gave in a fanciful dress in 1897. As the queens were there represented as hats on sixty-four pegs, I will keep to the title, "The Hat-Peg Puzzle." It will be seen that every square is occupied or attacked. The puzzle is to remove one queen to a different square so that still every square is occupied or attacked, then move a second queen under a similar condition, then a third queen, and finally a fourth queen. After the fourth move every square must be attacked or occupied, but no queen must then attack another. Of course, the moves need not be "queen moves;" you can move a queen to any part of the board.

Answer

It will be seen that only three queens have been removed from their positions on the edge of the board, and that, as a consequence, eleven squares (indicated by the black dots) are left unattacked by any queen. I will hazard the statement that eight queens cannot be placed on the chessboard so as to leave more than eleven squares unattacked. It is true that we have no rigid proof of this yet, but I have entirely convinced myself of the truth of the statement. There are at least five different ways of arranging the queens so as to leave eleven squares unattacked.