Search of an AND/OR Graph

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.

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

Contents    Page-10    Prev    Next    Page+10    Index