Ruin with an edge
A player starts with units. Each round they win one unit with probability and lose one unit with probability , independently of the past. They stop as soon as they have or units.
What is the probability that they reach ?
Fractions, decimals with at least 3 significant digits, and expressions such as sqrt(2)/2, e^-1 or pi/4.
Let be the probability of reaching from units. Then , , and in between.
Look for solutions of the form . Or look at the differences : how is related to ?
h
s Shown after a correct answer. Revealing it first marks the problem as seen, not solved.
Idea. Conditioning on the first round gives a linear recurrence. Its increments form a geometric sequence, so the answer is a ratio of geometric sums.
Step 1: recurrence. With , and the probability of reaching from ,
Step 2: increments. Since , write and rearrange: So the increments satisfy with , that is .
Step 3: boundary values. Summing the increments, The condition fixes , and
Step 4: numbers. With and :
Comment. A fair game would give . A edge per round raises it to about ; with a larger target the edge matters even more.