3 ms·
At least, I don't think A* is used in any decent high-end video games anymore - it has been dethroned by the open source recast-navigation library and its algor
by highCs 13y ago
At least, I don't think A* is used in any decent high-end video games anymore - it has been dethroned by the open source recast-navigation library and its algorithm [1]. I even suspect the real-time strategy game starcraft 2 from using it or a modified version of it.
It is not based on a 2d grid but could be. Also, at one step of the algorithm, recast use A* but somewhat orthogonaly from the main pathfinding algorithm which ultimately could stand on its own. It don't like real-time changes of the world-state, but with some work it could.
[1] https://code.google.com/p/recastnavigation/ https://code.google.com/p/recastnavigation/
- csense 13y agoLooking at the page, it looks to me like most of the innovation in the Recast library (at least, the stuff they're proud enough to advertise on the front page) is not the algorithm that does pathfinding on the graph. Rather, it's about automatically constructing a graph suitable for use in a graph pathfinding algorithm like A* from a 3D polygon mesh. So this library's less about graph pathfinding algorithms (like the article), and more about parsing 3D scenes. But thanks anyway, it's good to know this exists!
- deleted 13y ago[deleted]