function ITERATIVE-DEEPENING-SEARCH ( problem ) return a solution sequence
inputs: problem, a problem
for depth = 0 to infinity do
if DEPTH-LIMITED-SEARCH(problem, depth) succeeds then return its result
end
return failure |
- A depth first search to depth 1, 2, 3, ...
- Benefits of breadth first search
- At the cost of examining some nodes several times
|