We have a ChessBoard with NxN size. Giving the start position of the Knight and the target position. We calculate the shortest path with a specific amount of moves.
About the calculation, we use breadth first search(BFS) algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
pandelisgreen13/ChessBoard
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published