Iterative Deepening

Iterative deepening begins a search with a depth bound of 1, then increases the bound by 1 until a solution is found.


  1. Finds an optimal solution (shortest number of steps).

  2. Has the low (linear in depth) storage requirement of depth-first search.


  1. Some computer time is wasted re-exploring the higher parts of the search tree. However, this actually is not a very high cost.

Contents    Page-10    Prev    Next    Page+10    Index