Knights Travails

Project Details

Knights Travails is a basic program which calculates the shortest path to a chess knight's destination square. When given a starting square coordinate and a destination square coordinate, it provides the path as a series of coordinates. The coordinates are in standard algebraic notation.

While Dijkstra's algorithm is necessary when calculating the shortest path in a weighted graph, this program uses an unweighted graph, and the more basic Breadth-First Search algorithm is therefore used.

You can see my public Github repository of the project here. It includes an explanation of why Breadth-First Search is capable of finding the shortest path in an unweighted graph.

Click the 'Execute' button in the link below and then follow the instructions in the terminal output to see the program in action.

Live Version

Skills Demonstrated