Generation, Construction, Matches: An Analysis of n-Sided Dice
Overview
We address n-sided dice whose face values lie between 1 and n and whose faces sum to n(n+1)/2. We tackle the problem of generating n-sided dice by developing an algorithm to generate the integer partitions of n into exactly k parts, each part at most m. This general algorithm was then used to generate n-sided dice by making appropriate substitutions to the values of n, k, and m. We then create a class of constructions that enable us to obtain (n+1) distinct (n+1)-sided dice from one n-sided die. Finally, we develop a function that allows us to identify the winning die of a match more efficiently than the previously used function.
Competition history
- ISEF 2017
Resources
Related projects
CSEF · 2013
New Methods of Generating Sets of Intransitive Dice
CSEF · 2006
Is the Roll of a Die Fair?
CSEF · 2005
The Effect of Number of Sides on the Fairness of a Die
CSEF · 2002
What're the Odds? A Lesson in Probability
CSEF · 2009
Automatic Die-rolling Machine for Defect Determination
JSHS · 2023
A Study into the Equity of Dice
ISEF · 2017
An Addition to the Problem of Points
ISEF · 2026
Complexity Functions Are All You Need
Closest projects by meaning, across every fair and year in the corpus.
Browse more like this
Source: Regeneron International Science and Engineering Fair