The implementation of three algorithms, which tend to find the closest path from the given starting point to one of the closest goals. First algorithm uses random approach and based on breadth first search. Second uses backtracking. And the last one is A* algorithm.
-
Notifications
You must be signed in to change notification settings - Fork 0
The implementation of three algorithms, which tend to find the closest path from the given starting point to one of the closest goals. First algorithm uses random approach and based on breadth first search. Second uses backtracking. And the last one is A* algorithm.
Alicegaz/MazeSolvingAlgorithms
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
The implementation of three algorithms, which tend to find the closest path from the given starting point to one of the closest goals. First algorithm uses random approach and based on breadth first search. Second uses backtracking. And the last one is A* algorithm.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published