Title: | Chutes and Ladders for the Impatient |

Speaker: | Michael A. Jones Associate Editor Mathematical Reviews Ann Arbor, MI, USA |

Abstract: | I will review the rules and game board for Chutes and Ladders, define a Markov chain to model the game, and describe how properties of Markov chains can be used to determine the expected length of the game. Because the resulting Markov chain has 101 states, the analysis is first done for a 10-state variation in which the board has a single chute and a single ladder. The approach is used to determine the optimal spinner range to minimize the expected number of turns for a player to complete the game. This allows one to modify the game so it takes less time to play—perfect for the impatient player! |

Location: | Palenske 227 |

Date: | 4/12/2012 |

Time: | 3:30 PM |

@abstract{MCS:Colloquium:MichaelAJones:2012:4:12, author = "{Michael A. Jones}", title = "{Chutes and Ladders for the Impatient}", address = "{Albion College Mathematics and Computer Science Colloquium}", month = "{12 April}", year = "{2012}" }