Moves a knight across an nxn board, while enumerating each subsequent move until all squares have been covered. Feat is accomplished using DFS with backtracking and recursion.
-
Notifications
You must be signed in to change notification settings - Fork 0
Places a knight on and enumerates each square of an nxn size board with a dfs algorithm while using backtracking and recursion to find all solutions.
License
niole/Knights-Tour
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Places a knight on and enumerates each square of an nxn size board with a dfs algorithm while using backtracking and recursion to find all solutions.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published