intransitive dice

A set of dice is intransitive (or nontransitive) if it contains X>2 dice, ''X1'', ''X2'', and ''X3''... with the property that ''X1'' rolls higher than ''X2'' more than half the time, and ''X2'' rolls higher than ''X3'' etc... more than half the time, but where it is not true that ''X1'' rolls higher than ''Xn'' more than half the time. In other words, a set of dice is intransitive if the binary relation – rolls a higher number than more than half the time – on its elements is not transitive. More simply, ''X1'' normally beats ''X2'', ''X2'' normally beats ''X3'', but ''X1'' does not normally beat ''Xn''.

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).

Example

Consider the following set of dice.
* Die ''A'' has sides 2, 2, 4, 4, 9, 9.
* Die ''B'' has sides 1, 1, 6, 6, 8, 8.
* Die ''C'' has sides 3, 3, 5, 5, 7, 7.
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 , 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.
# The first player chooses a die from the set.
# The second player chooses one die from the remaining dice.
# Both players roll their die; the player who rolls the higher number wins.
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 . The following tables show all possible outcomes for all three pairs of dice.

If one allows weighted dice, i.e., with unequal probability weights for each side, then alternative sets of three dice can achieve even larger probabilities than $\frac \approx 0.56$ that each die beats the next one in the cycle. The largest possible probability is one over the golden ratio, $\frac \approx 0.62$.

Variations

Efron's dice

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:
* A: 4, 4, 4, 4, 0, 0
* B: 3, 3, 3, 3, 3, 3
* C: 6, 6, 2, 2, 2, 2
* D: 5, 5, 5, 1, 1, 1

Each die is beaten by the previous die in the list with wraparound, with probability . C beats A with probability , and B and D have equal chances of beating the other. If each player has one set of Efron's dice, there is a continuum of optimal strategies for one player, in which they choose their die with the following probabilities, where :
:P(choose A) = ''x''
:P(choose B) = - ''x''
:P(choose C) = ''x''
:P(choose D) = - ''x''

Miwin's dice

Miwin's Dice were invented in 1975 by the physicist Michael Winkelmann.

Consider a set of three dice, III, IV and V such that
* die III has sides 1, 2, 5, 6, 7, 9
* die IV has sides 1, 3, 4, 5, 8, 9
* die V has sides 2, 3, 4, 6, 7, 8
Then:
* the probability that III rolls a higher number than IV is
* the probability that IV rolls a higher number than V is
* the probability that V rolls a higher number than III is

Intransitive dice set for more than two players

A number of people have introduced variations of intransitive dice where one can compete against more than one opponent.

Three players

Oskar dice

Oskar van Deventer introduced a set of seven dice (all faces with probability ) as follows:
* A: 2, 2, 14, 14, 17, 17
* B: 7, 7, 10, 10, 16, 16
* C: 5, 5, 13, 13, 15, 15
* D: 3, 3, 9, 9, 21, 21
* E: 1, 1, 12, 12, 20, 20
* F: 6, 6, 8, 8, 19, 19
* G: 4, 4, 11, 11, 18, 18

One can verify that A beats ; B beats ; C beats ; D beats ; E beats ; F beats ; G beats . Consequently, for arbitrarily chosen two dice there is a third one that beats both of them. Namely,
* G beats ; F beats ; G beats ; D beats ; D beats ; F beats ;
* A beats ; G beats ; A beats ; E beats ; E beats ;
* B beats ; A beats ; B beats ; F beats ;
* C beats ; B beats ; C beats ;
* D beats ; C beats ;
* E beats .

Whatever the two opponents choose, the third player will find one of the remaining dice that beats both opponents' dice.

Grime dice

Dr. James Grime discovered a set of five dice as follows:
* A: 2, 2, 2, 7, 7, 7
* B: 1, 1, 6, 6, 6, 6
* C: 0, 5, 5, 5, 5, 5
* D: 4, 4, 4, 4, 4, 9
* E: 3, 3, 3, 3, 8, 8

One can verify that, when the game is played with one set of Grime dice:
* A beats B beats C beats D beats E beats A (first chain);
* A beats C beats E beats B beats D beats A (second chain).

However, when the game is played with two such sets, then the first chain remains the same, except that D beats C, 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):

