Visualization of some standard problems solved by Backtracking

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

Implementation Of Knight Tour Problem Using Neural Networks

warnsdorff's algorithm to solve the knight's tour problem.

Gives 3D visualization on knight problem using backtracking

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

A Java implementation of the Knight's Tour algorithm.

Knight's Tour puzzle 4x8 solver in JavaScript

Different puzzles to think and enjoy programming.

Knights Tour Problem

A Knight Tour Genetic Algorithm simulation with p5js javascript library.

A complete solution with heuristic & non-heuristic ways to knights-tour problem in chess

Knight's tour algorithm for humans ♞

Implementation Of Knight Tour Problem Using Warnsdroff Rule

Visualization of the Knight's Tour move sequence

♞ Knight's tour problem

Graphical Representation of Knight Tour using Warnsdorff's Algorithm

Hamiltonian path and cycle finder.

Two different methods are being utilized to solve this famous puzzle. They are backtracking and genetic algorithms. The second approach is still in development. Backtracking method seems to be faster, but GA delivers more consistent results for a diverse palette of starting positions. All in all, a very interesting project to me personally.