Here's a question from my probability textbook:
A casino comes up with a fancy dice game. It allows you to roll a dice as many times as you want unless a $6$ appears. After each roll, if $1$ appears, you will win $\$1$; if $2$ appears, you will win $\$2$; $\ldots$; if $5$ appears, you win $\$5$, but if $6$ appears all the money you have won in the game is lost and the game stops. After each roll, if the dice number is $1$-$5$, you can decide whether to keep the money or keep on rolling. How much are you willing to pay to play the game (if you are risk neutral)?
It's been asked before on MSE multiple times:
When to stop rolling a die in a game where 6 loses everything
Dynamic dice game: optimal price to enter
Here's the answer to the question in my book:
Assuming that we have accumulated $n$ dollars, the decision to have another roll or not depends on the expected profit versus expected loss. If we decide to have an extra roll, our expected payoff will become$${1\over6}(n + 1) + {1\over6}(n + 2) + {1\over6}(n + 3) + {1\over6}(n + 4) + {1\over6}(n + 5) + {1\over6} \times 0 = {5\over6}n + 2.5.$$We have another roll if the expected payoff ${5\over6}n + 2.5 > n$, which means that we should keep rolling if the money is no more than $\$14$. Considering that we will stop rolling when $n \ge 15$, the maximum payoff of the game is $\$19$ (the dice rolls a $5$ after reaching the state $n = 14$). We then have the following: $f(19) = 19$, $f(18) = 18$, $f(17) = 17$, $f(16) = 16$, and $f(15) = 15$. When $n \le 14$, we will keep on rolling, so $E[f(n) \mid n \le 14] = {1\over6} \sum_{i = 1}^5 E[f(n + i)]$. Using this equation, we can calculate the value for $E[f(n)]$ recursively for all $n = 14, 13, \ldots, 0$. After laboriously calculating or writing a program, we get $E[f(0)] = 6.15$, and so we are willing to pay at most $\$6.15$ for this game.
However, I'm wondering if there's a quick way by hand to get a reasonable/"good enough" estimate for $E[f(0)]$ without having to do multiple "average-five-numbers-and-repeat" as the book suggests. Is there?