:

Four players

It has been proved that a four player set would require at least 19 dice. In July 2024 GitHub user NGeorgescu published a set of 23 eleven sided dice which satisfy the constraints of the four player intransitive dice problem. The set has not been published in an academic journal or been peer-reviewed.

Four players

A four-player set is proved to require at least 19 dice.

Georgescu dice

In 2024, American scientist Nicholas S. Georgescu discovered a set of 23 dice which solve the four-player intransitive dice problem.

Li dice

Youhua Li subsequently developed a set of 19 dice with 171 faces each that solves the four-player problem. This has been shown to be extensible for any number of dice given a domination graph with ''n'' nodes, producing dice with ''n(n−1)/2'' faces.

Intransitive 12-sided dice

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:

Standard-Dodekaeder-D III.gif, D III
Standard-Dodekaeder-D IV.gif, D IV
Standard-Dodekaeder-D V.gif, D V

Set 2:

Standard-Dodekaeder-D VI.gif, D VI
Standard-Dodekaeder-D VII.gif, D VII
Standard-Dodekaeder-D VIII.gif, D VIII

Intransitive prime-numbered 12-sided dice

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.

Primzahlen-Dodekaeder-PD 11bf.gif, PD 11
Primzahlen-Dodekaeder-PD 12bf.gif, PD 12
Primzahlen-Dodekaeder-PD 13bf.gif, PD 13

Set 2: The numbers add up to 468.

Primzahlen-Dodekaeder-PD 1bf.gif, PD 1
Primzahlen-Dodekaeder-PD 2bf.gif, PD 2
Primzahlen-Dodekaeder-PD 3bf.gif, PD 3

Generalized Muñoz-Perera's intransitive dice

A generalization of sets of intransitive dice with $N$ faces is possible. Given $N \geq 3$, we define the set of dice $\_^N$ as the random variables taking values each in the set $\_^J$ with

\mathbb\left _n = v_\right= \frac,

so we have $N$ fair dice of $J$ faces.

To obtain a set of intransitive dice is enough to set the values $v_$ for $n,j = 1, 2, \ldots, N$ with the expression

$v_ = (j-1)N + (n - j)\text(N) + 1$,

obtaining a set of $N$ fair dice of $N$ faces

Using this expression, it can be verified that

\mathbb\left _m < D_n\right= \frac + \frac - \frac,

So each die beats $\lfloor N/2 - 1 \rfloor$ dice in the set.

Examples

3 faces

The set of dice obtained in this case is equivalent to the first example on this page, but removing repeated faces. It can be verified that $D_3>D_2, D_2>D_1 \ \text \ D_1>D_3$.

4 faces

Again it can be verified that $D_4>D_3, D_3>D_2, D_2>D_1 \ \text \ D_1>D_4$.

6 faces

Again $D_6>D_5, D_5>D_4, D_4>D_3, D_3>D_2, D_2>D_1 \ \text \ D_1>D_6$. Moreover $D_6>\, D_5>\, D_4>\, D_3>\, D_2>\ \ \text \ D_1>\$.

See also

* Blotto games
* Freivalds' algorithm
* Go First Dice
* Nontransitive game
* Rock paper scissors
* Condorcet's voting paradox

References

Sources

*
*

External links

MathWorld page

Ivars Peterson's MathTrek - Tricky Dice Revisited (April 15, 2002)



Miwin official site


Open Source nontransitive dice finder



Maths Gear

Conrey, B., Gabbard, J., Grant, K., Liu, A., & Morrison, K. (2016). Intransitive dice. ''Mathematics Magazine,'' 89(2), 133-143. Awarded by Mathematical Association of America
* Timothy Gowers
project on intransitive dice
* {{Cite web , last=Klarreich , first=Erica, author-link=Erica Klarreich, date=2023-01-19 , title=Mathematicians Roll Dice and Get Rock-Paper-Scissors , url=https://www.quantamagazine.org/mathematicians-roll-dice-and-get-rock-paper-scissors-20230119/, website= Quanta Magazine, language=en

Adrián Muñoz Perera's site

* Introduction to Non-Transitive Gambling Bets for Magicians by Bruce Carlley. This is the ONLY book on this topic.
Probability theory paradoxes
Dice