Solutions to NP-complete problems: N-Queens and Knight's Tour.
-
Updated
Oct 6, 2024 - Java
#
warnsdorff
Here are 3 public repositories matching this topic...
Data Structure Class Project - The goal of a knight's tour is to place a knight on an empty chess board and then move the knight to each of the remaining 63 squares while only visiting each square once.
-
Updated
Oct 3, 2024 - Java
Solving Knight's tour problem using Java
java algorithm functional functional-programming backtracking knight-tour algorithm-challenges backtracking-algorithm warnsdorff knights-tour warnsdorff-s-algorithm knight-tour-problem warnsdorff-algorithm
-
Updated
Oct 20, 2024 - Java
Improve this page
Add a description, image, and links to the warnsdorff topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the warnsdorff topic, visit your repo's landing page and select "manage topics."