Skip to content

A visual representation of the algorithm used to find the shortest path of a knight reaching any selected point on a chess board.

Notifications You must be signed in to change notification settings

pmbechard/knight-travails

Repository files navigation

Knight Travails

An interactive visual representation of the algorithm used to find the shortest path of a knight reaching any selected point on a chess board, which makes use of the graph data structure.

About

A visual representation of the algorithm used to find the shortest path of a knight reaching any selected point on a chess board.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published