Question 163
Consider an $8 \times 8$ chessboard and a game in which a knight can move from any corner of a $3 \times 4$ rectangle to the diagonally opposite corner (as shown in the figure). What is the minimum number of moves required for a knight to travel from the lower left corner of the chessboard to the upper right corner?
