The parent and strategy knowledge bases are now complete.
We need to find the best move based on the available knowledge bases.
The Chess Problem Solver and the Chess Search Algorithm are the main objects used to find the best move.
The Chess Problem Solver creates a ChessProblem that contains a set of Action Schemas.
And the Chess Search Algorithm searches the Chess Problem for the best actions forward.
The Chess Problem Solver creates the Actions Schemas in two steps:
First the planning phase.:
An Action Schema is created for every Chess Action that contains a possible move, and that is not otherwise blocked.
Then in the scheduling phase, the Problem Solver adds temporal information. The basis for this temporal information is held in the parent and strategy knowledge bases.
This is done to make sure that the plan meets any resource constraints.
(See chapter 11)
The parent and strategy knowledge bases are now complete.
We need to find the best move based on the available knowledge bases.
The Chess Problem Solver and the Chess Search Algorithm are the main objects used to find the best move.
The Chess Problem Solver creates a ChessProblem that contains a set of Action Schemas.
And the Chess Search Algorithm searches the Chess Problem for the best actions forward.
The Chess Problem Solver creates the Actions Schemas in two steps:
First the planning phase.:
An Action Schema is created for every Chess Action that contains a possible move, and that is not otherwise blocked.
Then in the scheduling phase, the Problem Solver adds temporal information. The basis for this temporal information is held in the parent and strategy knowledge bases.
This is done to make sure that the plan meets any resource constraints.
(See chapter 11)