| Interface | Description |
|---|---|
| ResultsFunction |
Artificial Intelligence A Modern Approach (3rd Edition): page 136.
Closely related to ResultFunction, but for non-deterministic problems; in these problems, the outcome of an action will be a set of results, not a single result. |
| Class | Description |
|---|---|
| AndOrSearch |
Artificial Intelligence A Modern Approach (3rd Edition): Figure 4.11, page
136.
|
| IfStateThenPlan |
Represents an if-state-then-plan statement for use with AND-OR search;
explanation given on page 135 of AIMA3e.
|
| NondeterministicProblem |
Non-deterministic problems may have multiple results for a given state and
action; this class handles these results by mimicking Problem and replacing
ResultFunction (one result) with ResultsFunction (a set of results).
|
| Path |
Represents the path the agent travels through the AND-OR tree (see figure
4.10, page 135, AIMA3e).
|
| Plan |
Represents a solution plan for an AND-OR search; according to page 135
AIMA3e, the plan must be "a subtree that (1) has a goal node at every leaf,
(2) specifies one Object at each of its OR nodes, and (3) includes every
outcome branch at each of its AND nodes." As demonstrated on page 136, this
subtree is implemented as a linked list where every OR node is an Object--
satisfying (2)--and every AND node is an if-state-then-plan-else
chain--satisfying (3).
|