Balanced nontransitive dice

From MaRDI portal



Abstract: We study triples of labeled dice in which the relation "is a better die than" is non-transitive. Focusing on such triples with an additional symmetry we call "balance," we prove that such triples of n-sided dice exist for all ngeq3. We then examine the sums of the labels of such dice, and use these results to construct an O(n2) algorithm for verifying whether or not a triple of n-sided dice is balanced and non-transitive. Finally, we consider generalizations to larger sets of dice.












This page was built for publication: Balanced nontransitive dice

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4581635)