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.
Zoller, Nicholas C., "An Investigation of Hi Ho! Cherry-O Using Markov Chains" (2013). ACMS Conference Proceedings 2013. 30.
Applied Mathematics Commons, Computer Sciences Commons, Higher Education Commons, History of Science, Technology, and Medicine Commons, Mathematics Commons, Science and Mathematics Education Commons, Teacher Education and Professional Development Commons