The Gambler's Ruin on a Circle
Seven players sit at a round table, numbered through . Each round, a "token" held by player moves clockwise (to player ) with probability , and counter-clockwise (to player ) with probability .
The game ends when the token reaches player (the "winner") or player (the "loser"). The token starts at player .
What is the probability the token reaches player before player ?
Answer: The Gambler's Ruin on a Circle
Key Idea / Intuition
This is a biased random walk on the integers , 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 and , the probability of reaching the right barrier before the left barrier from position is given by a clean geometric formula involving .
Formal Proof / Solution
Setup. Label positions with absorbing barriers at (loss) and (win). The token starts at position . At each step:
Classic Gambler's Ruin Formula. Let = probability of reaching position before position , starting from . The standard result for a biased walk absorbed at is:
Here , and .
Derivation sketch. The recurrence with , has the general solution . Applying boundary conditions:
So , , giving:
Computation. With and :
Answer:
Sanity check. The walk strongly favors moving right (), and the token starts exactly in the middle. So a probability well above of reaching the right barrier makes sense. Indeed .
Source: Classic probability folklore / Gambler's Ruin