The Knight's Tour
The Knight's Tour
A classic chess problem is to find a sequence of knight moves that visits each square exactly once. Start by placing the knight anywhere on the board, then drag the step slider to see a knight's tour, either as a broken line path or by numbering the squares in order.