THE QUEEN'S TOUR.
(
The Guarded Chessboard)
The puzzle of making a complete tour of the chessboard with the queen in
the fewest possible moves (in which squares may be visited more than
once) was first given by the late Sam Loyd in his _Chess Strategy_. But
the solution shown below is the one he gave in _American Chess-Nuts_ in
1868. I have recorded at least six different solutions in the minimum
number of moves--fourteen--but this one is the best of all, for reasons
I will explain.
[Illustration:
+---+---+---+---+---+---+---+---+
| | | | | | | | |
| ............................. |
| . | | | | | | | . |
+-.-+---+---+---+---+---+---+-.-+
| . | | | | | | | . |
| . | ..........................|
| . | .| | | | | | . |
Read Answer
Previous:
A NEW BISHOP'S PUZZLE.
