A set of dice is intransitive (or nontransitive) if it contains three dice, A, B, and C, with the property that A rolls higher than B more than half the time, and B rolls higher than C more than half the time, but where it is not true that A rolls higher than C more than half the time. In other words, a set of dice is intransitive if the binary relation – X rolls a higher number than Y more than half the time – on its elements is not transitive. More simply, A normally beats B, B normally beats C, but A does not normally beat C.
It is possible to find sets of dice with the even stronger property that, for each die in the set, there is another die that rolls a higher number than it more than half the time. This is different in that instead of only "A does not normally beat C" it is now "C normally beats A". Using such a set of dice, one can invent games which are biased in ways that people unused to intransitive dice might not expect (see Example). [1] [2] [3] [4]
Consider the following set of dice.
The probability that A rolls a higher number than B, the probability that B rolls higher than C, and the probability that C rolls higher than A are all 5/9, so this set of dice is intransitive. In fact, it has the even stronger property that, for each die in the set, there is another die that rolls a higher number than it more than half the time.
Now, consider the following game, which is played with a set of dice.
If this game is played with a transitive set of dice, it is either fair or biased in favor of the first player, because the first player can always find a die that will not be beaten by any other dice more than half the time. If it is played with the set of dice described above, however, the game is biased in favor of the second player, because the second player can always find a die that will beat the first player's die with probability 5/9. The following tables show all possible outcomes for all three pairs of dice.
Player 1 chooses die A Player 2 chooses die C | Player 1 chooses die B Player 2 chooses die A | Player 1 chooses die C Player 2 chooses die B | |||||||||||
A C | 2 | 4 | 9 | B A | 1 | 6 | 8 | C B | 3 | 5 | 7 | ||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|
3 | C | A | A | 2 | A | B | B | 1 | C | C | C | ||
5 | C | C | A | 4 | A | B | B | 6 | B | B | C | ||
7 | C | C | A | 9 | A | A | A | 8 | B | B | B |
Though the three intransitive dice A, B, C (first set of dice)
P(A > B) = P(B > C) = P(C > A) = 5/9
and the three intransitive dice A′, B′, C′ (second set of dice)
P(A′ > B′) = P(B′ > C′) = P(C′ > A′) = 5/9
win against each other with equal probability they are not equivalent. While the first set of dice (A, B, C) has a 'highest' die, the second set of dice has a 'lowest' die. Rolling the three dice of a set and always using the highest score for evaluation will show a different winning pattern for the two sets of dice. With the first set of dice, die B will win with the highest probability (11/27) and dice A and C will each win with a probability of 8/27. With the second set of dice, die C′ will win with the lowest probability (7/27) and dice A′ and B′ will each win with a probability of 10/27.
Efron's dice are a set of four intransitive dice invented by Bradley Efron.
The four dice A, B, C, D have the following numbers on their six faces:
Each die is beaten by the previous die in the list, with a probability of 2/3:
B's value is constant; A beats it on 2/3 rolls because four of its six faces are higher.
Similarly, B beats C with a 2/3 probability because only two of C's faces are higher.
P(C>D) can be calculated by summing conditional probabilities for two events:
The total probability of win for C is therefore
With a similar calculation, the probability of D winning over A is
The four dice have unequal probabilities of beating a die chosen at random from the remaining three:
As proven above, die A beats B two-thirds of the time but beats D only one-third of the time. The probability of die A beating C is 4/9 (A must roll 4 and C must roll 2). So the likelihood of A beating any other randomly selected die is:
Similarly, die B beats C two-thirds of the time but beats A only one-third of the time. The probability of die B beating D is 1/2 (only when D rolls 1). So the likelihood of B beating any other randomly selected die is:
Die C beats D two-thirds of the time but beats B only one-third of the time. The probability of die C beating A is 5/9. So the likelihood of C beating any other randomly selected die is:
Finally, die D beats A two-thirds of the time but beats C only one-third of the time. The probability of die D beating B is 1/2 (only when D rolls 5). So the likelihood of D beating any other randomly selected die is:
Therefore, the best overall die is C with a probability of winning of 0.5185. C also rolls the highest average number in absolute terms, 3+1/3. (A's average is 2+2/3, while B's and D's are both 3.)
Note that Efron's dice have different average rolls: the average roll of A is 8/3, while B and D each average 9/3, and C averages 10/3. The intransitive property depends on which faces are larger or smaller, but does not depend on the absolute magnitude of the faces. Hence one can find variants of Efron's dice where the odds of winning are unchanged, but all the dice have the same average roll. For example,
These variant dice are useful, e.g., to introduce students to different ways of comparing random variables (and how comparing only averages may overlook essential details).
A set of four dice using all of the numbers 1 through 24 can be made to be intransitive. With adjacent pairs, one die's probability of winning is 2/3.
For rolling high number, B beats A, C beats B, D beats C, A beats D.
These dice are basically the same as Efron's dice, as each number of a series of successive numbers on a single die can all be replaced by the lowest number of the series and afterwards renumbering them.
Miwin's Dice were invented in 1975 by the physicist Michael Winkelmann.
Consider a set of three dice, III, IV and V such that
Then:
The following intransitive dice have only a few differences compared to 1 through 6 standard dice:
Like Miwin’s set, the probability of A winning versus B (or B vs. C, C vs. A) is 17/36. The probability of a draw, however, is 4/36, so that only 15 out of 36 rolls lose. So the overall winning expectation is higher.
Warren Buffett is known to be a fan of intransitive dice. In the book Fortune's Formula: The Untold Story of the Scientific Betting System that Beat the Casinos and Wall Street, a discussion between him and Edward Thorp is described. Buffett and Thorp discussed their shared interest in intransitive dice. "These are a mathematical curiosity, a type of 'trick' dice that confound most people's ideas about probability."
Buffett once attempted to win a game of dice with Bill Gates using intransitive dice. "Buffett suggested that each of them choose one of the dice, then discard the other two. They would bet on who would roll the highest number most often. Buffett offered to let Gates pick his die first. This suggestion instantly aroused Gates's curiosity. He asked to examine the dice, after which he demanded that Buffett choose first." [5]
In 2010, Wall Street Journal magazine quoted Sharon Osberg, Buffett's bridge partner, saying that when she first visited his office 20 years earlier, he tricked her into playing a game with intransitive dice that could not be won and "thought it was hilarious". [6]
A number of people have introduced variations of intransitive dice where one can compete against more than one opponent.
Oskar van Deventer introduced a set of seven dice (all faces with probability 1/6) as follows: [7]
One can verify that A beats {B,C,E}; B beats {C,D,F}; C beats {D,E,G}; D beats {A,E,F}; E beats {B,F,G}; F beats {A,C,G}; G beats {A,B,D}. Consequently, for arbitrarily chosen two dice there is a third one that beats both of them. Namely,
Whatever the two opponents choose, the third player will find one of the remaining dice that beats both opponents' dice.
Dr. James Grime discovered a set of five dice as follows: [8]
One can verify that, when the game is played with one set of Grime dice:
However, when the game is played with two such sets, then the first chain remains the same (with one exception discussed later) but the second chain is reversed (i.e. A beats D beats B beats E beats C beats A). Consequently, whatever dice the two opponents choose, the third player can always find one of the remaining dice that beats them both (as long as the player is then allowed to choose between the one-die option and the two-die option):
Sets chosen by opponents | Winning set of dice | ||
---|---|---|---|
Type | Number | ||
A | B | E | 1 |
A | C | E | 2 |
A | D | C | 2 |
A | E | D | 1 |
B | C | A | 1 |
B | D | A | 2 |
B | E | D | 2 |
C | D | B | 1 |
C | E | B | 2 |
D | E | C | 1 |
There are two major issues with this set, however. The first one is that in the two-die option of the game, the first chain should stay exactly the same in order to make the game intransitive. In practice, though, D actually beats C. The second problem is that the third player would have to be allowed to choose between the one-die option and the two-die option – which may be seen as unfair to other players.
The above issue of D defeating C arises because the dice have 6 faces rather than 5. By replacing the lowest (or highest) face of each die with "reroll" (R), all five dice will function exactly as Dr. James Grime intended:
Alternatively, these faces could be mapped to a set of pentagonal-trapezohedral (10-sided) dice, with each number appearing exactly twice, or to a set of icosahedral (20-sided) dice, with each number appearing four times. This eliminates the need for a "reroll" face.
This solution was discovered by Jon Chambers, an Australian Pre-Service Mathematics Teacher.[ citation needed ]
A four-player set has not yet been discovered, but it was proved that such a set would require at least 19 dice. [8] [9]
Tetrahedra can be used as dice with four possible results.
P(A > B) = P(B > C) = P(C > A) = 9/16
The following tables show all possible outcomes:
B A | 2 | 6 | 6 | 6 |
---|---|---|---|---|
1 | B | B | B | B |
4 | A | B | B | B |
7 | A | A | A | A |
7 | A | A | A | A |
In "A versus B", A wins in 9 out of 16 cases.
C B | 3 | 5 | 5 | 8 |
---|---|---|---|---|
2 | C | C | C | C |
6 | B | B | B | C |
6 | B | B | B | C |
6 | B | B | B | C |
In "B versus C", B wins in 9 out of 16 cases.
A C | 1 | 4 | 7 | 7 |
---|---|---|---|---|
3 | C | A | A | A |
5 | C | C | A | A |
5 | C | C | A | A |
8 | C | C | C | C |
In "C versus A", C wins in 9 out of 16 cases.
P(A > B) = P(B > C) = 10/16, P(C > A) = 9/16
In analogy to the intransitive six-sided dice, there are also dodecahedra which serve as intransitive twelve-sided dice. The points on each of the dice result in the sum of 114. There are no repetitive numbers on each of the dodecahedra.
Miwin’s dodecahedra (set 1) win cyclically against each other in a ratio of 35:34.
The miwin’s dodecahedra (set 2) win cyclically against each other in a ratio of 71:67.
Set 1:
D III | purple | 1 | 2 | 5 | 6 | 7 | 9 | 10 | 11 | 14 | 15 | 16 | 18 | ||||||
D IV | red | 1 | 3 | 4 | 5 | 8 | 9 | 10 | 12 | 13 | 14 | 17 | 18 | ||||||
D V | dark grey | 2 | 3 | 4 | 6 | 7 | 8 | 11 | 12 | 13 | 15 | 16 | 17 |
Set 2:
D VI | cyan | 1 | 2 | 3 | 4 | 9 | 10 | 11 | 12 | 13 | 14 | 17 | 18 | ||||||
D VII | pear green | 1 | 2 | 5 | 6 | 7 | 8 | 9 | 10 | 15 | 16 | 17 | 18 | ||||||
D VIII | light grey | 3 | 4 | 5 | 6 | 7 | 8 | 11 | 12 | 13 | 14 | 15 | 16 |
It is also possible to construct sets of intransitive dodecahedra such that there are no repeated numbers and all numbers are primes. Miwin’s intransitive prime-numbered dodecahedra win cyclically against each other in a ratio of 35:34.
Set 1: The numbers add up to 564.
PD 11 | grey to blue | 13 | 17 | 29 | 31 | 37 | 43 | 47 | 53 | 67 | 71 | 73 | 83 |
PD 12 | grey to red | 13 | 19 | 23 | 29 | 41 | 43 | 47 | 59 | 61 | 67 | 79 | 83 |
PD 13 | grey to green | 17 | 19 | 23 | 31 | 37 | 41 | 53 | 59 | 61 | 71 | 73 | 79 |
Set 2: The numbers add up to 468.
PD 1 | olive to blue | 7 | 11 | 19 | 23 | 29 | 37 | 43 | 47 | 53 | 61 | 67 | 71 |
PD 2 | teal to red | 7 | 13 | 17 | 19 | 31 | 37 | 41 | 43 | 59 | 61 | 67 | 73 |
PD 3 | purple to green | 11 | 13 | 17 | 23 | 29 | 31 | 41 | 47 | 53 | 59 | 71 | 73 |
Backgammon is a two-player board game played with counters and dice on tables boards. It is the most widespread Western member of the large family of tables games, whose ancestors date back nearly 5,000 years to the regions of Mesopotamia and Persia. The earliest record of backgammon itself dates to 17th-century England, being descended from the 16th-century game of Irish.
Craps is a dice game in which players bet on the outcomes of the roll of a pair of dice. Players can wager money against each other or against a bank. Because it requires little equipment, "street craps" can be played in informal settings. While shooting craps, players may use slang terminology to place bets and actions.
Dice are small, throwable objects with marked sides that can rest in multiple positions. They are used for generating random values, commonly as part of tabletop games, including dice games, board games, role-playing games, and games of chance.
In probability theory, the sample space of an experiment or random trial is the set of all possible outcomes or results of that experiment. A sample space is usually denoted using set notation, and the possible ordered outcomes, or sample points, are listed as elements in the set. It is common to refer to a sample space by the labels S, Ω, or U. The elements of a sample space may be numbers, words, letters, or symbols. They can also be finite, countably infinite, or uncountably infinite.
In information theory, the information content, self-information, surprisal, or Shannon information is a basic quantity derived from the probability of a particular event occurring from a random variable. It can be thought of as an alternative way of expressing probability, much like odds or log-odds, but which has particular mathematical advantages in the setting of information theory.
Pig is a simple dice game first described in print by John Scarne in 1945. Players take turns to roll a single dice as many times as they wish, adding all roll results to a running total, but losing their gained score for the turn if they roll a 1.
In mathematics, intransitivity is a property of binary relations that are not transitive relations. This may include any relation that is not transitive, or the stronger property of antitransitivity, which describes a relation that is never transitive.
Liar's dice is a class of dice games for two or more players requiring the ability to deceive and to detect an opponent's deception. In "single hand" liar's dice games, each player has a set of dice, all players roll once, and the bids relate to the dice each player can see plus all the concealed dice. In "common hand" games, there is one set of dice which is passed from player to player. The bids relate to the dice as they are in front of the bidder after selected dice have been re-rolled. Originating during the 15th century, the game subsequently spread to Latin American and European countries. In 1993, a variant, Call My Bluff, won the Spiel des Jahres.
Cee-lo is a gambling game played with three six-sided dice. There is not one standard set of rules, but there are some constants that hold true to all sets of rules. The name comes from the Chinese Sì-Wŭ-Liù (四五六), meaning "four-five-six". In America it is also called "See-Low," "Four-Five-Six," "The Three Dice Game," "Roll-off!," and by several alternative spellings, as well as simply "Dice." In China it is also called "Sān Liù Bàozi" (三六豹子), or "Three-Six Leopards". In Japan, it is known as "Chinchiro" (チンチロ) or "Chinchirorin" (チンチロリン).
Farkle, or Farkel, is a dice game similar to or synonymous with 1000/5000/10000, Cosmic Wimpout, Greed, Hot Dice, Squelch, Zilch, or Zonk. Its origins as a folk game are unknown, but the game dates back to at least the mid-1980s. It has been marketed commercially since 1996 under the brand name Pocket Farkel by Legendary Games Inc. While the basic rules are well-established, there is a wide range of variation in both scoring and play.
Dice 10,000 also Greed, Dix Mille, Reload, 5-Dice is the name of a family dice game played with 6 dice; it is similar or identical to the commercialized Farkle. It also goes by other names, including Cargoose, Zilch, Zilchers, Foo, Boxcar, Bogus, Lewis' Dice, Crap Out.
Mexico is an elimination-style dice game, in which several players agree to play a set number of rounds. After each round, one player is eliminated. When all players but one have been eliminated, the remaining player wins the game. Owing to its extremely simple play-structure, it is generally pursued as a method of gambling, whereby the final remaining player wins the amount of money wagered by each person who was eliminated in earlier rounds. A variant of the drinking game liar's dice known as Mexican or Mia uses similar dice rolls, but has very different game mechanics.
Sicherman dice are a pair of 6-sided dice with non-standard numbers–one with the sides 1, 2, 2, 3, 3, 4 and the other with the sides 1, 3, 4, 5, 6, 8. They are notable as the only pair of 6-sided dice that are not normal dice, bear only positive integers, and have the same probability distribution for the sum as normal dice. They were invented in 1978 by George Sicherman of Buffalo, New York.
EinStein würfelt nicht! is a board game, designed by Ingo Althöfer, a professor of applied mathematics in Jena, Germany. It was the official game of an exhibition about Einstein in Germany during the Einstein Year (2005).
Dice notation is a system to represent different combinations of dice in wargames and tabletop role-playing games using simple algebra-like notation such as d8+2.
Poker dice are dice which, instead of having number pips, have representations of playing cards upon them. Poker dice have six sides, one each of an Ace, King, Queen, Jack, 10, and 9, and are used to form a poker hand.
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.
Horsengoggle is a method of selecting a random person from a group. Unlike some other methods, such as rock paper scissors, one of the features of horsengoggle is that there is always a winner; it is impossible to tie.
Midnight is a dice game played with six dice.
Go First Dice are a set of dice in which, when rolled together, each die has an equal chance of showing the highest number, the second highest number, and so on.