Abstract

SummaryWe prove a conjecture from a 2011 College Mathematics Journal article addressing the expected number of turns in a Chutes and Ladders game when the spinner range is close to the length of the board. While the original paper approached the question using linear algebra and the theory of Markov processes, our main method uses combinatorics and recursion.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call