A grid of n x n size with generated numbers that goes from a starting number to a target number. The program would access the fastest path to the target number in a given amount of turns or less. With restrictions the path can’t reach repeating numbers and as well as diagonals.
-
Notifications
You must be signed in to change notification settings - Fork 0
KulinduC/Path-Finding
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published