Shortest rook tour

Intermediate Mathematics English
Also available: Deutsch
Created by Best · 17.07.2026 at 11:55 UTC

A closed tour visits every square once and returns to the start. Tour a small board with single steps along ranks and files, then ask for the fewest moves when a straight run counts as one move.

A closed single-step tour exists only when the number of squares is even, because the path alternates colours and must return to its starting colour. Counting straight runs instead of single steps, a snake (boustrophedon) path sweeps each rank in one run and steps between ranks, giving a short move count. Comparing tours reveals a lower bound you cannot beat.

University approvals: 0
Tasks
Question 1

Draw a closed tour of the 4x4 corner: start on a1 and step to neighbouring squares until all 16 are visited and you end one step from a1.

Question 2

A closed single-step tour of a board exists only when the number of squares is:

Question 3

Counting a straight run as one move, a snake (boustrophedon) path is short because:

Card Info
  • Topic: Mathematics
  • Difficulty: Intermediate
  • Completed: 0 users
Creator
Best
Best
BestBuddy