Visualize a knight's tour (ft. Warnsdorff's algorithm).
-
Updated
Jun 8, 2021 - Java
#
warnsdorff-heuristic
Here are 4 public repositories matching this topic...
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.
-
Updated
Oct 8, 2020 - Java
Using Backtracking and Warnsdoff algorithm has solved the knight tour problem
-
Updated
Mar 28, 2022 - Python
Knight's Tour Problem solver using Warnsdorff's heuristic. A Python implementation that finds a closed tour for a knight on a chessboard from any starting position. Features console visualization and standalone executable.
-
Updated
Sep 11, 2025 - C++
Improve this page
Add a description, image, and links to the warnsdorff-heuristic topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the warnsdorff-heuristic topic, visit your repo's landing page and select "manage topics."