I show the route in the diagram. It will be seen that the tenth move lands us at the square marked "10," and that the last move, the twenty-first, brings us to a halt on square "21."
[322.—THE LANGUISHING MAIDEN.—solution]
The dotted line shows the route in twenty-two straight paths by which the knight may rescue the maiden. It is necessary, after entering the first cell, immediately to return before entering another. Otherwise a solution would not be possible. (See "[The Grand Tour]," [p. 200].)
[323.—A DUNGEON PUZZLE.—solution]
If the prisoner takes the route shown in the diagram—where for clearness the doorways are omitted—he will succeed in visiting every cell once, and only once, in as many as fifty-seven straight lines. No rook's path over the chessboard can exceed this number of moves.
