A solution to a "knight travails" problem - i.e. find the shortest path a knight can take to move between two positions on a chessboard. Implemented using a graph BFS search.
sofiabaezzato/knight-travails
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
A solution to the knight travails problem in JavaScript
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published