Hi Ho! Cherry-O
Encyclopedia
Hi Ho! Cherry-O is a children's board game
currently published by Milton Bradley
in which two to four players spin a spinner in an attempt to collect cherries. The original edition, designed by Hermann Wernhard and first published in 1960 by Whitman Publishers , had players compete to collect 10 cherries. During an update in 2007, the rules were updated to include a cooperative play variant, where players cooperate to remove all fruit from the board before a bird puzzle is completed.
, yielding the following results:
Board game
A board game is a game which involves counters or pieces being moved on a pre-marked surface or "board", according to a set of rules. Games may be based on pure strategy, chance or a mixture of the two, and usually have a goal which a player aims to achieve...
currently published by Milton Bradley
Milton Bradley
Milton Bradley , an American game pioneer, was credited by many with launching the board game industry in North America with Milton Bradley Company....
in which two to four players spin a spinner in an attempt to collect cherries. The original edition, designed by Hermann Wernhard and first published in 1960 by Whitman Publishers , had players compete to collect 10 cherries. During an update in 2007, the rules were updated to include a cooperative play variant, where players cooperate to remove all fruit from the board before a bird puzzle is completed.
Spinner
The spinner is divided into 7 sections:- Take 1 cherry from tree
- Take 2 cherries from tree
- Take 3 cherries from tree
- Take 4 cherries from tree
- Dog: Take two cherries from your bucket and place them back on your tree. (If you have only one cherry, put that one back. If you have none do nothing.)
- Bird: Take two cherries from your bucket and place them back on your tree. (If you have only one cherry, put that one back. If you have none do nothing.)
- Spilled basket: replaces all cherries on tree
Analysis
The game length can be determined using a Markov chainMarkov chain
A Markov chain, named after Andrey Markov, is a mathematical system that undergoes transitions from one state to another, between a finite or countable number of possible states. It is a random process characterized as memoryless: the next state depends only on the current state and not on the...
, yielding the following results:
- Minimum game length: 3
- Average game length: 15.8
- Maximum game length: Unbounded
- 25th percentile: 7 moves
- 50th percentile (median): 12 moves
- 75th percentile: 21 moves
- 95th percentile: 40 moves
External links
- Hasbro's Hi Ho! Cherry-O product page
- Hi Ho! Cherry-O at BoardGameGeek Includes many pictures of various game editions.