Problem Reduction Representations
The given problem is reduced to a set of simpler subproblems,
the solution of which will allow the original problem to be solved.
This reduction is applied recursively until primitive subproblems
which are immediately solvable are reached. The resulting structure
is called an AND/OR graph .
- AND Node: All subproblems must be solved in order to
solve the main problem. An arc is drawn across branches of an AND node
.
- OR Node: Solution of any subproblem will solve the main
problem. A state space search graph consists entirely of OR nodes.
Contents
Page-10
Prev
Next
Page+10
Index