Hostname: page-component-586b7cd67f-tf8b9 Total loading time: 0 Render date: 2024-11-25T09:15:19.807Z Has data issue: false hasContentIssue false
  • English
  • Français

Doubling strategies for backgammon-like games

Published online by Cambridge University Press:  17 February 2009

E. O. Tuck
E. O. Tuck
Affiliation:
Department of Applied Mathematics, University of Adelaide, Adelaide, South Australia, 5001
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Optimal strategies are obtained for two-player games with an alternating staek doubling option. A complete two-parameter analysis is provided for games that must end within two moves, and a recursive procedure then enables a solution for games of any number of moves. Examples are given of relevance to extureme end games in backgammon.

Type
Research Article
Information
The ANZIAM Journal , Volume 21 , Issue 4 , April 1980 , pp. 440 - 451
Copyright
Copyright © Australian Mathematical Society 1980

References

[1]Jacoby, O. and Crawford, J. R., The backgammon book (Pan, London, 1975).Google Scholar
[2]Keeler, E. B. and Spencer, J., “Optimal doubling in backgammon”, Operations Research 23 (1975), 1063–1071.CrossRefGoogle Scholar
[3]Tuck, E. O., “Backgammon end-game doubling strategies”, University of Adelaide, Applied Mathematics Report T7904 (1979).Google Scholar