searches through state space and returns a conditional plan for the given problem . the conditional plan is a list of either an action or an if-then construct consisting of a list of states and consequent actions . the final product , when printed , resembles the contingency plan on page 134 . this function is equivalent to the following on page 136 : function and-or-graph-search problem returns a conditional plan , or failure or-search problem.initial-state , problem , concode_field_sep int expandedNodes concode_field_sep Plan andSearch concode_elem_sep Plan orSearch concode_elem_sep Metrics getMetrics
Plan function ( NondeterministicProblem arg0 ) { this . expandedNodes = 0 ; return this . orSearch ( arg0 . getInitialState ( ) , arg0 , new Path ( ) ) ; }