OPTIMAL DOUBLING IN BACKGAMMON.

Emmett B. Keeler; Joel Spencer

doi:10.1287/opre.23.6.1063

OPTIMAL DOUBLING IN BACKGAMMON.

Emmett B. Keeler, Joel Spencer

Computer Science

Research output: Contribution to journal › Article › peer-review

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 language	English (US)
Pages (from-to)	1063-1071
Number of pages	9
Journal	Operations Research
Volume	23
Issue number	6
DOIs	https://doi.org/10.1287/opre.23.6.1063
State	Published - 1975

ASJC Scopus subject areas

Computer Science Applications
Management Science and Operations Research

Access to Document

10.1287/opre.23.6.1063

Cite this

@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",

doi = "10.1287/opre.23.6.1063",

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

Y1 - 1975

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

U2 - 10.1287/opre.23.6.1063

DO - 10.1287/opre.23.6.1063

M3 - Article

AN - SCOPUS:0016572416

SN - 0030-364X

VL - 23

SP - 1063

EP - 1071

JO - Operations Research

JF - Operations Research

IS - 6

ER -

OPTIMAL DOUBLING IN BACKGAMMON.

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this