The Gambler Who Can't Lose... Until He Does
A gambler plays a sequence of independent games. In each game, he wins $1 with probability and loses $1 with probability , where .
He starts with $1 and plays until he either reaches $0 (ruin) or decides to stop. He never voluntarily stops.
Question: What is the probability that he is never ruined โ i.e., his fortune stays positive for all time?
Now for the elegant twist: suppose instead (fair game). What is the probability that he is never ruined?
Compare the two answers and explain why the fair game result is surprising.
Answer: The Gambler Who Can't Lose... Until He Does
Key Idea / Intuition
For a biased game (), there is a genuine chance of escaping ruin forever โ the random walk drifts upward, so with positive probability it never returns to 0. The probability of eventual ruin from fortune is , so starting from $1, ruin probability is exactly , meaning survival probability is .
For the fair game, the shocking answer is: the gambler is ruined with probability 1. Despite having no negative drift, a simple random walk on is recurrent โ it visits every state infinitely often, so it will inevitably hit 0. The survival probability is exactly 0.
This contrast is the heart of the problem: a tiny positive drift makes all the difference between certain doom and genuine hope.
Formal Proof / Solution
Setup: Gambler's Ruin
Let = probability of eventual ruin starting from fortune .
The ruin probability satisfies the recurrence:
More cleanly: let = probability of ruin starting from $1. By the Markov property and independence of games, the probability of ruin from fortune is (to be ruined from , you must be ruined times in a row from fortune 1 โ or more precisely, ruin from requires first hitting , then , ..., then , each with probability ).
So ruin from $1 satisfies:
(from $1: win with prob โ now at $2, need to reach 0; lose with prob โ immediately at $0.)
This gives the quadratic:
Dividing by :
Factor:
So the two solutions are and .
Which root do we take?
We need the smallest non-negative solution (this is the standard theory of branching processes / random walk โ take the root in ).
- If : then , so the two roots are and . The smallest non-negative root is .
- If : then , so both roots coincide at .
- If : then , so the only root in is .
Results
Biased game (), starting from $1:
For example, if : survival probability .
Fair game (), starting from $1:
Why Is the Fair Game Result Surprising?
The gambler has no expected loss per round โ his expected fortune grows linearly at rate . Yet he is certain to be ruined.
The deeper reason: simple symmetric random walk in 1D is recurrent โ it returns to every state with probability 1. In particular, it returns to 0. There is no escape.
In contrast, simple random walk in 3D is transient โ it escapes to infinity with positive probability. Dimensionality (or drift) is what separates hope from doom.
The moral: zero expected loss does not mean zero risk of ruin. The gambler needs a strict positive edge () just to have a fighting chance of surviving forever.
Source: Fifty Challenging Problems in Probability with Solutions (Frederick Mosteller), Problem 16โ17 context; classical random walk theory