Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> nothing optimal is faster than A* .

For what task? The speaker seems to be concerned with the problem of answering repeated path-finding queries for a single static map. With that problem in mind A* is indeed sub-optimal since it redoes all the computations for each query.



Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: