๐Ÿงฎ Brain Teaser

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 pp and loses $1 with probability q=1โˆ’pq = 1-p, where p>1/2p > 1/2.

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 p=1/2p = 1/2 (fair game). What is the probability that he is never ruined?

Compare the two answers and explain why the fair game result is surprising.

random walkgambler's ruinrecurrencemartingalequadratic trick

Answer: The Gambler Who Can't Lose... Until He Does

Key Idea / Intuition

For a biased game (p>1/2p > 1/2), 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 kk is (q/p)k(q/p)^k, so starting from $1, ruin probability is exactly q/p<1q/p < 1, meaning survival probability is 1โˆ’q/p>01 - q/p > 0.

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 Z\mathbb{Z} 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 pkp_k = probability of eventual ruin starting from fortune kโ‰ฅ1k \geq 1.

The ruin probability satisfies the recurrence: pk=pโ‹…pk+1+qโ‹…pkโ‹…p1โ‹…โ€ฆp_k = p \cdot p_{k+1} + q \cdot p_k \cdot p_1 \cdot \ldots

More cleanly: let rr = probability of ruin starting from $1. By the Markov property and independence of games, the probability of ruin from fortune kk is rkr^k (to be ruined from kk, you must be ruined kk times in a row from fortune 1 โ€” or more precisely, ruin from kk requires first hitting kโˆ’1k-1, then kโˆ’2k-2, ..., then 00, each with probability rr).

So ruin from $1 satisfies: r=pโ‹…r2+qโ‹…1r = p \cdot r^2 + q \cdot 1

(from $1: win with prob pp โ†’ now at $2, need r2r^2 to reach 0; lose with prob qq โ†’ immediately at $0.)

This gives the quadratic: pr2โˆ’r+q=0p r^2 - r + q = 0

Dividing by pp: r2โˆ’1pr+qp=0r^2 - \frac{1}{p}r + \frac{q}{p} = 0

Factor: (rโˆ’1)โ€‰โฃ(rโˆ’qp)=0(r - 1)\!\left(r - \frac{q}{p}\right) = 0

So the two solutions are r=1r = 1 and r=q/pr = q/p.

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 [0,1][0,1]).

  • If p>1/2p > 1/2: then q/p<1q/p < 1, so the two roots are q/pq/p and 11. The smallest non-negative root is r=q/pr = q/p.
  • If p=1/2p = 1/2: then q/p=1q/p = 1, so both roots coincide at r=1r = 1.
  • If p<1/2p < 1/2: then q/p>1q/p > 1, so the only root in [0,1][0,1] is r=1r = 1.

Results

Biased game (p>1/2p > 1/2), starting from $1: Prโก(ruin)=qp<1\Pr(\text{ruin}) = \frac{q}{p} < 1 Prโก(neverย ruined)=1โˆ’qp=pโˆ’qp>0\boxed{\Pr(\text{never ruined}) = 1 - \frac{q}{p} = \frac{p - q}{p} > 0}

For example, if p=2/3p = 2/3: survival probability =1โˆ’(1/3)/(2/3)=1/2= 1 - (1/3)/(2/3) = 1/2.

Fair game (p=1/2p = 1/2), starting from $1: Prโก(ruin)=1โ€…โ€ŠโŸนโ€…โ€ŠPrโก(neverย ruined)=0\Pr(\text{ruin}) = 1 \implies \boxed{\Pr(\text{never ruined}) = 0}

Why Is the Fair Game Result Surprising?

The gambler has no expected loss per round โ€” his expected fortune grows linearly at rate 00. 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 (p>1/2p > 1/2) 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

Type: ProbabilitySource: Fifty Challenging Problems in Probability with Solutions (Frederick Mosteller), Problem 16โ€“17 context; classical random walk theoryEdit on GitHub โ†—