An online Knight's tour visualizer using divide and conquer algorithm
-
Updated
Jul 9, 2020 - C
#
knights-tour
Here are 54 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
This repository provides a C# solution to the classic Knight's Tour problem using the backtracking algorithm. It supports customizable chessboard sizes and starting positions, offering a practical example of recursion and backtracking in problem-solving.
c-sharp algorithms recursion knight-tour pathfinding-algorithm graphics2d depth-first-search backtracking-algorithm knights-tour chessboard-game
-
Updated
Apr 14, 2025 - C#
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++
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
Feb 5, 2025 - C#
Implementation Of Knight Tour Problem Using Warnsdroff Rule
-
Updated
Jul 20, 2019 - Python
Visualize a knight's tour (ft. Warnsdorff's algorithm).
-
Updated
Jun 8, 2021 - Java
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
🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem
-
Updated
Nov 12, 2020 - Vue
Can the knight visit every square on the chessboard exactly once?, This is where the genetic algorithm steps in: by evolving generations of possible tours, selecting the most promising ones, it gradually guides the knight toward the perfect journey one that covers every square exactly once
chess ai optimization genetic-algorithm pathfinding artificial-intelligence evolutionary-computation knights-tour
-
Updated
Aug 11, 2025 - Python
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
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
open-knight's-tours
-
Updated
Mar 20, 2023 - JavaScript
Java Exercices
java algorithms graphics concentric-circles jframe securerandom pythagorean-triples jpanel joptionpane knights-tour
-
Updated
Oct 13, 2017 - Java
Chess-inspired daily puzzle game. Find the shortest route while visiting all red squares.
-
Updated
Jul 26, 2025 - 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
You're a Knight at position 0,0. Can you visit all the chess board houses just once?
-
Updated
Apr 14, 2023 - 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."