Visualize a knight's tour (ft. Warnsdorff's algorithm).
-
Updated
Jun 8, 2021 - Java
#
warnsdorff-algorithm
Here are 10 public repositories matching this topic...
🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem
-
Updated
Nov 12, 2020 - Vue
A solution to the classic puzzle using Warnsdorf's rule.
-
Updated
Sep 1, 2022 - Rich Text Format
A program written in dotty to calculate a piece's tour on a 10*10 chessboard
-
Updated
Sep 7, 2020 - Scala
A simple program that implements and visualizes Warnsdoff's algorthim for the Knight Tour.
visualization python algorithm chess knight-problem knight-tour chessboard warnsdorff knights-tour warnsdorff-algorithm
-
Updated
Jun 1, 2020 - Python
Three different implementation of Knight Tour problem.
-
Updated
Apr 30, 2022 - Python
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
C program for "Knight's Tour Problem" using 'Warnsdorff's' Algorithm via 'fork' system call.
-
Updated
Jan 16, 2023
A knight's tour is a sequence of moves of a knight on a chessboard such that the knight visits every square exactly once. If the knight ends on a square that is one knight's move from the beginning square (so that it could tour the board again immediately, following the same path), the tour is closed; otherwise, it is open. This notebook will ex…
-
Updated
Dec 21, 2021 - Jupyter Notebook
Warnsdorff's algorithm to solve the knight's tour problem
-
Updated
Dec 8, 2024 - Python
Improve this page
Add a description, image, and links to the warnsdorff-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the warnsdorff-algorithm topic, visit your repo's landing page and select "manage topics."