论文信息 - Estimating Winning Probabilities in Backgammon Races

Estimating Winning Probabilities in Backgammon Races

In modern backgammon, it is advantageous to know the chances each player has of winning, and to be able to compute the chances without the aid of calculators or pencil and paper. A simple model of backgammon is used to approximate those chances, and a readily computable and sufficiently accurate approximation of that is developed. From there, the model is compared to simulated backgammon games, and the previous approximation is modified to fit the real data.

Arthur T. Benjamin | Andrew M. Ross | Michael Munson | A. Benjamin | Michael Munson

[1] Charles M. Grinstead,et al. Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[2] Thomas H. Cormen,et al. Introduction to algorithms [2nd ed.] , 2001 .

[3] P. J. Orth. Letter to the Editor - A Comment on "Optimal Doubling in Backgammon" , 1976, Oper. Res..

[4] Norman Zadeh. On Doubling in Tournament Backgammon , 1977 .

[5] William Feller,et al. An Introduction to Probability Theory and Its Applications , 1967 .

[6] L. Dworsky. An Introduction to Probability , 2008 .

[7] Gerald Tesauro,et al. Programming backgammon using self-teaching neural nets , 2002, Artif. Intell..

[8] Norman Zadeh,et al. On Optimal Doubling in Backgammon , 1977 .

[9] Arthur T. Benjamin,et al. Enumerating Backgammon Positions: The Perfect Hash , 1997 .

[10] W. D. Ray,et al. Stochastic Models: An Algorithmic Approach , 1995 .

[11] Michael Buro. Efficient Approximation of Backgammon Race Equities , 1999, J. Int. Comput. Games Assoc..

[12] Feller William,et al. An Introduction To Probability Theory And Its Applications , 1950 .