Player M has $1 and player N has $2. Each game transfers $1 from the loser to the winner. M is the stronger player and wins any single game with probability . They play until one of them is broke. What is the probability that M ends up with all the money?
Reveal solutionHide solution
#Set up the walk
Track M's fortune. It starts at 1, moves up a dollar when M wins a game and down a dollar when M loses, and stops the moment it hits 0 (M is broke) or 3 (M has swept the table). That is a random walk on with absorbing ends, stepping up with probability and down with .
#The transition matrix
Index the four states by M's fortune. Reading the moves straight off the walk, the one-step transition matrix is
with rows and columns ordered . Rows and carry a lone on the diagonal, the signature of an absorbing state. Each interior row sends M down a dollar with and up a dollar with .
#Solve the absorption equations
Let , the chance M sweeps the table from fortune . The absorbing rows pin and , and every interior state is the matrix-weighted average of where it lands next,
The two interior rows of spell that out,
Substituting the first into the second gives , so and .
#The closed form agrees
For a biased walk with ratio the absorption probability has a clean form. Here , and starting at with the win state at ,
#Read it off
M's edge in skill more than covers her smaller stake. A fair player holding one dollar of three would win only of the time; the win rate per game lifts that to , just past an even chance despite starting behind.