Recursive method to solve the problem of Gambling with God
Suppose Alice gambles with God who is the dealer. There are n n total rounds in the game and God can choose any m m rounds to win and the other n?m n ? m rounds to lose. At first Alice has holdings a a . In each round, Alice can increase her holdings by q q times the amount she wagers if she wins. So what strategy should Alice take to ensure the maximum total holdings in the end? And how much is the total final holdings? It is called the Gambling with God problem. In this paper, a recursive method is proposed to solve the problem, which shows the extensive application of recursive methods.
recursive method gambling with god problem recursive formula