GitHub topics: warnsdorff-algorithm
aminehabchi/Knight-s-Tour-Problem
Implementation Of The 🐴 Knight's Tour 🐴 Problem in Rust
Language: Rust - Size: 2 MB - Last synced at: 2 months ago - Pushed at: 2 months ago - Stars: 0 - Forks: 0
rezaarshad/KnightTour
Solving Knight's tour problem using Java
Language: Java - Size: 21.5 KB - Last synced at: 9 months ago - Pushed at: 9 months ago - Stars: 0 - Forks: 0
obadakhalili/The-Knights-Tour
🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem
Language: Vue - Size: 225 KB - Last synced at: 5 months ago - Pushed at: over 4 years ago - Stars: 2 - Forks: 0
yestab335/knights-tour
Warnsdorff's algorithm to solve the knight's tour problem
Language: Python - Size: 36.1 KB - Last synced at: 7 months ago - Pushed at: 7 months ago - Stars: 0 - Forks: 0
oliver-pham/knights-tour
Visualize a knight's tour (ft. Warnsdorff's algorithm).
Language: Java - Size: 1020 KB - Last synced at: over 2 years ago - Pushed at: about 4 years ago - Stars: 1 - Forks: 1
priyesh0453/Knight-s-Tour-Problem-Warnsdorff-s-Alorithm-Fork-System-Call-
C program for "Knight's Tour Problem" using 'Warnsdorff's' Algorithm via 'fork' system call.
Size: 1.95 KB - Last synced at: about 2 years ago - Pushed at: over 2 years ago - Stars: 0 - Forks: 0
zq99/knights-tour-solution-in-excel-vba
A solution to the classic puzzle using Warnsdorf's rule.
Language: Rich Text Format - Size: 372 KB - Last synced at: over 2 years ago - Pushed at: almost 3 years ago - Stars: 0 - Forks: 0
lst97/SIT215-KnightTour
Three different implementation of Knight Tour problem.
Language: Python - Size: 514 KB - Last synced at: about 2 years ago - Pushed at: about 3 years ago - Stars: 0 - Forks: 0
macisluca/Knight-Tour
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 explore three ways to solve the problem: the recursive algorithm, the Warnsdorff's algorithm and the Divide and Conquer algorithm.
Language: Jupyter Notebook - Size: 332 KB - Last synced at: 8 months ago - Pushed at: over 3 years ago - Stars: 0 - Forks: 0
anjolaolubusi/Knight-Tour-Warnsdorff
A simple program that implements and visualizes Warnsdoff's algorthim for the Knight Tour.
Language: Python - Size: 51.8 KB - Last synced at: over 2 years ago - Pushed at: about 5 years ago - Stars: 0 - Forks: 0
ashwinbhaskar/piece-tour
A program written in dotty to calculate a piece's tour on a 10*10 chessboard
Language: Scala - Size: 10.7 KB - Last synced at: over 2 years ago - Pushed at: almost 5 years ago - Stars: 0 - Forks: 0
