In the knight's tour puzzle, you must move a knight to every square on a chessboard exactly once. Mathematicians have found solutions using graph theory.