#Maze Solver
A fully functional app to demonstrate path finding, written in Kotlin. You can pick between Dijkstra and A*, draw walls and try to see how it will find the best path.
-
Notifications
You must be signed in to change notification settings - Fork 2
A Maze solver written in Kotlin using Dijkstra and A* search algorithms to find the shortest path in a xy coordinate system.
License
btipling/maze-solver
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
A Maze solver written in Kotlin using Dijkstra and A* search algorithms to find the shortest path in a xy coordinate system.
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published