Ordered search is like breadth-first search, except that it selects for expansion the node generated so far that looks the most promising according to a chosen heuristic function.

Advantages:

1. If the heuristic is good, then a good path can be found quickly.

Disadvantages:

1. Extra overhead to evaluate the heuristic function.

2. Large storage to store open and closed node lists.

3. Large CPU time required if heuristic function is inaccurate.

Contents    Page-10    Prev    Next    Page+10    Index