Shortest path of a knight on a given position to a destination on an empty chess board using xy- plane and BFS. Knight move's in a four block L-shape (maximum 8 possible moves). 2D Grid is constricted by an NxM square matrix.
-
Notifications
You must be signed in to change notification settings - Fork 0
echulibbasingularity/Shortest-Path-on-2D-Grid
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description or website provided.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published