323.--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.

[Illustration: THE LANGUISHING MAIDEN]

[Illustration: A DUNGEON PUZZLE.]

Amusements in Mathematics · 第 848 / 970 题