You are playing a fair die game with 'n' die rolls. You have decided on the "fair" price of the game. So, to take part in this game you need to pay upfront this value. Then you get to roll a die, n times. If you ever role a die more than or equal to this value you instantly cash out, and the game ends. If not, you keep rolling and take whatever is the nth die roll value. For ex:
3 Die Roll Game. You decided the fair value is 3 (this is not the actual fair price, just an illustrative example.) A person rolls a 2 in his first attempt. It is less than 3, he continues. Again rolls a 2, again continues. In his 3rd and last attempt he rolls a 1. He has to cash out now with a value of 1, and hence a net loss of 2 because his 3 rolls are done. (Note, at equality when the die's roll is 3 in this case, he cashes out)
What is the fair value of a game with n rolls, such that the expected profit should be zero.
P.S. This is not the simple choose your maximum out of n die rolls game. I have tried working it out, but I am missing it. Can anyone give me the basic logic that I need to write a code for this. I am looking for a cleaner proof than enumerate all the possibilities. I was thinking on the lines of Recursion.