In the knight's tour puzzle, a chess knight must visit every square on the board exactly once. Mathematicians have found solutions for boards of many different sizes.