MathDB

A lame rook lies on a

9\times 9

chessboard. It can move one cell horizontally or vertically. The rook made

n{}

moves, visited each cell at most once, and did not make two moves consecutively in the same direction. What is the largest possible value of

n{}

?
From the folklore

Problem Statement