A recursive backtracking algorithm is used to find the sequnce of necessary moves for a knight to move around the chess board.
The chess board is created using a linked grid data strcuture.
-
Notifications
You must be signed in to change notification settings - Fork 0
RakshitP1/Knights-Tour
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The Knight's Tour problem is a complicated graph theory problem that finds the sequence of moves needed for a knight to visit every single square on an nxn chess board.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published