(related to Problem: A Dungeon Puzzle)

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.


Thank you to the contributors under CC BY-SA 4.0!



Project Gutenberg

  1. Dudeney, H. E.: "Amusements in Mathematics", The Authors' Club, 1917

This eBook is for the use of anyone anywhere in the United States and most other parts of the world at no cost and with almost no restrictions whatsoever. You may copy it, give it away or re-use it under the terms of the Project Gutenberg License included with this edition or online at If you are not located in the United States, you'll have to check the laws of the country where you are located before using this ebook.