Iterative deepening depth-first search
= Iterative deepening depth-first search
Repeat a depth-limited <depth-first search> with successively larger depth limits. With unit-cost steps, the first successful depth is the minimum number of steps, provided each depth-limited search is complete. Each pass stores only the current path and its search bookkeeping.