Optimal Doubling in Backgammon

DOI10.1287/OPRE.23.6.1063zbMATH Open0315.90089OpenAlexW2050977954WikidataQ56039291 ScholiaQ56039291MaRDI QIDQ4077115FDOQ4077115

Authors: Emmett B. Keeler, Joel Spencer 

Publication date: 1975

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.23.6.1063

Mathematics Subject Classification ID

Decision theory for games (91A35) Hamilton-Jacobi theories (49L99) Mathematical programming (90C99)

Cited In (3)

• Programming backgammon using self-teaching neural nets
• Backgammon is hard
• Optimal doubling strategy against a suboptimal opponent

This page was built for publication: Optimal Doubling in Backgammon

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