Source: wikibot/knight-s-tour

= Knight's tour
{wiki=Knight's_tour}

The Knight's Tour is a classic problem in chess and combinatorial mathematics that involves moving a knight piece around a chessboard. The goal of the Knight's Tour is to move the knight to every square on the board exactly once. A knight moves in an L-shape: two squares in one direction and then one square perpendicular, or one square in one direction and then two squares perpendicular. This unique movement gives the knight its characteristic capabilities.