@article {MATHEDUC.06495938,
author = {Connors, Darcie and Glass, Darren},
title = {Chutes and ladders with large spinners.},
year = {2014},
journal = {The College Mathematics Journal},
volume = {45},
number = {4},
issn = {0746-8342},
pages = {289-295},
publisher = {Mathematical Association of America (MAA), Washington, D.C.},
doi = {10.4169/college.math.j.45.4.289},
abstract = {Summary: We prove a conjecture from [{\it L. A. Cheteyan} et al., ibid. 42, No. 1, 2--8 (2011; Zbl 1272.97053; ME 2011c.00772)] addressing the expected number of turns in a {\it 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.},
msc2010 = {K25xx (A25xx)},
identifier = {2015f.00862},
}