9 Pages

Arrows and Circuits

Many readers are familiar with the problem of finding a Knight’s tour on the 64 squares of a chessboard, in which each square is visited once in a sequence of 64 consecutive knight moves and the last move returns to the starting square. This article describes a related problem in which a similar sequence is to be found for a 4 × 4 board using 16 arrows, each of which indicates a particular move — a sort of “Archer’s Tour.”