Matt Maenner asked about the sawtooth pattern in the figure in my last post on Chutes & Ladders.

Damn you, Matt! I thought I was done with this. Don’t feed my obsession.

My response was that if the game ends early, it’s even more likely that it’ll be the kid who went first who won. *But*, my intuition was wrong: exactly the opposite is true. *It is* the advantage to the first player that causes the sawtooth pattern, but that advantage *increases* with the number of rounds rather than decreases.

### Numerical results

While it’s fast and easy to study the Chutes & Ladders game by simulation, if you want to answer questions more precisely, it’s best to switch to more exact results.

Consider a single individual playing the game, and let *X _{n}* be
his/her location at round

*n*. The

*X*form a

_{n}*Markov chain*, in that the future (

*X*), given the present ($X_n$), is conditionally independent of the history (

_{n+1}*X*, …,

_{1}*X*).

_{n-1}It’s relatively easy to construct the transition matrix of the chain. (See my R code.) This is a matrix *P*, with *P _{ij}* = Pr(

*X*=

_{n+1}*j*|

*X*=

_{n}*i*).

Then the probability that a player has reached state 100 by round $n$ is
(1, 0, …, 0) *P ^{n}* (0, …, 0, 1)’. That’s the cumulative distribution function (cdf) of the number of rounds for a single player to finish the game. Call this $q_n$. You can get the probability distribution by differences, say

*p*=

_{n}*q*-

_{n}*q*.

_{n-1}To calculate the number of rounds to complete a game with *k* players, you want the minimum of *k* independent draws from this distribution. The probability that a game with $k$ players is complete by round n is 1 - (1-*q _{n}*)

*. And again you can get the probability distributions by differences. Here’s a picture.*

^{k}### Advantage to the first player

Now, regarding the advantage to the first player: note that the first
player wins in exactly *n* steps if he gets to the finish at n steps
and none of the other players are done by *n-1* steps. So, with *k*
players, the probability that the first player wins in exactly *n* steps is *p _{n}* (1-

*q*)

_{n-1}*.*

^{k-1}The chance that the second player wins in exactly n steps is
(1-*q _{n}*)

*p*(1-

_{n}*q*)

_{n-1}*, with the last term included only if there are*

^{k-2}*k*> 2 players.

From this idea, it’s straightforward to calculate the probability that
the first player wins given that the game is complete at round *n*.
Here’s a plot of that probability as a function of the number of
players, relative to the nominal probability (^{1}⁄_{2}, ^{1}⁄_{3}, ^{1}⁄_{4}).

Note that *n*=7 is the minimum number of rounds to complete the game.
I’d thought that the first player’s advantage went down over time, but
the opposite is true.

### No. spins to end the game

Combining these two results (on the number of rounds to complete the game and the probability that player i will win in n rounds), we can get a more precise version of the simulation-based figure in my last post:

As you can see, the sawtooth pattern becomes more pronounced with the number of rounds, but then it gets lost in the downward slope of the distribution on the right side. (Again, see my R code.)