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.
pandelisgreen13/ChessBoard
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|