Using dynamic programming to determine an optimal strategy in a contract bridge tournament

DOI10.1057/JORS.2009.41MaRDI QIDQ3582649zbMATH OpenOpenAlexFDO

Authors Nicholas Beaumont

Publication date 2 September 2010

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.2009.41

zbMATH Keywords

contract bridgedeliberately losingdynamic programmingoptimizationrecreationsports

Mathematics Subject Classification ID

Dynamic programming (90C39)

Recommendations

• scientific article; zbMATH DE number 4152183
• Dynamic programming and board games: a survey
• Optimal strategies for random tournament games
• Strategy optimization for deductive games
• Dynamic programming approach to optimization of approximate decision rules
• Dynamic approach to solving bargaining games
• Strategy optimization for static games based on STP method
• scientific article; zbMATH DE number 6486247
• Dynamic Programming and Decision Theory

Cited in

(3)

• scientific article; zbMATH DE number 1183935 (Why is no real title available?)
• The Game of Bridge: A Challenge for ILP
• Compact normal forms in propositional logic and integer programming formulations

This page was built for publication: Using dynamic programming to determine an optimal strategy in a contract bridge tournament

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