Maximum pathfinding iterations distributed across all agents per update. Higher values allow more agents to complete pathfinding faster but increase CPU cost.
Initial quick search iterations when pathfinding request starts. Helps find short paths immediately, and is used as the initial partial corridor to start moving towards the target while the full path is still being computed.
Maximum pathfinding iterations per agent per update. Limits how much CPU time a single agent can consume.