OPTIMAL DOUBLING IN BACKGAMMON.

Emmett B. Keeler, Joel Spencer

Research output: Contribution to journalArticle

Abstract

This paper shows that the optimal betting strategy for a continuous model of backgammon is to double when you have an 80 percent chance of winning. The differences are discussed with the published literature on the real game and the problem of infinite expectations. The optimal strategy for a simulation of the end game is computed by dynamic programming.

Original languageEnglish (US)
Pages (from-to)1063-1071
Number of pages9
JournalOperations Research
Volume23
Issue number6
StatePublished - Nov 1975

Fingerprint

Dynamic programming
Simulation
Betting
Optimal strategy

ASJC Scopus subject areas

  • Management Science and Operations Research

Cite this

OPTIMAL DOUBLING IN BACKGAMMON. / Keeler, Emmett B.; Spencer, Joel.

In: Operations Research, Vol. 23, No. 6, 11.1975, p. 1063-1071.

Research output: Contribution to journalArticle

Keeler, EB & Spencer, J 1975, 'OPTIMAL DOUBLING IN BACKGAMMON.', Operations Research, vol. 23, no. 6, pp. 1063-1071.
Keeler, Emmett B. ; Spencer, Joel. / OPTIMAL DOUBLING IN BACKGAMMON. In: Operations Research. 1975 ; Vol. 23, No. 6. pp. 1063-1071.
@article{5de16e081d554e628766d2cce8ead1bd,
title = "OPTIMAL DOUBLING IN BACKGAMMON.",
abstract = "This paper shows that the optimal betting strategy for a continuous model of backgammon is to double when you have an 80 percent chance of winning. The differences are discussed with the published literature on the real game and the problem of infinite expectations. The optimal strategy for a simulation of the end game is computed by dynamic programming.",
author = "Keeler, {Emmett B.} and Joel Spencer",
year = "1975",
month = "11",
language = "English (US)",
volume = "23",
pages = "1063--1071",
journal = "Operations Research",
issn = "0030-364X",
publisher = "INFORMS Inst.for Operations Res.and the Management Sciences",
number = "6",

}

TY - JOUR

T1 - OPTIMAL DOUBLING IN BACKGAMMON.

AU - Keeler, Emmett B.

AU - Spencer, Joel

PY - 1975/11

Y1 - 1975/11

N2 - This paper shows that the optimal betting strategy for a continuous model of backgammon is to double when you have an 80 percent chance of winning. The differences are discussed with the published literature on the real game and the problem of infinite expectations. The optimal strategy for a simulation of the end game is computed by dynamic programming.

AB - This paper shows that the optimal betting strategy for a continuous model of backgammon is to double when you have an 80 percent chance of winning. The differences are discussed with the published literature on the real game and the problem of infinite expectations. The optimal strategy for a simulation of the end game is computed by dynamic programming.

UR - http://www.scopus.com/inward/record.url?scp=0016572416&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0016572416&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0016572416

VL - 23

SP - 1063

EP - 1071

JO - Operations Research

JF - Operations Research

SN - 0030-364X

IS - 6

ER -