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
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
License
Stars
Watchers
Forks
Packages 0
No packages published