This is a basic problem of chess where a knight should visit all cells of chess board only once and return to the very begining cells. We have to find if the knight can possibly visit all the cells from the given cell and the path for the journey.
-
Notifications
You must be signed in to change notification settings - Fork 0
This is a basic problem of chess where a knight should visit all cells of chess board only once and return to the very begining cells. We have to find if the knight can possibly visit all the cells from the given cell and the path for the journey.
agoutam27/knights-journey
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This is a basic problem of chess where a knight should visit all cells of chess board only once and return to the very begining cells. We have to find if the knight can possibly visit all the cells from the given cell and the path for the journey.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published