Mate with bishop and knight in kriegspiel
Theoretical Computer Science
Reasoning about partially observed actions
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Representing Kriegspiel states with metapositions
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Game-tree search with combinatorially large belief states
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Efficient belief-state AND-OR search, with application to Kriegspiel
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Searching over metapositions in kriegspiel
CG'04 Proceedings of the 4th international conference on Computers and Games
| Hi-index | 0.00 |
Retrograde analysis is a tool for reconstructing a game tree starting from its leaves; with these techniques one can solve specific subsets of a complex game, achieving optimal play in these situations, for example a chess endgame. Position values can then be stored in “tablebases” for instant access, as is the norm in professional chess programs. While this technique is supposed to be only used in games of perfect information, this paper shows that retrograde analysis can be applied to certain Kriegspiel (invisible chess) endgames, such as King and Rook versus King. Using brute force and a suitable data representation, one can achieve perfect play, with perfection meaning fastest checkmate in the worst case and without making any assumptions on the opponent.