Knights travails implemented with JavaScript.
This project is from The Odin Project curriculum.
This project will show the shortest possible way to get from one square to another by outputting all squares the knight will stop on along the way using BFS.
-
knightMoves(start, end)will return an array which is the shortest path. -
The parameters start and end are arrays that indicate the coordinates [x, y]
This project is open source and available under the MIT License.