My implementation of the knightMove function which uses recursion to get the shortest path between two points using the movement pattern of the knight chess piece.
Beschuetzer/Knight-s-Tour-Problem
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
My implementation of the knightMove function which uses recursion to get the shortest path between two points on a chess board using the movement pattern of the knight piece.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published