Interesting, this was at the bottom of the slides: > It’s not yet clear to what degree new algorithms like Anya and Polyanya can help improve the state-of-the-

Interesting, this was at the bottom of the slides: > It’s not yet clear to what degree new algorithms like Anya and Polyanya can help improve the state-of-the-art in these areas. Considering how Poly-Anya was sometimes slower than Anya (the non-nav-mesh version of path finding), it seems like the jury is still out as to whether this technique + nav-mesh is useful? I could be completely wrong, I'm just looking at the results from the papers/slides you posted. It seems that A* still has relevance because it and modifications to it are still the fastest path-finding algorithms?