This project is part of The Odin Project's curriculum and marks the end of TOP's Computer Science mini course.
The assignment of this project was to write a function which, given starting and target chessboard coordinates, returns the shortest path a knight piece could take to traverse from the starting coordinates to the target coordinates.
In order to build the function, I relied on a tree graph data structure and a breadth-first search algorithm.
Furthermore, I also decided to make a visual representation, as I figured it would be a fun way to keep honing my CSS skills.
