This page takes two inputs from you and calculates the fastest path for knight in chess.
Live preview
I use an undirected graph called board, each vertex has 2-8 deegrees.
For searching for the shortest path I use a level order traversing algorithm.
Add MediaQuery when screen is small to add how to below the board