Re:How to smooth and spread A* paths for an RTS
by TillE on Tuesday January 31, 2023 @11:07PM
(#34606216)
It's funny cause A* (a slight modification of Dijkstra's algorithm) is explicitly an algorithm that operates on graphs. Applying it to a "navmesh" is actually conceptually simpler than thinking of a grid-based game world as a big uniform graph.
[ Parent
| on HN ]
There are no comments on this comment yet.