Skip to content
#

mathematical-chess-problem

Star

Here is 1 public repository matching this topic...

cyrillkuettel / knights-tour

Star 1

Two different methods are being utilized to solve this famous puzzle. They are backtracking and genetic algorithms. The second approach is still in development. Backtracking method seems to be faster, but GA delivers more consistent results for a diverse palette of starting positions. All in all, a very interesting project to me personally.

java backtracking knight-tour heuristic hamiltonian-path-problem mathematical-chess-problem
  • Updated Aug 20, 2022
  • Java

Improve this page

Add a description, image, and links to the mathematical-chess-problem 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 mathematical-chess-problem topic, visit your repo's landing page and select "manage topics."

Learn more