An online Knight's tour visualizer using divide and conquer algorithm
-
Updated
Jul 9, 2020 - C
#
knights-tour
Here are 49 public repositories matching this topic...
Implementation Of Knight Tour Problem Using Neural Networks
python neural-network python3 pygame neural-networks knight-problem knight-tour pygame-application knight knights-tour
-
Updated
Jun 21, 2022 - Python
PHP study of the knight's tour problem
-
Updated
May 18, 2019 - PHP
Solution for both N Queens Puzzle and Knight's Tour (with GUI)
-
Updated
Jun 27, 2022 - Java
Knight's Tour problem C++ language with SFML Library
-
Updated
Aug 4, 2021 - C++
Implementation Of Knight Tour Problem Using Warnsdroff Rule
-
Updated
Jul 20, 2019 - Python
Knight's tour is a classic computer problem; Here I provided my very own method to solve this classic problem with black-box approach. I developed this algorithm when I was in high school. Maybe it's not the best method to solve this problem but it's mine!
chess csharp windows-desktop windows-forms knights-tour knights windows-forms-csharp ardeshirv ardeshirv-forms
-
Updated
Jul 14, 2021 - C#
The Knight's Tour Encryption System is a cryptographic application that leverages the Knight's Tour problem on a chessboard to generate a unique encryption key. This key is then used for XOR-based encryption and decryption of messages.
-
Updated
Nov 21, 2024 - C++
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
🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem
-
Updated
Nov 12, 2020 - Vue
Game of Knights where 6 knights should hit the one at their left with a random amount of damage of a range. Then they should fight until there's only one knight standing. All actions should be displayed (knight 1 hits 2 with X damage, knight 4 dies, knight 5 wins)
-
Updated
Jun 27, 2022 - JavaScript
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
A web app that the user can use to try and solve the Knight’s Tour Problem.
-
Updated
Jul 29, 2023 - JavaScript
🗃This is a repo for CS5800 Algorithms' final project. We design, analyze and write two algorithms--backtracking and backtracking combining greedy to solve Knight's tour problem
-
Updated
Sep 12, 2022 - Python
random monthly attempts, not sequential
-
Updated
Oct 26, 2024 - Java
open-knight's-tours
-
Updated
Mar 20, 2023 - JavaScript
Knight's Tour Problem
c chess graph graphs dfs graph-theory knight-problem knight-tour dijkstra depth-first-search dijkstra-algorithm knight dijkstra-shortest-path knights-tour
-
Updated
Sep 4, 2019 - C
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."