summaryrefslogtreecommitdiffstats
path: root/README.md
blob: 73c375d99f3bebe340321fc85ce060fe739892ca (plain)
1
2
3
4
5
6
7
A knight's tour is a sequence of moves of a knight on a chessboard such that 
the knight visits every square exactly once. If the knight ends on a square 
that is one knight's move from the beginning square (so that it could tour 
the board again immediately, following the same path), the tour is closed 
(or re-entrant); otherwise, it is open.

For more information: https://en.wikipedia.org/wiki/Knight%27s_tour