Problem #7

A rook is placed on the square in the lower left corner of a chessboard. On each move, the rook can move one square either horizontally or vertically. Find a path the rook can take so that it visits one square once, one square twice, ..., one square 64 times and

• such that the last square visited is the lower left corner.

• such that the last square visited is the square immediately to the right of the lower left corner.

The solution will be posted shortly.

Back to the Archives