-
Notifications
You must be signed in to change notification settings - Fork 0
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Game strategies from week 46 #35
Comments
This remaining issue has been solved: The reachable a2 and a4 are not listed: |
Another bug: Chosen action Schema The opponent pieces do not protect the player's pieces. |
The above To position d3 Color W Direction NONE sumdif 2 Piece None false Friendly false gamepiece Gamenone |
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 text was updated successfully, but these errors were encountered: