Iterative Deepening Depth-First Search (IDDFS) is a search algorithm that combines the space-efficiency of Depth-First Search (DFS) with the completeness of Breadth-First Search (BFS). It is particularly useful in scenarios where the search space is very large, and the depth of the solution is unknown.
Articles by others on the same topic
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.