Skip to content
#

warnsdorff-heuristic

Here are 3 public repositories matching this topic...

Language: All
Filter by language

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-heuristic topic page so that developers can more easily learn about it.

Curate this topic

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."

Learn more