Fast Pathfinding on the dynamic Grid
Problem Definition Consider a 2D tile-based game with a side-view perspective. In my case, that game is about worker assignments: The player places tasks anywhere on the map, workers look for reachable tasks to work on. This makes for an interesting pathfinding problem: During a single simulation frame (“tick”), we may need to compute hundreds … Read more