In 2012, at a gaming convention, a board game designer approached mathematician Eric Harshbarger with a challenge: create dice that would determine the starting player without the risk of a tie, aiming to expedite the game setup process. Harshbarger, a senior lecturer at Auburn University and a mathematician, found the problem intriguing due to its non-trivial nature.

After years of collaboration with computer scientists and mathematicians worldwide, Harshbarger’s team developed a set of four 12-sided dice that could resolve ties for two, three, or four players efficiently. However, devising a solution for five players presented a more significant challenge.

The team explored various mathematical theories to create practical dice designs, eventually settling on a set of five 120-sided dice proposed by an Australian researcher. Subsequently, a Canadian software engineer named Paul Meyer joined the effort and successfully devised a solution using five 60-sided dice.

Meyer’s computational approach, leveraging mathematical patterns and extensive computer searches, led to the breakthrough. Despite some skepticism about the dice’s real-world applicability, Harshbarger asserts that the mathematical principles behind the design ensure fairness, with any discrepancies likely originating from the manufacturing process.

The team continues their research, investigating the feasibility of using fewer sides for a five-player set and exploring the potential extension to accommodate six players. While current tools may not suffice for these inquiries, Harshbarger remains open to unexpected discoveries, recognizing the allure of tackling challenging mathematical puzzles that defy simple solutions.