An AND/OR Graph is searched recursively until the root node is solved. To solve a node, attempt to solve each successor of a nonterminal node sequentially.

• If any successor of an AND node fails, the AND node fails immediately.
• If any successor of an OR node succeeds, the OR node succeeds immediately.

The search time may be improved by ordering consideration of the nodes:

• To solve an AND node, try first to solve those successors that are most likely to fail (so the search can fail early).

• To solve an OR node, try first to solve those successors that are most likely to succeed (so the search can succeed early).

Contents    Page-10    Prev    Next    Page+10    Index