[1] : The Free On-line Dictionary of Computing (27 SEP 03)

iterative deepening
     
        a graph search algorithm.  when searching for a path through a
        graph from a given initial node to a solution node with some
        desired property, a depth-first search may never find a
        solution if it enters a cycle in the graph.  we can either add
        an explicit check for cycles so that we never extend a path
        with a node it already contains or we can use iterative
        deepening where we explore all paths up to length or "depth"
        n, starting from n=0 and increasing n until a solution is
        found.
     
        1995-02-14
     
     
see also:
depth-first search 

Iterative >> I Words
Iterative, definition of term: Iterative
iterative_pag1.html

Deepening >> D Words
Deepening, definition of term: Deepening
deepening_pag1.html