Real World Maths Busters

The Maths Behind Everyday Life

The story, the formula and a worked example — see exactly where this maths shows up in the world around you.

Back to all stories
Games & Chance 4 min read

Snakes and Ladders Expected Moves

How many rolls to reach square 100?

Each square is a state in a Markov chain. The transition probabilities depend on the die roll (1-6) and any snakes or ladders at the destination.

Why Markov chains?

Your future position depends only on your current square, not how you got there — the Markov property.

P(Xn+1=j∣Xn=i)=pijP(X_{n+1} = j \mid X_n = i) = p_{ij}

Average game length

Solving the system of equations for expected steps from each square, the start-to-finish expectation is approximately 36 moves on a standard 10×10 board.

Without any snakes or ladders

  1. 1

    Step

    On a plain 100-square board with die 1-6

  2. 2

    Step

    Expected moves = about 29

Answer

Snakes add roughly 7 extra moves on average

The formula behind it

Expected Value

E(X)=∑xi⋅P(xi)E(X) = \sum x_i \cdot P(x_i)
See the full formula, variables and more examples

The takeaway

Pure luck over about 36 rolls — but those snakes add real delays.

Back to all stories