Playing the perfect Kriegspiel endgame

DOI10.1016/J.TCS.2010.05.019zbMATH Open1197.91061OpenAlexW1981470108MaRDI QIDQ708207FDOQ708207

Authors: Paolo Ciancarini, Gian Piero Favini 

Publication date: 11 October 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.019

Recommendations

• scientific article
• Knowledge Abstraction in Chinese Chess Endgame Databases
• scientific article; zbMATH DE number 1759678
• scientific article; zbMATH DE number 1759677
• Solving Chinese chess endgames by database construction

zbMATH Keywords

game theorychessKriegspielretrograde analysis

Mathematics Subject Classification ID

Combinatorial games (91A46)

Cites Work

• Checkers is solved
• Title not available (Why is that?)
• Mate with bishop and knight in kriegspiel
• Title not available (Why is that?)
• ON THE APPLICATION OF DYNAMIC PROGRAMING TO THE DETERMINATION OF OPTIMAL PLAY IN CHESS AND CHECKERS

Cited In (8)

• Using partial tablebases in Breakthrough
• Mate with bishop and knight in kriegspiel
• Title not available (Why is that?)
• A quantitative study of \(2\times4\) Chinese dark chess
• Material symmetry to partition endgame tables
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication: Playing the perfect Kriegspiel endgame

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708207)