Go First Dice
   HOME

TheInfoList



OR:

Go First Dice are a set of
dice A die (: dice, sometimes also used as ) is a small, throwable object with marked sides that can rest in multiple positions. Dice are used for generating random values, commonly as part of tabletop games, including dice games, board games, ro ...
in which, when rolled together, each die has an equal chance of showing the highest number, the second highest number, and so on. The dice are intended for fairly deciding the order of play in, for example, a board game. The number on each side is unique among the set, so that no ties can be formed.


Properties

There are three properties of fairness, with increasing strength: * Go-first-fair - Each player has an equal chance of rolling the highest number (going first). * Place-fair - When all the rolls are ranked in order, each player has an equal chance of receiving each rank. * Permutation-fair - Every possible ordering of players has an equal probability, which also ensures it is "place-fair". It is also desired that any subset of dice taken from the set and rolled together should also have the same properties, so they can be used for fewer players as well. Configurations where all die have the same number of sides are presented here, but alternative configurations might instead choose mismatched dice to minimize the number of sides, or minimize the largest number of sides on a single die. Sets may be optimized for smallest
least common multiple In arithmetic and number theory, the least common multiple (LCM), lowest common multiple, or smallest common multiple (SCM) of two integers ''a'' and ''b'', usually denoted by , is the smallest positive integer that is divisible by both ''a'' and ...
, fewest total sides, or fewest sides on the largest die. Optimal results in each of these categories have been proven by exhaustion for up to 4 dice.


Configurations


Two players

The two player case is somewhat trivial. Two coins (2-sided die) can be used:


Three players

An optimal and permutation-fair solution for 3 six-sided dice was found by Robert Ford in 2010. There are several optimal alternatives using mismatched dice.


Four players

An optimal and permutation-fair solution for 4 twelve-sided dice was found by Robert Ford in 2010. Alternative optimal configurations for mismatched dice were found by Eric Harshbarger.


Five players

Several candidates exist for a set of 5 dice, but none is known to be optimal. A not-permutation-fair solution for 5 sixty-sided dice was found by James Grime and Brian Pollock. A permutation-fair solution for a mixed set of 1 thirty-six-sided die, 2 forty-eight-sided dice, 1 fifty-four-sided die, and 1 twenty-sided die was found by Eric Harshbarger in 2023. A permutation-fair solution for 5 sixty-sided dice was found by Paul Meyer in 2023.


See also

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


References


External links


Go First Dice - Numberphile

Go First Dice Wiki
Dice {{Game-stub