This recreational mathematics article shows that the game of Snakes and Ladders is intransitive: square 69 has a winning edge over 79, which in turn beats 73, which beats 69. Analysis of the game is a nice illustration of Markov chains, simulations of different sorts, and size-biased sampling. Connecting this to "intransitive dice" illustrates the power of a name, and the joy of working with colleagues. When draws do not count, we show a minimal example of intransitive dice, with one die having just a single "face" and two dice each having two faces.
Paper
Similar papers
Limit Cases And Strategy In Chutes and LaddersVincent Ciarcia, Erik Insko2026 · Open MIND In Library
Intransitively Winning Chess Players’ PositionsAlexander Poddiakov2024 · Doklady Mathematics In Library