Geodesic
Optimal doubling strategies in backgammon
Contributions to game theory and management, Tome 8 (2015), pp. 33-46.

Voir la notice de l'article provenant de la source Math-Net.Ru

In this paper we discuss decision procedures related to an important aspect of the backgammon game, namely a doubling. We focus on proper choice of the doubling time and optimal strategies on whether to accept or reject the doubling proposed by the opponent. There are two stages of the game that are most amenable to the analysis. The first one is called “the races”, during this stage opponent's checkers do not block player's moves, the goal is to put all checkers into “the house” and then to take them off the board. In this case we calculate optimal doubling time as well as the optimal strategy for acceptance and rejection. Another case is the so-called two-steps game, the situation in which each player has at most one turn before the game ends. This situation is analyzed using the concept of complex rational behavior.
Keywords: backgammon, decision making, doubling strategies. 
@article{CGTM_2015_8_a3,
     author = {Sergei I. Dotsenko and Alexander V. Marynych},
     title = {Optimal doubling strategies in backgammon},
     journal = {Contributions to game theory and management},
     pages = {33--46},
     publisher = {mathdoc},
     volume = {8},
     year = {2015},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/CGTM_2015_8_a3/}
}
TY  - JOUR
AU  - Sergei I. Dotsenko
AU  - Alexander V. Marynych
TI  - Optimal doubling strategies in backgammon
JO  - Contributions to game theory and management
PY  - 2015
SP  - 33
EP  - 46
VL  - 8
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/CGTM_2015_8_a3/
LA  - en
ID  - CGTM_2015_8_a3
ER  - 
%0 Journal Article
%A Sergei I. Dotsenko
%A Alexander V. Marynych
%T Optimal doubling strategies in backgammon
%J Contributions to game theory and management
%D 2015
%P 33-46
%V 8
%I mathdoc
%U http://geodesic.mathdoc.fr/item/CGTM_2015_8_a3/
%G en
%F CGTM_2015_8_a3
Sergei I. Dotsenko; Alexander V. Marynych. Optimal doubling strategies in backgammon. Contributions to game theory and management, Tome 8 (2015), pp. 33-46. http://geodesic.mathdoc.fr/item/CGTM_2015_8_a3/

[1] Buro M., “Efficient approximation of backgammon race equities”, International Computer Chess Association Journal, 22:3 (1999), 133–142

[2] Feller W., An Introduction to Probability Theory and Its Applications, v. 2, Second Edition, John Wiley Sons, 1970, 669 pp. | MR

[3] Keeler E., Spencer J., “Optimal doubling in backgammon”, Operations Research, 23:4 (1975), 1063–1071 | MR | Zbl

[4] Kissane J., “Cluster counting”, Chicago point, 52 (1992)

[5] Lamford P., Gasquoine S., Improve your backgammon, London, Everyman, 2003, 128 pp.

[6] Mörters P., Peres Y., Brownian Motion, Cambridge University Press, 2010, 357 pp. | MR | Zbl

[7] Ross A., Benjamin A., Munson M., “Estimating winning probabilities in backgammon races”, Optimal Play: Mathematical Studies of Games and Gambling, 2007, 269–291 | Zbl

[8] Tuck E., “Doubling strategies for backgammon-like games”, J. Austral. Math. Soc. Series B, 21 (1980), 440–451 | MR | Zbl

[9] Zadeh N., Kobilska G., “On optimal doubling in backgammon”, Management Science, 23:8 (1977), 853–858 | MR | Zbl