A script to find the shortest path of a knight on a chessboard from one square to another
-
Updated
Jan 7, 2023 - JavaScript
A script to find the shortest path of a knight on a chessboard from one square to another
Knights Travails - The Odin Project
Implement graph in JavaScript to find out shortest path a knight can move on a chess board.
Find the shortest path to the Knight's (chess piece) destination
Knights Travails Chess Puzzle Solution
Odin Project - Ruby Data Structures
Recursion / Merge Sort / Linked Lists / HashMap / Binary Search Trees / Knights Travails
Project: Knights Travails
Odin Project: Knights Travails
The main function knightMoves shows the shortest possible way to get from one square to another by outputting all squares the knight will stop on along the way.
Returns the shortest path from one vertex to another in a graph of 64 vertices emulating a chess table only using the Chess Knight's movements to traverse it.
Solutions for the computer science section of The Odin Project.
Knights Travails - Shortest Path
Add a description, image, and links to the knight-travails topic page so that developers can more easily learn about it.
To associate your repository with the knight-travails topic, visit your repo's landing page and select "manage topics."