Ryan Kinal
100 E. St. Clair St.
Warren, PA 16365

Google ProfileTwitter: @IndigloMouth


The Knight's Tour is an interesting and fun little graph traversal problem that involves a chess board, and the piece known as a knight. Starting on a random square in the chess board, the knight moves as per the rules of chess, and visits each square once.

Pathfinding is usually a complicated process, with complex algorithms. However, under certain circumstances, the solution may be found in linear time. The Knight's tour is one of those circumstances.

This was a fun little piece of code to write, and it's fun to watch the algorithm do its thing, as you can see to the right (and if you refresh the page, it will use a different starting point).

Required Libraries