Question 18
A king moves on an $8 \times 8$ chessboard. He can move one square at a time, diagonally or orthogonally (so away from the borders he can move to any of eight squares). He makes a complete circuit of the board, starting and finishing on the same square and visiting every other square just once. His trajectory is drawn by joining the center of the squares he moves to and from for each move. The trajectory does not intersect itself. Show that he makes at least 28 moves parallel to the sides of the board (the others being diagonal) and that a circuit is possible with exactly 28 moves parallel to the sides of the board. If the board has side length 8, what is the maximum and minimum possible length for such a trajectory.