Definition:Knight's Tour

From ProofWiki
Jump to navigation Jump to search

Definition

A knight's tour is a puzzle in recreational chess.

On a chessboard of arbitrary size, a chess knight is to make a complete tour of the chessboard,

visiting each square once and once only
and ending up a knight's move from its starting square

so that its circuit is continuous.


Also see

  • Results about knight's tours can be found here.


Historical Note

The knight's tour was one of the problems of recreational mathematics considered by Leonhard Paul Euler.


Sources