An Action Schema is applicable if the preconditions are satisfied by the initial state.
(see p. 368)
In addition, for the search algorithm to return with a plan then the fluents of the goal state must all be present among the fluents of the outcome. As shown on p. 369:
The problem is solved when we can find a sequence of actions that end in a state s that entails the goal.
This is expressed in the sentence:
if (outcome.getFluents().containsAll(problem.getGoalState().getFluents())) {
In the Chess Search Algorithm.
Make sure that an Action Schema contains a PROTECTED precondition in order to be chosen.
There is an initial and goal state for every action schema and chess action available.
If the chess search algorithm does not return with a plan, try again with another Chess Problem with a different initial and goal state?
An Action Schema is applicable if the preconditions are satisfied by the initial state.
(see p. 368)
In addition, for the search algorithm to return with a plan then the fluents of the goal state must all be present among the fluents of the outcome. As shown on p. 369:
The problem is solved when we can find a sequence of actions that end in a state s that entails the goal.
This is expressed in the sentence:
if (outcome.getFluents().containsAll(problem.getGoalState().getFluents())) {
In the Chess Search Algorithm.
Make sure that an Action Schema contains a PROTECTED precondition in order to be chosen.
There is an initial and goal state for every action schema and chess action available.
If the chess search algorithm does not return with a plan, try again with another Chess Problem with a different initial and goal state?