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.
ASJC Scopus subject areas
- Computer Science Applications
- Management Science and Operations Research