KNIGHT'S TOUR VISUALIZER

INSTRUCTIONS:

Enter N, the desired height and width of the chess board, and hit "Submit".

Your goal is to find N² moves on the board for a knight, such that the knight visits all N² squares on the board exactly once using legal knight moves.

Click squares on the board to place and move the knight. Squares that can be reached from the knight's current position will be highlighted in green.

The number of moves you have successfully made, as well as whether any complete tours exist given the moves you have taken so far, will be updated in real time on the bottom right.

Press "Reset board" to fully clear the board of all moves.

Press "Backtrack" to take back your previous move (i.e. remove the previously placed knight).

Press "Complete tour" to complete the Knight's Tour given the moves you have already taken, assuming a tour is still possible and is found.

Slide the SPEED slider to adjust the step speed of the "complete tour" feature.

NOTE: The "Complete tour" feature is non-deterministic, meaning there are certain configurations of moves for which a complete Tour exists, but my algorithm will not find.