Solution for both N Queens Puzzle and Knight's Tour (with GUI)
-
Updated
Jun 27, 2022 - Java
#
knights-tour
Here are 12 public repositories matching this topic...
Java Exercices
java algorithms graphics concentric-circles jframe securerandom pythagorean-triples jpanel joptionpane knights-tour
-
Updated
Oct 13, 2017 - Java
Visualize a knight's tour (ft. Warnsdorff's algorithm).
-
Updated
Jun 8, 2021 - Java
Knight's tour algorithm for humans ♞
java board backtracking knight-problem knight-tour chessboard knight-tour-puzzles backtracking-algorithm knights-tour
-
Updated
Jun 4, 2021 - Java
You're a Knight at position 0,0. Can you visit all the chess board houses just once?
-
Updated
Apr 14, 2023 - Java
random monthly attempts, not sequential
-
Updated
Oct 26, 2024 - Java
A recursive and backtracking algorithm implemented in Java for solving the Knight's Tour problem.
-
Updated
Sep 24, 2018 - Java
Spring Boot REST API + React UI
-
Updated
May 5, 2021 - Java
A knight's tour (HorseRPG) is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once.
-
Updated
Oct 3, 2020 - Java
Implementation of knight’s tour problem using Warnsdorff's rule with JavaFX
-
Updated
Oct 23, 2021 - 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 knights-tour topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the knights-tour topic, visit your repo's landing page and select "manage topics."