Breadth-first search generates new states in the order of their distance from the start state. All states at level i are examined before any states at level i+1 are examined.

Advantages:

1. Guaranteed to find an optimal solution (in terms of shortest number of steps to reach the goal).

2. Can always find a goal node if one exists (complete).

Disadvantages:

1. High storage requirement: exponential with tree depth.

Contents    Page-10    Prev    Next    Page+10    Index