Given the following game, what is the best strategy to maximize your total score?
Each game play starts with a random point value. You are then given a chance to multiply that value by choosing between 1-5 dice to roll. If you select n dice, all n must come up six. If you don't win the dice toss, you still keep the starting value. The return values for the different number of dice are:
- n = 0: 1x
- n = 1: 2x
- n = 2: 5x
- n = 3: 30x
- n = 4: 200x
- n = 5: 1000x
You are allowed to repeatedly play the game and the total score is cumulative across game plays.
Let $P$ be the point value. The expected profit (compared to failure) from setting $n = 1$ is $$ E = \frac 16\cdot (2-1)P $$ Similarly, $$ n=2: E = \frac 1{6^2}(5-1)P\\ n=3: E = \frac 1{6^3}(30-1)P\\ n=4: E = \frac 1{6^4}(200-1)P\\ n=5: E = \frac 1{6^5}(1000-1)P\\ $$ So, in any particular turn, we maximize the expected profit by selecting $n=1$. So, sticking to $n=1$ seems to be the optimal strategy, in the long run.