During a gaming convention in 2012, a board game designer challenged mathematician Eric Harshbarger to create unique dice to determine the starting player without any possibility of a tie. Harshbarger, a senior lecturer at Auburn University in Alabama, was intrigued by the problem and saw it as an opportunity to apply his mathematical expertise.
After years of collaboration with computer scientists and mathematicians worldwide, Harshbarger and his team successfully developed a set of dice that could resolve the tiebreaker issue for up to four players. However, creating a solution for five players proved to be a more complex task.
Through persistent efforts and innovative thinking, the team eventually devised a set of five 120-sided dice that could determine a clear winner with a single roll. The breakthrough came when a researcher from Australia proposed this practical solution, leading to further developments in the project.
Canadian software engineer Paul Meyer played a crucial role in the project by discovering a solution using five 60-sided dice. This achievement was a significant milestone after numerous failed attempts by others claiming to have solved the problem. The meticulous computational approach employed by Meyer proved successful in finding a viable solution to the dice conundrum.
Despite some skepticism from researchers regarding the practical application of the dice, Harshbarger remains confident in the mathematical fairness of the design. The ongoing research aims to explore the feasibility of using fewer sides for a five-player set and potentially expanding the concept to accommodate six players.
The unpredictable nature of the problem continues to intrigue Harshbarger and his team, driving them to seek new mathematical and computational solutions. The journey towards solving this seemingly simple question has been a testament to the dedication and perseverance of the researchers involved in this unique mathematical puzzle.