On the problem of solving multimove games under time deficit

MaRDI QIDQ5240349zbMATH OpenFDO

Authors A. V. Chernov

Publication date 25 October 2019

Full work available at URL http://mathnet.ru/eng/mgta237

zbMATH Keywords

expected best choice of game subtreeKuhn algorithmmultimove game under time deficit

Mathematics Subject Classification ID

Combinatorial games (91A46)

Recommendations

• Optimal Search on Some Game Trees
• scientific article; zbMATH DE number 269837
• scientific article; zbMATH DE number 805352
• Strategies anticipating a difference in search depth using opponent-model search
• scientific article; zbMATH DE number 4162309

Cites work

• Games with Incomplete Information Played by ‘Bayesian’ Players, Part III. The Basic Probability Distribution of the Game
• scientific article; zbMATH DE number 3771376 (Why is no real title available?)
• On the game with perfect information with time-claiming alternatives
• The present and future of game theory

Cited in

(1)

• Optimal doubling strategies in backgammon

This page was built for publication: On the problem of solving multimove games under time deficit

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