Hostname: page-component-788cddb947-xdx58 Total loading time: 0 Render date: 2024-10-12T06:55:10.573Z Has data issue: false hasContentIssue false

The dice-and-numbers game

Published online by Cambridge University Press:  17 October 2016

Antal A. Járai*
Affiliation:
Department of Mathematical Sciences, University of Bath, Claverton Down, Bath BA1 7AY e-mail: A.Jarai@bath.ac.uk

Extract

In maths lessons in secondary school, on certain occasions my teacher entertained our class with the following game. Each player starts with an empty 2 × 5 grid, as shown in Figure 1(a). In each round of the game, a die is rolled, and each player has to choose one of the empty boxes in their grid and fill it with the number rolled. For example, after 3 rounds, a player's grid may look like the one in Figure 1(b). After 10 rounds everyone's grid is filled, forming two 5-digit numbers. A player's score is the sum of her/his two 5-digit numbers. Players with the largest sum win the game. We shall call this the ‘dice-and-numbers game’. It is easy to think of other variants. Any child who is comfortable with column addition and understands how place value affects the size of numbers will develop a reasonable strategy for the game.

Type
Articles
Copyright
Copyright © Mathematical Association 2016 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

1. Derman, C., Lieberman, G. J. and Ross, S. M., A sequential stochastic assignment problem, Management Sci. 18 (1972) pp. 349355.Google Scholar
2. Feller, W., An introduction to probability theory and its applications. Vol. I (3rd edn.), Wiley, New York (1968).Google Scholar
3. Ross, S., Introduction to stochastic dynamic programming, Probability and Mathematical Statistics, Academic Press, New York (1983).Google Scholar
4. Albright, C. and Derman, C., Optimal policies for the sequential stochastic assignment problem, Management Sci. 19 (1972) pp. 4651.Google Scholar