Skip to main content Accessibility help
×
Home

Optimal strategy in a dice game

  • John Haigh (a1) and Markus Roters (a2)

Abstract

Computer simulations had suggested that the strategy that maximises the score on each turn in the dice game described by Roters (1998) may not be the optimal way to reach a given target in the shortest time. We give an analytical treatment, backed by numerical calculations, that finds the optimal strategy to reach such a target.

Copyright

Corresponding author

Postal address: Centre for Statistics and Stochastic Modelling, School of Mathematical Sciences, University of Sussex, Falmer, Brighton BN1 9QH, UK. Email address: j.haigh@sussex.ac.uk
∗∗ Postal address: Universität Potsdam, Institut für Mathematik, Postfach 60 15 53, D-14415 Potsdam, Germany.

References

Hide All
Roters, M. (1998). Optimal stopping in a dice game. J. Appl. Prob. 35, 229235.
Schäl, M. (1990). Markoffsche Entscheidungsprozesse. Teubner, Stuttgart.

Keywords

MSC classification

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed