3 ms·
> Age1's pather's A* implementation was outright broken (the open list management was flawed, so the cheapest node wasn't always expanded upon during each itera
by JepZ 9y ago
> Age1's pather's A* implementation was outright broken (the open list management was flawed, so the cheapest node wasn't always expanded upon during each iteration)
What is left of A* if even that doesn't work?!?
- shoo 9y agomaybe it picked the cheapest node quite often. you might still get 85%-95% optimal paths - roughly heading the right way with occasional strange sidesteps and zigzags in the route if it was completely broken it probably wouldn't have shipped that way, so the defect meant it was probably only somewhat broken and the end result was workable.
- AstralStorm 9y agoThe easiest way to break A* is to use a non admissible (overestimating) heuristic. This will usually still produce reasonable paths but not optimal. What they had was even more of a bug where some nodes were skipped from expansion.