A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square only once. The solution provided allows for the options of either a brute force method or a divide and conquer methodology. Both will result in the path the knight has taken as well as over all statistics based on the amount of tours.
-
Notifications
You must be signed in to change notification settings - Fork 0
b22tran/knights-tour
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solution to the knight's tour illustrating both the brute force and divide and conquer algorithms
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published