1. Physical vs. mathematical feasibility
Many commenters stressed that the challenge was not just proving a solution exists mathematically, but finding one that could actually be made.
- “So it was more of a physical problem rather than a mathematical one” – selcuka
- “They knew a solution existed but it was physically unfeasible, which prompted them to mathematically optimize the solution by using fewer sides” – complex_fir_rea
2. Computational difficulty of searching for fair dice
A recurring theme is the immense search space and the years of CPU time required to find or rule out small‑sided sets.
- “The big open question is whether a set of 5 (permutation fair) 30‑sided dice exists… exhausting the whole space I’m searching will still take my computer an estimated 70 years.” – bmenrigh
- “A lower bound of 30 is known but brute‑forcing it is still computationally expensive.” – complex_fir_rea
3. Simpler alternatives and what the problem actually demands
Participants repeatedly suggested easier ways (a single large die, token draws, fractional base‑six rolls) and debated whether those meet the stricter “permutation‑fair” requirement.
- “You can just pull tokens out of a bag to generate a random sequence of virtually any length.” – Fricken
- “Can somebody explain why not just make a die with 5! sides, and roll it once to decide the order?” – archargelod
- “Roll dice as if you're rolling a fractional base six number … preserving order without rerolls.” – kbelder