-
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 39 #34
Comments
In the parent knowledge base: This is done in the chess agent object. Must also check the removed position routine! Must find which positions a piece possibly can reach (and protect) from av given position (one ply down) |
This is solved 05.10.21: |
SOLVED 21.10.21: |
Solved 21.10.21: Check the CheckOpponentremove method: CheckOpponentremove The min position: d5 Color W Direction NE sumdif 4 Piece no.chess.web.model.ChessPiece Ontology name BlackPawn5 CheckOpponentremove: f7 Color W Direction NE sumdif 8 Piece no.chess.web.model.ChessPiece Ontology name BlackPawn6 |
Files B43 and Q32 are missing. |
a2 should have been available and removed: |
18.11.21:
These issues are now solved.
05.11.21:
For Bishop/Queen and Rook:
only the closest friendly occupied position must be set to friendly.
The game system contains two knowledgebases:
One parent KB and a Strategy KB.
The strategy KB contains knowledge about possible movements from available posistions:
occupies(WhiteRook2,g1)
REACHABLE(WhiteRook2_g1,h1)
REACHABLE(WhiteRook2_g1,f1)
occupies(WhiteRook2,f1)
REACHABLE(WhiteRook2_f1,h1)
REACHABLE(WhiteRook2_f1,g1)
We have a class Performance that is responsible for calculating the performance measure.
The text was updated successfully, but these errors were encountered: