Penney's game

Last updated
A possible sequence in Penney's game: heads, tails, heads Heads tails heads.jpg
A possible sequence in Penney's game: heads, tails, heads
Graphs of best responses for Penny's games of sequence lengths 3 and 4 - each sequence is dominated by the sequence pointing to it with the given probability (italics) or odds (normal text) Penney game graphs.svg
Graphs of best responses for Penny's games of sequence lengths 3 and 4 each sequence is dominated by the sequence pointing to it with the given probability (italics) or odds (normal text)

Penney's game, named after its inventor Walter Penney, is a binary (head/tail) sequence generating game between two players. Player A selects a sequence of heads and tails (of length 3 or larger), and shows this sequence to player B. Player B then selects another sequence of heads and tails of the same length. Subsequently, a fair coin is tossed until either player A's or player B's sequence appears as a consecutive subsequence of the coin toss outcomes. The player whose sequence appears first wins.

Contents

Provided sequences of at least length three are used, the second player (B) has an edge over the starting player (A). This is because the game is nontransitive such that for any given sequence of length three or longer one can find another sequence that has higher probability of occurring first.

Analysis of the three-bit game

For the three-bit sequence game, the second player can optimize their odds by choosing sequences according to:

1st player's choice2nd player's choiceOdds in favour of 2nd player
HHHTHH7 to 1
HHTTHH3 to 1
HTHHHT2 to 1
HTTHHT2 to 1
THHTTH2 to 1
THTTTH2 to 1
TTHHTT3 to 1
TTTHTT7 to 1

An easy way to remember the sequence is for the second player to start with the opposite of the middle choice of the first player, then follow it with the first player's first two choices.

So for the first player's choice of 1-2-3
the second player must choose (not-2)-1-2

where (not-2) is the opposite of the second choice of the first player.

An intuitive explanation for this result is that in any case that the sequence is not immediately the first player's choice, the chances for the first player getting their sequence-beginning, the opening two choices, are usually the chance that the second player will be getting their full sequence. So the second player will most likely "finish before" the first player.

Strategy for more than three bits

The optimal strategy for the first player (for any length of the sequence no less than 4) was found by J.A. Csirik (See References). It is to choose HTTTT.....TTTHH ( T's) in which case the second player's maximal odds of winning is .

Variation with playing cards

One suggested variation on Penney's Game uses a pack of ordinary playing cards. The Humble-Nishiyama Randomness Game follows the same format using Red and Black cards, instead of Heads and Tails. [2] [3] The game is played as follows. At the start of a game each player decides on their three colour sequence for the whole game. The cards are then turned over one at a time and placed in a line, until one of the chosen triples appears. The winning player takes the upturned cards, having won that "trick". The game continues with the rest of the unused cards, with players collecting tricks as their triples come up, until all the cards in the pack have been used. The winner of the game is the player that has won the most tricks. An average game will consist of around 7 "tricks". As this card-based version is quite similar to multiple repetitions of the original coin game, the second player's advantage is greatly amplified. The probabilities are slightly different because the odds for each flip of a coin are independent while the odds of drawing a red or black card each time is dependent on previous draws. Note that HHT is a 2:1 favorite over HTH and HTT but the odds are different for BBR over BRB and BRR.

Below are approximate probabilities of the outcomes for each strategy based on computer simulations: [4]

1st player's choice2nd player's choiceProbability 1st player winsProbability 2nd player winsProbability of a draw
BBBRBB0.11%99.49%0.40%
BBRRBB2.62%93.54%3.84%
BRBBBR11.61%80.11%8.28%
BRRBBR5.18%88.29%6.53%
RBBRRB5.18%88.29%6.53%
RBRRRB11.61%80.11%8.28%
RRBBRR2.62%93.54%3.84%
RRRBRR0.11%99.49%0.40%

If the game is ended after the first trick, there is a negligible chance of a draw. The odds of the second player winning in such a game appear in the table below.

1st player's choice2nd player's choiceOdds in favour of 2nd player
BBBRBB7.50 to 1
BBRRBB3.08 to 1
BRBBBR1.99 to 1
BRRBBR2.04 to 1
RBBRRB2.04 to 1
RBRRRB1.99 to 1
RRBBRR3.08 to 1
RRRBRR7.50 to 1

Variation with a Roulette wheel

Recently Robert W. Vallin, and later Vallin and Aaron M. Montgomery, presented results with Penney's Game as it applies to (American) roulette with Players choosing Red/Black rather than Heads/Tails. In this situation the probability of the ball landing on red or black is 9/19 and the remaining 1/19 is the chance the ball lands on green for the numbers 0 and 00. There are various ways to interpret green: (1) as a "wild card" so that BGR can be read at Black, Black, Red and Black, Red, Red, (2) as a do-over, the game stops when green appears and restarts with the next spin, (3) as just itself with not extra interpretation. Results have been worked out for odds and wait times. [5]

See also

Related Research Articles

The gambler's fallacy, also known as the Monte Carlo fallacy or the fallacy of the maturity of chances, is the incorrect belief that, if a particular event occurs more frequently than normal during the past, it is less likely to happen in the future, when it has otherwise been established that the probability of such events does not depend on what has happened in the past. Such events, having the quality of historical independence, are referred to as statistically independent. The fallacy is commonly associated with gambling, where it may be believed, for example, that the next dice roll is more than usually likely to be six because there have recently been fewer than the expected number of sixes.

In poker, the probability of each type of 5-card hand can be computed by calculating the proportion of hands of that type among all possible hands.

<span class="mw-page-title-main">Piquet</span>

Piquet is an early 16th-century plain-trick card game for two players that became France's national game. David Parlett calls it a "classic game of relatively great antiquity... still one of the most skill-rewarding card games for two" but one which is now only played by "aficionados and connoisseurs."

A martingale is a class of betting strategies that originated from and were popular in 18th-century France. The simplest of these strategies was designed for a game in which the gambler wins the stake if a coin comes up heads and loses if it comes up tails. The strategy had the gambler double the bet after every loss, so that the first win would recover all previous losses plus win a profit equal to the original stake. Thus the strategy is an instantiation of the St. Petersburg paradox.

<span class="mw-page-title-main">Coin flipping</span> Practice of throwing a coin in the air to choose between two alternatives

Coin flipping, coin tossing, or heads or tails is the practice of throwing a coin in the air and checking which side is showing when it lands, in order to choose between two alternatives, heads or tails, sometimes used to resolve a dispute between two parties. It is a form of sortition which inherently has two possible outcomes. The party who calls the side that is facing up when the coin lands wins.

Matching pennies is the name for a simple game used in game theory. It is played between two players, Even and Odd. Each player has a penny and must secretly turn the penny to heads or tails. The players then reveal their choices simultaneously. If the pennies match, then Even keeps both pennies, so wins one from Odd. If the pennies do not match Odd keeps both pennies, so receives one from Even.

In mathematics, a subset of a Polish space is universally measurable if it is measurable with respect to every complete probability measure on that measures all Borel subsets of . In particular, a universally measurable set of reals is necessarily Lebesgue measurable.

German Whist is a variation on classic whist for two players. Also called Chinese Whist, it is probably of British origin.

In contract bridge, the principle of restricted choice states that "The play of a card which may have been selected as a choice of equal plays increases the chance that the player started with a holding in which his choice was restricted." Crucially, it helps play "in situations which used to be thought of as guesswork."

<span class="mw-page-title-main">Clabber</span>

Clabber is a four-player trick-taking card game played in southwestern Indiana near Evansville. Clabber is a member of the Jack-Nine family of trick-taking card games that are popular in Europe. The game is a four player variation similar to that of klaberjass. The game also plays similar to Euchre, with a few differences being that points are not awarded based on the number of tricks taken, but rather on the actual point value of cards in those tricks. Clabber also doesn't use a left Bower, as does Euchre; other differences are that players don't use Bidding, instead, the trump makers must score at least eighty-two points to keep from "going set", where they don't score any of their points. Additional points can also be scored for a combination of cards in a hand, which would assist in "making it", or, not going set.

<span class="mw-page-title-main">Monty Hall problem</span> Probability puzzle

The Monty Hall problem is a brain teaser, in the form of a probability puzzle, loosely based on the American television game show Let's Make a Deal and named after its original host, Monty Hall. The problem was originally posed in a letter by Steve Selvin to the American Statistician in 1975. It became famous as a question from reader Craig F. Whitaker's letter quoted in Marilyn vos Savant's "Ask Marilyn" column in Parade magazine in 1990:

Suppose you're on a game show, and you're given the choice of three doors: Behind one door is a car; behind the others, goats. You pick a door, say No. 1, and the host, who knows what's behind the doors, opens another door, say No. 3, which has a goat. He then says to you, "Do you want to pick door No. 2?" Is it to your advantage to switch your choice?

The mathematics of gambling are a collection of probability applications encountered in games of chance and can be included in game theory. From a mathematical point of view, the games of chance are experiments generating various types of aleatory events, the probability of which can be calculated by using the properties of probability on a finite space of events.

The ludic fallacy, proposed by Nassim Nicholas Taleb in his book The Black Swan (2007), is "the misuse of games to model real-life situations". Taleb explains the fallacy as "basing studies of chance on the narrow world of games and dice". The adjective ludic originates from the Latin noun ludus, meaning "play, game, sport, pastime".

<span class="mw-page-title-main">Miwin's dice</span>

Miwin's Dice are a set of nontransitive dice invented in 1975 by the physicist Michael Winkelmann. They consist of three different dice with faces bearing numbers from one to nine; opposite faces sum to nine, ten or eleven. The numbers on each die give the sum of 30 and have an arithmetic mean of five.

<span class="mw-page-title-main">Randomness</span> Apparent lack of pattern or predictability in events

In common usage, randomness is the apparent or actual lack of pattern or predictability in information. A random sequence of events, symbols or steps often has no order and does not follow an intelligible pattern or combination. Individual random events are, by definition, unpredictable, but if the probability distribution is known, the frequency of different outcomes over repeated events is predictable. For example, when throwing two dice, the outcome of any particular roll is unpredictable, but a sum of 7 will tend to occur twice as often as 4. In this view, randomness is not haphazardness; it is a measure of uncertainty of an outcome. Randomness applies to concepts of chance, probability, and information entropy.

In the card game bridge, the law or principle of vacant places is a simple method for estimating the probable location of any particular card in the four hands. It can be used both to aid in a decision at the table and to derive the entire suit division probability table.

The "hot hand" is a phenomenon, previously considered a cognitive social bias, that a person who experiences a successful outcome has a greater chance of success in further attempts. The concept is often applied to sports and skill-based tasks in general and originates from basketball, where a shooter is more likely to score if their previous attempts were successful; i.e., while having the "hot hand.” While previous success at a task can indeed change the psychological attitude and subsequent success rate of a player, researchers for many years did not find evidence for a "hot hand" in practice, dismissing it as fallacious. However, later research questioned whether the belief is indeed a fallacy. Some recent studies using modern statistical analysis have observed evidence for the "hot hand" in some sporting activities; however, other recent studies have not observed evidence of the "hot hand". Moreover, evidence suggests that only a small subset of players may show a "hot hand" and, among those who do, the magnitude of the "hot hand" tends to be small.

In the mathematics of shuffling playing cards, the Gilbert–Shannon–Reeds model is a probability distribution on riffle shuffle permutations that has been reported to be a good match for experimentally observed outcomes of human shuffling, and that forms the basis for a recommendation that a deck of cards should be riffled seven times in order to thoroughly randomize it. It is named after the work of Edgar Gilbert, Claude Shannon, and J. Reeds, reported in a 1955 technical report by Gilbert and in a 1981 unpublished manuscript of Reeds.

Frustration is a solitaire game with roots in the 1700s, and is similar to but opposite of Hit or Miss. It relies purely on luck rather than on skill, and has been both mathematically analyzed and discussed in popular media. This is an example of a derangement problem in combinatorial mathematics, which can be understood using a combinatorial tool called a rook polynomial. The probability of winning the game has been determined exactly, and is approximately 1.6233%. The same technique can be applied to variations of the game that use different numbers of suits, and different numbers of cards per suit.

<span class="mw-page-title-main">Lorum (card game)</span>

Lorum or Lórum is an old, Hungarian, compendium card game for 4 players. Although it is the ancestor of the French game, Barbu, it is still played today. It uses a German-suited pack of 32 cards and comprises 8 individual contracts, each with different rules, each of which is played four times so that a session consists of a total of 32 individual games and lasts about 1½ hours.

References

  1. "Best response strings for strings of length 3. | Download Scientific Diagram" . Retrieved 29 March 2023.
  2. Winning Odds by Yutaka Nishiyama and Steve Humble
  3. Humble-Nishiyama Randomness Game - A New Variation on Penney’s Coin Game on CiteSeer
  4. Results are broadly in line with those in Steve Humble and Yutaka Nishiyama, Humble-Nishiyama Randomness Game Mathematics Today August 2010 p 143 - A new variation on Penney’s Coin Game Archived 24 September 2015 at the Wayback Machine
  5. Jennifer Beineke; Jason Rosenhouse; Robert W. Vallin (5 September 2017). The Mathematics of Various Entertaining Subjects: Research in Games, Graphs, Counting, and Complexity, Volume 2. Princeton: Princeton University Press. ISBN   9780691171920.