https://pavelguzenfeld.com/tags/pathfinding/Recent content in Pathfinding on Pavel Guzenfeldhttps://pavelguzenfeld.com/images/og-default.pnghttps://pavelguzenfeld.com/images/og-default.pngHugoen-usSat, 18 Apr 2026 00:00:00 +0000https://pavelguzenfeld.com/posts/game-pathfinding-algorithms-cpp23-benchmark/Sat, 18 Apr 2026 00:00:00 +0000https://pavelguzenfeld.com/posts/game-pathfinding-algorithms-cpp23-benchmark/Five pathfinders implemented in C++23, each in a single Godbolt-ready file, benchmarked on the same grids. A* is the baseline. JPS expands 22x fewer nodes on open maps yet runs slower than A* in naive form. Theta* produces shorter any-angle paths at 2-8x the cost. Flow fields dominate when many agents share a goal. Visibility graphs — AoE II DE’s approach — need 5 waypoints where A* needs 600. Plus the StarCraft ‘harvesters ignore collisions’ hack and why SC2 switched to navmeshes.