Definition
Intransitive dice are sets of specially numbered dice for which the probabilistic relationship of “beats” is non‑transitive: die A tends to roll a higher number than die B, die B tends to roll higher than die C, and yet die C tends to roll higher than die A. The term “intransitive” refers to the failure of the transitive property in the context of comparative probabilities rather than a strict mathematical order.
Overview
The concept illustrates that, unlike standard six‑sided dice numbered 1–6 (which exhibit transitive relationships), specially constructed dice can create cyclical superiority. These dice are often used to demonstrate paradoxical aspects of probability, to design games with strategic depth, and to explore concepts in decision theory and statistical mechanics. The most widely cited example is the set of three six‑sided dice introduced by Bradley Efron in 1970, commonly called Efron’s dice, though other families (e.g., Miwin’s dice, Grime’s dice) have also been studied.
Etymology/Origin
The adjective “intransitive” derives from the Latin in‑ (not) + transitio (passing over), indicating the lack of a transitive relation. The dice concept emerged in the mid‑20th century within the fields of probability theory and game theory. The first published description of a non‑transitive dice set appears in Bradley Efron’s 1970 paper “Non‑transitive dice,” The American Mathematical Monthly. Since then, the term has been adopted in mathematical literature and popular science discussions.
Characteristics
| Feature | Description |
|---|---|
| Number of faces | Typically six, matching standard dice, but variants exist with different numbers of faces (e.g., four‑sided, eight‑sided). |
| Number distribution | Faces are assigned non‑standard integer values; repetitions and omissions of certain numbers are common. |
| Probability matrix | For a pair of dice A and B, the probability that A rolls a higher value than B is usually > ½ (often around ⅔). The matrix of pairwise win probabilities forms a non‑transitive cycle. |
| Symmetry | Many constructions are deliberately asymmetric to achieve the required win probabilities; however, some sets exhibit rotational or reflective symmetry in their numbering patterns. |
| Applications | Used as pedagogical tools, in recreational mathematics, and occasionally in game design where a “rock‑paper‑scissors” style mechanic is desired. |
| Mathematical analysis | Investigated using combinatorial counting, generating functions, and Markov chains to determine exact win probabilities and expected values. |
Related Topics
- Non‑transitive games – strategic scenarios where the preference order cycles, such as rock‑paper‑scissors.
- Efron’s dice – a specific set of four six‑sided dice exhibiting a strong intransitive relationship.
- Miwin’s dice – a three‑dice system with a simpler numbering scheme producing intransitivity.
- Probabilistic paradoxes – broader class of counter‑intuitive results in probability theory (e.g., Simpson’s paradox).
- Game theory – study of strategic interaction where intransitive structures affect equilibrium concepts.
- Combinatorial design – mathematical field concerned with arranging elements subject to specific constraints, relevant to constructing intransitive dice sets.