Implementation of knight’s tour problem using Warnsdorff's rule with JavaFX
-
Updated
Oct 23, 2021 - Java
#
warnsdorff-rule
Here are 2 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
Improve this page
Add a description, image, and links to the warnsdorff-rule topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the warnsdorff-rule topic, visit your repo's landing page and select "manage topics."