Document Type

Conference Proceeding

Publication Date



In the children’s board game Hi Ho! Cherry-O, players attempt to move 10 cherries from their trees to a bucket in the center of the game board. A spinner determines whether a turn includes moving cherries from tree to bucket or bucket to tree. The winner of the game is the first player to move all of her cherries from her tree to the bucket. We model the gameplay using a Markov chain and calculate the expected number of turns needed to complete one game. Then we investigate what happens when the rules are changed. We discover that rules changes designed to either increase or decrease the length of the game have the desired effect. However, when rules changes are combined, we find that rules changes designed to decrease the length of a game can hide the effect of rules changes designed to increase the length of a game.



To view the content in your browser, please download Adobe Reader or, alternately,
you may Download the file to your hard drive.

NOTE: The latest versions of Adobe Reader do not support viewing PDF files within Firefox on Mac OS and if you are using a modern (Intel) Mac, there is no official plugin for viewing PDF files within the browser window.