Depth-First Search

Depth-first search applies operators to each newly generated state, trying to drive directly toward the goal.


  1. Low storage requirement: linear with tree depth.

  2. Easily programmed: function call stack does most of the work of maintaining state of the search.


  1. May find a sub-optimal solution (one that is deeper or more costly than the best solution).

  2. Incomplete: without a depth bound, may not find a solution even if one exists.

Contents    Page-10    Prev    Next    Page+10    Index