AI summary by TwinMind

Go First Dice - Numberphile

Numberphile

17m 58s

Introduction to Go First Dice Problem

  • Problem: 4 friends want to determine play order (1st, 2nd, 3rd, 4th) using dice
  • Traditional dice rolling creates draws when players roll same number
  • Solution needed: set of dice with no repeating numbers, equally likely outcomes for all positions

Original Go First Dice (4-Player Solution)

  • Invented by Eric Karsparger and Robert Ford ~10 years ago
  • Set of four 12-sided dice using numbers 1-48 (no repeats, no draws)
  • Each player equally likely to be 1st, 2nd, 3rd, 4th
  • Works for subsets: any 3 dice work for 3 players, any 2 dice work for 2 players

5-Player Problem and Initial Solutions

Solution 1: 60-Sided Dice Set

  • Created by presenter with Brian Pollock years ago
  • Set of five 60-sided dice using numbers 1-300
  • Computer search with mathematical structure constraints
  • Knew dice would be 30-sided or multiple of 30
  • Found 60-sided solution when 30-sided didn't exist
  • Each position equally likely, works for subsets
  • Limitation: not every order equally likely (A-B-C-D-E less likely than E-D-C-B-A)

Solution 2: Variable-Sided Dice (Eric & Robert's Approach)

  • Different sized dice: 20-sided, 36-sided, two 48-sided, 54-sided
  • Every order equally likely (stronger fairness condition)
  • Works for subsets
  • Construction method: start with 3-dice permutation-fair set, expand to 4-dice
    • Double dice size, add 100 to first copy, 200 to second copy
    • Create gaps in number sequence
    • Fill gaps with new die values to maintain permutation fairness
    • Example: 6-sided dice become mix of different sizes

Michael Purcell's Breakthrough Solution

  • Contacted team ~2 months ago with new approach
  • Set of five 120-sided dice, all same size
  • Every order equally likely
  • Method: started with five 12-sided dice (partially permutation-fair for 4-dice subsets)
  • Made 10 copies (creating 120-sided dice)
  • Applied specific permutations to rows in copies to balance biases
  • Used only 10 permutations (not all possible permutations)
  • Computer-generated solution

Bram Cohen's Hybrid Solution

  • Mixed Michael's and Eric's methods
  • Four 36-sided dice + one 20-sided die
  • Smallest total number of sides found so far
  • Created by induction: used Michael's method then added extra die using gap-filling

Current State and Open Questions

6-Player Solutions

  • Best result: one 20-sided die + five 360-sided dice (asymmetrical)
  • Created using Bram's hybrid method

Remaining Questions

  • Mathematical basis for choosing permutations to balance biases
  • Optimal way to pick initial seed dice sets
  • Can five 30-sided dice solution exist?
  • If not, can five 60-sided dice work?
  • Is current solution minimal or can it be improved?

Practical Considerations

  • Gaming community doesn't necessarily need go-first dice
  • Simpler solutions exist: shuffled cards 1-5, single 120-sided die with all orders
  • Appeal is in having each player roll their own die simultaneously
  • Balance between minimizing total sides vs. having uniform die sizes

TwinMind

Get summaries like this for your own meetings

TwinMind takes notes in the background during meetings, lectures, and calls, then writes the summary for you.

Free plan to get started

No bot joins your calls

Phone, desktop & Chrome apps

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome

Your next meeting, summarized like this

TwinMind listens in the background and turns meetings, lectures, and calls into searchable notes you can chat with. Start free.

Available on phone, desktop & Chrome