Skip to content

bigacz/knights-travails

Repository files navigation

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

About

Get the fastest route from point A to B with knight

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published