A solution to the 'Knight Trevails' problem:
Find the shortest path a knight can take to any point on a chess board, implemented using a recursive breadth first search.
Find it live on gh-pages here.
This was made as a part of The Odin Project curriculum, and enhanced into a web app.