The objective of this problem is to move the knight through the chessboard such that the knight visits every cell on the chessboard. I implemented Warnsdorff's algorithm in Python to solve this problem. The paper I wrote discussing this algorithm is linked below. https://drive.google.com/file/d/1feovxnBzath-Icg2NS8TZuGcjJ2KL6aV/view
-
Notifications
You must be signed in to change notification settings - Fork 0
sota6640/Knights-Tour-On-A-Chessboard
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The objective of this problem is to move the knight through the chessboard such that the knight visits every cell on the chessboard. Coded in Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published