๐Ÿงฎ Brain Teaser

The Gambler's Ruin on a Circle

Seven players sit at a round table, numbered 11 through 77. Each round, a "token" held by player kk moves clockwise (to player k+1โ€Šmodโ€Š7k+1 \bmod 7) with probability 23\tfrac{2}{3}, and counter-clockwise (to player kโˆ’1โ€Šmodโ€Š7k-1 \bmod 7) with probability 13\tfrac{1}{3}.

The game ends when the token reaches player 77 (the "winner") or player 11 (the "loser"). The token starts at player 44.

What is the probability the token reaches player 77 before player 11?

random walkgambler's ruinabsorbing barriergeometric seriesrecurrence

Answer: The Gambler's Ruin on a Circle

Key Idea / Intuition

This is a biased random walk on the integers {1,2,โ€ฆ,7}\{1, 2, \ldots, 7\}, absorbed at the two endpoints. The "circle" framing is just colorful dressing โ€” once you see that the token walks along a line segment between two absorbing barriers, the classic Gambler's Ruin formula applies immediately. The key is that for a biased walk with P(right)=pP(\text{right}) = p and P(left)=q=1โˆ’pP(\text{left}) = q = 1-p, the probability of reaching the right barrier before the left barrier from position kk is given by a clean geometric formula involving r=q/pr = q/p.


Formal Proof / Solution

Setup. Label positions 1,2,โ€ฆ,71, 2, \ldots, 7 with absorbing barriers at 11 (loss) and 77 (win). The token starts at position 44. At each step: p=P(moveย right)=23,q=P(moveย left)=13.p = P(\text{move right}) = \tfrac{2}{3}, \quad q = P(\text{move left}) = \tfrac{1}{3}.

Classic Gambler's Ruin Formula. Let PkP_k = probability of reaching position N=7N = 7 before position 11, starting from kk. The standard result for a biased walk absorbed at {1,N}\{1, N\} is:

Pk=1โˆ’rkโˆ’11โˆ’rNโˆ’1,whereย r=qp.P_k = \frac{1 - r^{k-1}}{1 - r^{N-1}}, \quad \text{where } r = \frac{q}{p}.

Here r=1/32/3=12r = \tfrac{1/3}{2/3} = \tfrac{1}{2}, and Nโˆ’1=6N - 1 = 6.

Derivation sketch. The recurrence Pk=pโ‹…Pk+1+qโ‹…Pkโˆ’1P_k = p \cdot P_{k+1} + q \cdot P_{k-1} with P1=0P_1 = 0, P7=1P_7 = 1 has the general solution Pk=A+Bโ‹…rkโˆ’1P_k = A + B \cdot r^{k-1}. Applying boundary conditions:

  • P1=0โ‡’A+B=0โ‡’A=โˆ’BP_1 = 0 \Rightarrow A + B = 0 \Rightarrow A = -B
  • P7=1โ‡’A+Bโ‹…r6=1โ‡’B(r6โˆ’1)=1P_7 = 1 \Rightarrow A + B \cdot r^6 = 1 \Rightarrow B(r^6 - 1) = 1

So B=1r6โˆ’1B = \tfrac{1}{r^6 - 1}, A=โˆ’1r6โˆ’1A = \tfrac{-1}{r^6 - 1}, giving: Pk=rkโˆ’1โˆ’1r6โˆ’1=1โˆ’rkโˆ’11โˆ’r6.P_k = \frac{r^{k-1} - 1}{r^6 - 1} = \frac{1 - r^{k-1}}{1 - r^6}.

Computation. With k=4k = 4 and r=1/2r = 1/2:

P4=1โˆ’(1/2)31โˆ’(1/2)6=1โˆ’1/81โˆ’1/64=7/863/64=78โ‹…6463=7โ‹…648โ‹…63=448504=89.P_4 = \frac{1 - (1/2)^3}{1 - (1/2)^6} = \frac{1 - 1/8}{1 - 1/64} = \frac{7/8}{63/64} = \frac{7}{8} \cdot \frac{64}{63} = \frac{7 \cdot 64}{8 \cdot 63} = \frac{448}{504} = \frac{8}{9}.

Answer: P4=89.\boxed{P_4 = \dfrac{8}{9}.}

Sanity check. The walk strongly favors moving right (p=2/3p = 2/3), and the token starts exactly in the middle. So a probability well above 12\tfrac{1}{2} of reaching the right barrier makes sense. Indeed 89โ‰ˆ0.889\tfrac{8}{9} \approx 0.889.

Source: Classic probability folklore / Gambler's Ruin

Type: ProbabilitySource: Classic probability folklore / Gambler's RuinEdit on GitHub โ†—