This is my small project where I want to finally try out all the features of the SDL Framework!
-
Updated
Jan 16, 2025 - C
This is my small project where I want to finally try out all the features of the SDL Framework!
Knight's Tour Problem
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.
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."