A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once.
This project uses Unity's Coroutines to implement Knight's Tour Warnsdorf's solution.
- O (8^(n^2))
- ϴ (n^2)
BeholderDEV/unity-knights-tour
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|