Hostname: page-component-78c5997874-94fs2 Total loading time: 0 Render date: 2024-11-11T09:50:39.502Z Has data issue: false hasContentIssue false
  • English
  • Français

Markov Chains And Snakes And Ladders

Published online by Cambridge University Press:  03 November 2016

D. E. Daykin ,
J. E. Jeacocke  and
D. G. Neal
D. E. Daykin
Affiliation:
University of Malaya, Kuala Lumpur Australian Embassy, Bangkok
J. E. Jeacocke
Affiliation:
University of Malaya, Kuala Lumpur Australian Embassy, Bangkok
D. G. Neal
Affiliation:
University of Malaya, Kuala Lumpur Australian Embassy, Bangkok
Get access Rights & Permissions [Opens in a new window]

Extract

Everybody is familiar with the game of “Snakes and Ladders”, but not so many realise that the game constitutes an interesting example of a Markov chain. We feel that a good way of introducing Markov chain theory is by solving the problem, How long does a game of Snakes and Ladders last? Doubtless the reader has found that the last game before sending a child to bed seems to drag on interminably, and we used a computer to determine the actual average number of moves when 2 people play on a typical board.

Type
Research Article
Information
The Mathematical Gazette , Volume 51 , Issue 378 , December 1967 , pp. 313 - 317
Copyright
Copyright © Mathematical Association 1931

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)