I wanted to ask YYG team or someone that knows this, what implementation is used
by the mp grid pathfinding under the hood?
1) A* + normal grid?
2) A* + QuadTree?
Is it even A*?
I've been looking at some algorithms and wanted to know how can pathfinding in GMS2 can be made better (more flexible + faster)
by the mp grid pathfinding under the hood?
1) A* + normal grid?
2) A* + QuadTree?
Is it even A*?
I've been looking at some algorithms and wanted to know how can pathfinding in GMS2 can be made better (more flexible + faster)