Why it matters

IDA* fits memory-constrained pathfinding. Understanding shapes memory trade-offs.

Advertisement

The architecture

DFS bounded by f-threshold.

Increase threshold each iteration.

Solve when goal found.

IDA* iterationsf-thresholdcurrent boundDFS exploresup to thresholdIncreasemin f exceededRepeated work per iteration; balanced by memory savings for huge graphs
IDA*.
Advertisement

How it works end to end

Repeated work but exponential nodes better.

Threshold = min f exceeding current.

Optimal with consistent h.