Archive for dice

minimax, maximin or plain

Posted in Kids, R with tags , , , on June 1, 2020 by xi'an

A simple riddle from The Riddler on choosing between the maximum between two minima of two throws of an N-face dice, the minimum between two maxima of two throws of an N-face dice, and a single throw. Since maximin is always less than minimax, second choice is always worse than first and a stochastic domination version of the argument shows the single throw should stand in the middle.

Le Monde puzzle [#847]

Posted in Books, Kids, R, Statistics with tags , , , on December 29, 2013 by xi'an

Another X’mas Le Monde mathematical puzzle:

A regular dice takes the values 4, 8 and 2 on three adjacent faces. Summit values are defined by the product of the three connected faces, e.g., 64 for the above. What values do the three other faces take if the sum of the eight summit values is 1768? 

Here is the simple R code I used to find a solution:

  #(x[1],x[2],x[3]) opposed to (4,8,2)

with the result:

> sol
     [,1] [,2] [,3]
[1,]    2   18   13
[2,]    2   18   13
[3,]    2   18   13
[4,]    6    5   13

which means the missing faces are (6,5,13) since the puzzle also imposed all faces were different. The following histogram of the sample of sums shows a reasonable gamma G(1.9,1763)  fit.