You are given a die with 100 sides. One side has 1 dot, one has 2 dots and so on up until 100. You are given a chance to roll the die and, however many dots come up, you can choose to (a): take that many dollars, or (b): pay $1 and roll again. You can continue to reroll as many times as you see fit, but you only keep the money of the one roll that you choose to end with. What is the optimal strategy and expected value?
Here we may consider N sided dice with n continue cost. Denote X is expected value under the strategy. There are two strategies:
- Given an fixed number $k,$ when we toss the number $<k:1,\cdots,k-1,$ we continue to toss with cost $n;$ when we toss the number $\geq k:k,\cdots,N,$ we stop and accept the number. Then the expected value can be computed as following: $$X = \dfrac{1}{N}(k+2+...+N) + \dfrac{k-1}{N}(X-n).$$
Then we find the optimal $k$ to maximize $X.$
- Another solution is replacing fixed $k$ in solution 1 by $X$ itself: $$X = \dfrac{1}{N}(X+2+...+N) + \dfrac{X-1}{N}(X-n),$$ and solve the value of $X.$ I am not sure if it makes sense.
I guess solution 1 is correct (since I cannot explain the meaning of solution 2) and I numerically tested the cases where the solution 1 is always larger than solution 2. What's wrong with the solution 2?