On: JPS+ pathfinding – faster than A* [video]

[opcvx]

Precomputation takes O(n^2) complexity so this is great for static environments like Starcraft maps where the units don't evaluate units in their path finding.

[imaginenore → opcvx]

Starcraft maps aren't static, as buildings and characters can block paths.

[opcvx → imaginenore]

Maps themselves are static.

[Udo → opcvx]

They do evaluate buildings though.

[opcvx → Udo]

I wonder how OP solved this, if at all. There are too many of them to partially rebuild. Maybe they combine two systems.

[lnanek2 → opcvx]

It's the slide called Goal Bounding Gates. He figures out the gates and only calculates the goal bounds for those on a change.

[opcvx → lnanek2]

I know that but I don't think that is used in the Starcraft maps.