Knight's Tour Problem
c
chess
graph
graphs
dfs
graph-theory
knight-problem
knight-tour
dijkstra
depth-first-search
dijkstra-algorithm
knight
dijkstra-shortest-path
knights-tour
-
Updated
Sep 4, 2019 - C
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."