The difference between searching a graph and searching an AND/OR graph resides in the fact that, in the latter case, the PSS rules are no longer bi-univocal applications (transforming a state u into one other state v), but multivocal applications (transforming u into several states v1 . . . vK). For this reason, the expression ‘state decomposition rule’ is introduced. The search problem here is formulated in a similar way to that in the previous chapter. It is based on finding a method that, starting from an initial state uo, for which several decomposition rules are valid, will choose one in particular for application to uo, start at each of the states obtained by this rule, and continue in the same way until all the states that have not been broken down are terminal.
KeywordsPartial Solution Complete Solution Terminal State Search Problem Previous Chapter
Unable to display preview. Download preview PDF.