There are 0 repository under warnsdorff-heuristic topic.
Visualize a knight's tour (ft. Warnsdorff's algorithm).
Knight’s Tour is a sequence of valid moves of a knight on a chessboard in such a way that the knight covers all the squares on the board. This is a Hamiltonian path problem in computer science which is NP-complete. In this project, I compare the time complexities of Knight's Tour while implementing i) Backtracking, and ii) Warnsdorff's heuristic.
Using Backtracking and Warnsdoff algorithm has solved the knight tour problem