Skip to content

Latest commit

 

History

History
14 lines (9 loc) · 439 Bytes

README.md

File metadata and controls

14 lines (9 loc) · 439 Bytes

Knights Travails

This page takes two inputs from you and calculates the fastest path for knight in chess!
Live preview

Approach

I use an undirected graph called board, each vertex has 2-8 deegrees.
For searching for the shortest path I utilize a level order traversing algorithm. graph

TODO:

Add mediaquery when screen is small to add how to below the board