id: 06495938
dt: j
an: 2015f.00862
au: Connors, Darcie; Glass, Darren
ti: Chutes and ladders with large spinners.
so: Coll. Math. J. 45, No. 4, 289-295 (2014).
py: 2014
pu: Mathematical Association of America (MAA), Washington, D.C.
la: EN
cc: K25 A25
ut: chutes and ladders; large spinners; combinatorics; recursion
ci: Zbl 1272.97053; ME 2011c.00772
li: doi:10.4169/college.math.j.45.4.289
ab: 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.
rv: