Optimal Doubling in Backgammon

DOI10.1287/opre.23.6.1063zbMath0315.90089OpenAlexW2050977954WikidataQ56039291 ScholiaQ56039291MaRDI QIDQ4077115

Emmett B. Keeler, J. H. 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

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

Related Items (3)

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

This page was built for publication: Optimal Doubling in Backgammon