- Greedy A* using Manhattan distance heuristic at the moment. I’ll be adding more option as covered in the GDC talk, such as unit cost, face vs. node centers etc.
- Async = pathfinding off the game thread, I only implemented the synchronous path so far
- No upper limit.