Why it matters

ID gives best of DFS + BFS. Understanding shapes search choice.

Advertisement

The architecture

Depth-limited DFS.

Repeat with depth + 1.

Return when solution found.

Iterative deepeningDepth d = 1DFS boundedDepth d = 2increaseContinue untilsolution foundRepeated work < deepest DFS by factor b/(b-1); memory O(d)
ID search.
Advertisement

How it works end to end

Repeated work: dominated by deepest.

Memory O(depth).

Anytime: shallowest result available.