Intransitive dice

Image:Intransitive dice 2.svg

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 {{sfrac|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.

1. The first player chooses a die from the set.
2. The second player chooses one die from the remaining dice.
3. 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 {{sfrac|5|9}}. 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 $\backslash frac\{5\}\{9\}\; \backslash approx\; 0.56$ that each die beats the next one in the cycle. The largest possible probability is one over the golden ratio, $\backslash frac\{1\}\{\backslash varphi\}\; \backslash approx\; 0.62$.{{cite journal |last1=Trybuła |first1=Stanisław |title=On the paradox of three random variables |journal=Applicationes Mathematicae |date=1961 |volume=4 |issue=5 |pages=321-332 |url=https://eudml.org/doc/264121}}

Efron's dice are a set of four intransitive dice invented by Bradley Efron.

Image:Efron dice 2.svg

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 {{sfrac|2|3}}. C beats A with probability {{sfrac|5|9}}, 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 {{nowrap|0 ≤ x ≤ {{sfrac|3|7}}}}:

:P(choose A) = x

:P(choose B) = {{sfrac|1|2}} - {{sfrac|5|6}}x

:P(choose C) = x

:P(choose D) = {{sfrac|1|2}} - {{sfrac|7|6}}x

Image:Miwin Wuerfel Titan.gif

{{main|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 {{sfrac|17|36}}
• the probability that IV rolls a higher number than V is {{sfrac|17|36}}
• the probability that V rolls a higher number than III is {{sfrac|17|36}}

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 {{sfrac|1|6}}) as follows:{{cite web|last=Pegg|first=Ed Jr.|author-link=Ed Pegg Jr.|date=2005-07-11|title=Tournament Dice|url=http://www.mathpuzzle.com/MAA/39-Tournament%20Dice/mathgames_07_11_05.html|url-status=live|archive-url=https://web.archive.org/web/20050804234631/http://www.maa.org/editorial/mathgames/mathgames_07_11_05.html|archive-date=2005-08-04|access-date=2012-07-06|website=Math Games|publisher=Mathematical Association of America}}

• A: 2, {{0}}2, 14, 14, 17, 17
• B: 7, {{0}}7, 10, 10, 16, 16
• C: 5, {{0}}5, 13, 13, 15, 15
• D: 3, {{0}}3, {{0}}9, {{0}}9, 21, 21
• E: 1, {{0}}1, 12, 12, 20, 20
• F: 6, {{0}}6, {{0}}8, {{0}}8, 19, 19
• G: 4, {{0}}4, 11, 11, 18, 18

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,

• G beats {A,B}; F beats {A,C}; G beats {A,D}; D beats {A,E}; D beats {A,F}; F beats {A,G};
• A beats {B,C}; G beats {B,D}; A beats {B,E}; E beats {B,F}; E beats {B,G};
• B beats {C,D}; A beats {C,E}; B beats {C,F}; F beats {C,G};
• C beats {D,E}; B beats {D,F}; C beats {D,G};
• D beats {E,F}; C beats {E,G};
• E beats {F,G}.

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:{{cite web |last1=Grime |first1=James |title=Non-transitive Dice |url=http://grime.s3-website-eu-west-1.amazonaws.com/ |archive-url=https://web.archive.org/web/20160514125245/http://grime.s3-website-eu-west-1.amazonaws.com/ |archive-date=2016-05-14 |url-status=dead}}{{Cite journal |last=Pasciuto |first=Nicholas |date=2016 |title=The Mystery of the Non-Transitive Grime Dice |url=http://vc.bridgew.edu/undergrad_rev/vol12/iss1/18 |journal=Undergraduate Review |volume=12 |issue=1 |pages=107–115 |via=Bridgewater State University}}

• 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):

:

It has been proved that a four player set would require at least 19 dice.{{Cite journal|last1=Reid|first1=Kenneth|last2=McRae|first2=A.A.|last3=Hedetniemi|first3=S.M.|last4=Hedetniemi|first4=Stephen|date=2004-01-01|title=Domination and irredundance in tournaments|url=https://www.researchgate.net/publication/266258217|journal=The Australasian Journal of Combinatorics [electronic only]|volume=29}} 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.{{Cite web |last=Georgescu |first=Nicholas |title=math_problems/intransitive.ipynb at main · NGeorgescu/math_problems |url=https://github.com/NGeorgescu/math_problems/blob/main/intransitive.ipynb |archive-url=https://web.archive.org/web/20250327230902/https://github.com/NGeorgescu/math_problems/blob/main/intransitive.ipynb |archive-date=27 March 2025 |access-date=2025-03-27 |website=GitHub |language=en}} The set has not been published in an academic journal or been peer-reviewed.

A four-player set is proved to require at least 19 dice.{{Cite journal|last1=Reid|first1=Kenneth|last2=McRae|first2=A.A.|last3=Hedetniemi|first3=S.M.|last4=Hedetniemi|first4=Stephen|date=2004-01-01|title=Domination and irredundance in tournaments|url=https://www.researchgate.net/publication/266258217|journal=The Australasian Journal of Combinatorics|volume=29}}

In 2024, American scientist Nicholas S. Georgescu discovered a set of 23 dice which solve the four-player intransitive dice problem.{{Cite web|url=https://github.com/NGeorgescu/math_problems/blob/main/intransitive_5_player.ipynb|title=Georgescu Dice - Four-Player Intransitive Solution|last=Georgescu|first=Nicholas S.|date=2024}}

File:23-dice_plot.png

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.{{Cite web|url=https://github.com/NGeorgescu/math_problems/issues/1|title=Li Dice - General n-player Extension|date=2024|author=Youhua Li}}

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

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

A generalization of sets of intransitive dice with $N$ faces is possible.{{cite web|last1=Muñoz Perera|first1=Adrián|author-link=Adrián Muñoz Perera|title=A generalization of intransitive dice|url=https://pereradrian.github.io/doc/adrian_munnoz_perera_generalized_intransitive_dice_2024.pdf|access-date=15 December 2024|language=en}} Given $N\; \backslash geq\; 3$, we define the set of dice $\backslash \{D\_n\backslash \}\_\{n=1\}^N$ as the random variables taking values each in the set $\backslash \{v\_\{n,j\}\backslash \}\_\{j=1\}^J$ with

$\backslash mathbb\{P\}\backslash left[D\_n\; =\; v\_\{n,j\}\backslash right]\; =\; \backslash frac\{1\}\{J\}$,

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

To obtain a set of intransitive dice is enough to set the values $v\_\{n,j\}$ for $n,j\; =\; 1,\; 2,\; \backslash ldots,\; N$ with the expression

$v\_\{n,j\}\; =\; (j-1)N\; +\; (n\; -\; j)\backslash text\{mod\}(N)\; +\; 1$,

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

Using this expression, it can be verified that

,

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

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\; \backslash \; \backslash text\{and\}\; \backslash \; D\_1>D\_3$.

Again it can be verified that $D\_4>D\_3,\; D\_3>D\_2,\; D\_2>D\_1\; \backslash \; \backslash text\{and\}\; \backslash \; D\_1>D\_4$.

Again $D\_6>D\_5,\; D\_5>D\_4,\; D\_4>D\_3,\; D\_3>D\_2,\; D\_2>D\_1\; \backslash \; \backslash text\{and\}\; \backslash \; D\_1>D\_6$. Moreover $D\_6>\backslash \{D\_5,\; D\_4\backslash \},\; D\_5>\backslash \{D\_4,\; D\_3\backslash \},\; D\_4>\backslash \{D\_3,\; D\_2\backslash \},\; D\_3>\backslash \{D\_2,\; D\_1\backslash \},\; D\_2>\backslash \{D\_1,\; D\_6\backslash \}\; \backslash \; \backslash text\{and\}\; \backslash \; D\_1>\backslash \{D\_6,\; D\_5\backslash \}$.

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

{{reflist}}

{{refbegin}}

• {{cite book|authorlink=Martin Gardner|last=Gardner|first=Martin|title=The Colossal Book of Mathematics: Classic Puzzles, Paradoxes, and Problems: Number Theory, Algebra, Geometry, Probability, Topology, Game Theory, Infinity, and Other Topics of Recreational Mathematics|url=https://archive.org/details/colossalbookmath00gard|url-access=limited|edition=1st|location=New York|publisher=W. W. Norton & Company|date=2001|page=[https://archive.org/details/colossalbookmath00gard/page/n302 286]–311}}{{ISBN needed}}
• {{cite book|title=Spielerische Mathematik mit Miwin'schen Würfeln|publisher=Bildungsverlag Lemberger|isbn=978-3-85221-531-0|language=German}}

{{refend}}

• [http://mathworld.wolfram.com/EfronsDice.html MathWorld page]
• [https://www.sciencenews.org/article/tricky-dice-revisited Ivars Peterson's MathTrek - Tricky Dice Revisited (April 15, 2002)]
• [https://web.archive.org/web/20061016165934/http://www.jimloy.com/puzz/nontran.htm Jim Loy's Puzzle Page]
• [http://www.miwin.com Miwin official site] {{In lang|de}}
• [https://web.archive.org/web/20120723135456/http://www.devrand.org/view/diceFinder Open Source nontransitive dice finder]
• [http://singingbanana.com/dice/article.htm Non-transitive Dice by James Grime]
• [http://www.mathsgear.co.uk/non-transitive-dice/ Maths Gear]
• [https://www.maa.org/programs/maa-awards/writing-awards/intransitive-dice 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]{{Dead link|date=October 2024 |bot=InternetArchiveBot |fix-attempted=yes }}
• Timothy Gowers' [http://michaelnielsen.org/polymath1/index.php?title=Intransitive_dice 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}}
• [https://pereradrian.github.io 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.

Category:Probability theory paradoxes

Category:Dice