THE ROOK'S TOUR.
(
The Guarded Chessboard)
[Illustration:
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | R | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
| | | | | | | | |
+---+---+---+---+---+---+---+---+
]
The puzzle is to move the single rook over the whole board, so that it
shall visit every square of the board once, and only once, and end its
tour on the square from which it starts. You have to do this in as few
moves as possible, and unless you are very careful you will take just
one move too many. Of course, a square is regarded equally as "visited"
whether you merely pass over it or make it a stopping-place, and we will
not quibble over the point whether the original square is actually
visited twice. We will assume that it is not.
Answer:
The only possible minimum solutions are shown in the two diagrams, where
it will be seen that only sixteen moves are required to perform the
feat. Most people find it difficult to reduce the number of moves below
seventeen.
[Illustration: THE ROOK'S TOUR.]
Informational
