• A successful terminal node is a solved node.
• If a nonterminal OR node has any solved successors, then it is a solved node.
• If all of the successors of a nonterminal AND node are solved, then it is a solved node.
• The problem is solved if the start node is solved.

A solution graph is a subgraph of solved nodes that demonstrates that the start node is solved.

Contents    Page-10    Prev    Next    Page+10    Index