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
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.
Knight's Tour Problem
Add a description, image, and links to the knight topic page so that developers can more easily learn about it.
To associate your repository with the knight topic, visit your repo's landing page and select "manage topics."