= Search transition model
The rule giving the successor state of each permitted state-action pair in a <search problem>. A compound action may include deterministic environmental responses. If a game state is sampled at full-turn boundaries, its <search transition model> must still detect terminal events occurring inside the turn. Otherwise an intermediate failure can be incorrectly hidden by the final position. All information needed for future successors and the <goal test> must be encoded in the state or supplied as fixed problem data.
Back to article page
