A knight visits every square of a board exactly once; a classic bridge between chess puzzles and graph theory.