An online Knight's tour visualizer using divide and conquer algorithm

Implementation Of Knight Tour Problem Using Neural Networks

PHP study of the knight's tour problem

Solution for both N Queens Puzzle and Knight's Tour (with GUI)

Knight's Tour problem C language with SFML Library

Implementation Of Knight Tour Problem Using Warnsdroff Rule

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!

Java Exercices

Visualize a knight's tour (ft. Warnsdorff's algorithm).

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)

🐴 A visualization of Warnsdorff’s Algorithm for the Knights Tour problem

Knight's tour algorithm for humans ♞

You're a Knight at position 0,0. Can you visit all the chess board houses just once?

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.

Knights Tour Simulation in Rust with SDL2

🗃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

random monthly attempts, not sequential

open-knight's-tours

A web app that the user can use to try and solve the Knight’s Tour Problem.

chess knight tour on cli