3.7 Iterative Deepening


    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

[MAIN PAGE] [PREVIOUS PAGE] [NEXT PAGE]
RMiT Copyright © 1999. Department of Computer Science, RMIT University.
Last Modified: 20th June, 1999.