we solve the problem of visiting every square on a chessboard using the moves of the knight
-
Notifications
You must be signed in to change notification settings - Fork 0
pegger0709/knight-path
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Implements Euler's solution to the problem of finding a closed knight's tour on rectangular chessboards of various dimensions
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published