Dice discovered that solve decade-long mathematical problem
After years of searching, mathematicians have found dice that can allow five players to fairly decide who moves first in a board game, with a winner guaranteed from just a single roll
For over a decade, mathematicians and computer scientists have grappled with the challenge of creating a set of dice that guarantees a fair outcome in every roll, without the possibility of a tie. The idea was first discussed over dinner in 2012 by Eric Harshbarger, a mathematician at Auburn University, and Robert Ford, a computer scientist at Dalton State College.
The pair developed a set of four 12-sided dice that could be rolled by two, three or four players, ensuring a statistically fair result each time. Harshbarger, who became the unofficial champion of the problem, established a website to track progress as over 20 experts worldwide joined the hunt. While sets of five dice were discovered relatively quickly, they often proved impractical due to an excessive number of sides, sometimes exceeding 100.
However, a breakthrough came recently when Paul Meyer, a software engineer, employed a combination of mathematical patterns and brute-force computer search to design a set of five 60-sided dice that met all mathematical criteria and could be manufactured for real-world use. Despite the dice's theoretical perfection, some experts remain skeptical about their practicality due to the need for precise manufacturing and the potential for slight imbalances.
Written by urgent.news from New Scientist's reporting — not their text. Machine-written — may contain errors; check the original before relying on it.