Abstract
We mine the popular board game Chutes and Ladders for a mathematical question regarding shortest average expected game length. By allowing for nonuniform probability distributions in the form of strange spinners and diverse dice combinations, we are able to dramatically improve on previous results. We employ generating functions, combinatorial theorems, Markov chains, evolutionary algorithms, and an appropriate touch of child-like exploration to find a number of possibilities that decrease the average expected game length.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
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
