Suppose you and a friend decide to play a game of pure chance. You’ll flip a fair coin: heads, your friend pays you 1. Both outcomes are equally likely. You agree to play until one of you runs out of money.
You start with 1000.
What is your probability of winning — that is, of bankrupting your friend before they bankrupt you?
If you think about this intuitively, you might guess something like “small chance, maybe 10%.” After all, your friend has much more money. But the actual answer is much worse:
Your probability of winning is exactly .
Less than one percent. You have a 99.01% chance of losing all your money before your friend loses theirs.
This is the Gambler’s Ruin problem, one of the oldest results in probability theory, dating back to the correspondence between Pascal and Fermat in 1654. The result is mathematically certain: in a fair game against a wealthier opponent, the small player almost always loses. Wealth isn’t just an advantage in gambling. It’s nearly an inevitability.
This article is about what gambler’s ruin says, why the asymmetry is so dramatic, and where the same mathematical structure appears in places that have nothing obviously to do with gambling.
The classical formula
Setup: two players, A and B. They play a fair game where A wins one unit from B with probability and loses one unit to B with probability . Player A starts with dollars, player B starts with dollars. Play continues until one of them is bankrupt.
For a fair game ():
The probability of A winning equals the fraction of total wealth A starts with. Player B’s chance is symmetric: .
If A has 1000, A’s chance is . If A has 1000, A’s chance is . If A has 1000, A’s chance is .
The probability is just the wealth fraction. This is mathematically certain in an idealized fair game continued long enough.
For an unfair game with (one player has an edge):
If (A has the advantage), this formula gives A a higher chance than the wealth fraction alone — but B’s wealth still matters.
Why the formula is what it is
The mathematics comes from analyzing a random walk. Player A’s wealth performs a random walk on the integers — up by 1 with probability , down by 1 with probability . The walk stops when A’s wealth hits 0 (A loses) or (A wins, B is bankrupt).
This is the classic “absorbing random walk” — a Markov chain with two absorbing boundary states. (See our random walks piece for the broader picture.)
Let be the probability that A wins, starting with wealth . The recurrence:
With boundary conditions and . For the fair case , the solution is linear: . For the unfair case, the solution involves the ratio .
The math is elementary. The lesson is striking.
A visual illustration
The red walks reach the ruin boundary (1010). In a fair game with starting wealth 1000, the green outcome happens about 1 time in 100.
Why the asymmetry is so harsh
The dramatic asymmetry comes from a structural fact about random walks: the walk’s typical excursion grows as (where is the number of steps), but the gap to ruin is just your wealth.
If you have 1000, the gap to your ruin is 10 dollars. The gap to your opponent’s ruin is 1000 dollars. After about 100 fair coin flips, the random walk has typically fluctuated by about units. So you can easily hit your ruin boundary just from normal fluctuations.
Reaching the opponent’s ruin boundary requires hitting a distance of 1000 units. That requires the walk to fluctuate by about steps’ worth of standard deviation — basically not happening in a finite game with the chance gap there.
Wealth provides a buffer against random fluctuations. The buffer ratio matters more than absolute wealth. Two players with \1$100$1{,}000{,}000$100{,}000{,}000$ — the smaller player has a 1% chance in both cases.
The unfair-game asymmetry
When the game is biased — say, the casino has a small edge ( for the player) — the formula changes dramatically:
For (player at disadvantage), the term grows exponentially with . The numerator approaches negative infinity, but the denominator approaches negative infinity faster. The ratio approaches a small number.
Concrete: roulette has for red (in the American version), so . With a = \100b = $10{,}000$ (you against the casino), the player’s chance of winning is:
Essentially zero. In a game with even tiny house edge, played long enough, the casino wins with near-certainty. This is why casinos are profitable, even though individual bets are nearly fair.
Where gambler’s ruin appears
The mathematical structure of gambler’s ruin appears in many situations beyond gambling.
Stock trading. A trader using fixed-bet strategies (buying the same dollar amount of stock each trade) is in essentially a gambler’s-ruin scenario. Even with positive expected return, a string of losses can blow up the account. This is why professional traders use position sizing: fixed-fractional or Kelly-criterion bets that scale to current wealth rather than absolute amounts. With proper sizing, the trader avoids the ruin scenario by never betting too much during drawdowns.
Startup runway. A startup burns through cash on operations while waiting for revenue or funding. The “ruin” is running out of money before reaching profitability or the next funding round. With small reserves, even small revenue volatility can cause ruin. This is why startups raise larger rounds than strictly needed — the buffer matters.
Insurance reserves. Insurance companies are in a continuous gambler’s-ruin scenario. They collect premiums and pay claims. Random fluctuation in claim experience can wipe out reserves. Regulators require minimum reserves precisely to protect against ruin.
Random walk in physics. Diffusion processes that can be absorbed at boundaries — particles diffusing in a region with absorbing walls — have the same mathematical structure. The probability of escape vs. absorption follows the gambler’s ruin formula.
Population biology. Small populations face extinction not from selection pressure alone, but from random demographic fluctuations. A population of 10 individuals can go extinct from sheer bad luck (everyone happens to die or fail to reproduce) even if the population is growing on average. Small population sizes are vulnerable to stochastic extinction in exactly the gambler’s-ruin sense.
Random walks on graphs. Hitting probabilities on graphs — the probability of reaching one node before another, starting from a third — are gambler’s-ruin-style calculations.
In each case, the structure is the same: a process fluctuating randomly with two absorbing boundaries, and the question is which boundary it hits first.
The strategy implications
Understanding gambler’s ruin has practical consequences.
Don’t play fair games to “make money.” A fair coin flip with bets is, expected-value-wise, neutral. But the variance creates ruin risk. If you start small, you’ll likely go broke before getting wealthy.
Avoid negative-edge games. If , the formula says you’re guaranteed to lose long-term. Casinos, lotteries, and prediction markets with house edges all fall into this category. Playing them is statistically a slow drain on your wealth.
Bet sizes should scale with bankroll. The Kelly criterion, derived from gambler’s ruin and related results, says optimal bet size is a fraction of current wealth — specifically of current wealth for a game with edge . Fractional Kelly (half-Kelly or quarter-Kelly) is more conservative and is the standard in professional gambling and trading.
Variance matters as much as expected value. A strategy with high expected return but high variance can ruin you anyway. Diversification reduces variance without (much) reducing expected return — this is the fundamental insight of modern portfolio theory.
Time horizon matters. Short games favor the small player slightly (random luck can produce wins). Long games favor the wealthy player. In a game played long enough, the long-run dynamics dominate.
Historical note
The gambler’s ruin problem was first analyzed in correspondence between Blaise Pascal and Pierre de Fermat in 1654. A nobleman asked Pascal about a fair-game scenario, and Pascal worked it out and wrote to Fermat. The correspondence is one of the founding documents of probability theory.
Christiaan Huygens published the first probability textbook in 1657, De Ratiociniis in Ludo Aleae (“On Reasoning in Games of Chance”), which discussed gambler’s ruin and other early probability problems.
Abraham de Moivre developed more general theory in the early 1700s. The recurrence-equation method for solving gambler’s ruin is essentially due to him.
By the 19th century, the problem was a standard textbook exercise. In the 20th century, it became one of the foundational examples in the theory of Markov chains and stochastic processes.
What gambler’s ruin teaches
The deepest lesson of gambler’s ruin is that wealth is a structural advantage in any volatile situation, not just a starting advantage. Random fluctuations exist in any system. The party with more reserves has a buffer against bad luck. The party with less reserves can be wiped out by it.
This applies broadly:
- In politics, the candidate with more money to spend on ads, staff, and travel has a structural advantage in any tight race.
- In business, larger companies survive recessions that bankrupt their smaller competitors, often despite the smaller competitor being better managed.
- In science, well-funded labs survive failed experiments that wreck under-funded labs.
- In sports, teams with more depth on the bench can absorb injuries that cripple thinner rosters.
In each case, what looks like superior performance is partly the buffer effect. Wealth is reserve capacity, and reserve capacity is what survives randomness.
For working mathematicians, gambler’s ruin is one of the cleanest applications of Markov chain theory and random walks. It illustrates absorbing boundary conditions, generating functions for hitting probabilities, and the difference between expected behavior and probability of survival.
For everyone else, the lesson is more practical: don’t play games you can lose. If the math says you’ll go broke eventually, the math is right. The seductive feature of fair games is that they feel safe — each individual bet has zero expected loss. But the cumulative dynamics, with finite starting wealth, are not safe at all.
Pascal and Fermat noticed this in 1654. The math has held up for 370 years. When two parties play long enough, the wealthier one almost always wins — and “almost always” has an exact probability that you can compute.
If you’re the smaller player, the rational strategy is: don’t play, change the rules, or accept the loss as the price of participation. There’s no clever strategy that overcomes the fundamental mathematics. Wealth is the strategy.
That’s an old, hard, mathematical truth. Worth knowing, even if it’s uncomfortable.
Frequently asked
Is it really mathematically inevitable that the small player loses?
In an idealized fair game played indefinitely against an infinitely wealthy opponent, yes. With probability 1, the smaller player eventually reaches zero. Against a finite opponent, the small player has a chance — but that chance decreases as the wealth ratio increases. Wealth is not just an advantage; it's a structural near-guarantee.
What does this have to do with stock trading?
A trader using fixed-bet strategies in volatile markets is in essentially a gambler's-ruin scenario. Even a winning strategy can blow up an account during a drawdown if position sizes don't shrink during losses. This is why professional traders use position sizing rules (Kelly criterion, fractional Kelly) that adapt to current wealth rather than betting a fixed amount.
Why does the formula favor unequal wealth so dramatically?
Because the random walk's expected position after n steps is zero (in a fair game), but its standard deviation grows as √n. So fluctuations of any size happen eventually. The smaller player's wealth is closer to the ruin boundary at zero, so they're more likely to hit it. Wealth provides a 'cushion' against random fluctuations, and the cushion ratio matters more than absolute amounts.