An A* algorithm that has been optimized quite well.
Average pathfinding time is less than 10ms, showing a high efficiency. Run faster if two points can be walk through directly.
You can download and check out the demo.
-
Notifications
You must be signed in to change notification settings - Fork 0
leoin2012/testAstar
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
high efficiency A* algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published