Calculates the shortest path for a knight to get from one position to another on a chessboard, using a queue and BFS. Made for Data Structures 1 course.
-
Updated
Aug 22, 2021 - C
#
chess-knight-problem
Here is 1 public repository matching this topic...
Improve this page
Add a description, image, and links to the chess-knight-problem topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the chess-knight-problem topic, visit your repo's landing page and select "manage topics."