A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.
Next step is to implement the Warnsdorff's rule
-
Notifications
You must be signed in to change notification settings - Fork 0
fernandesdiego/knightstour
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
Knight's tour problem solved using recursion and backtracking