Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ingenter
on Aug 17, 2015
|
parent
|
context
|
favorite
| on:
A* Search
There is another pathfinding algorithm with smaller pre-computation step and comparable (if not higher) speed. It allows you to do benchmarks on various maps, and it compares itself to other algorithms. I also think it's simpler than JPS.
http://mikolalysenko.github.io/l1-path-finder/www/
Consider applying for YC's Spring batch! Applications are open till Feb 11.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
http://mikolalysenko.github.io/l1-path-finder/www/