3 problems

Baird–Epstein–Flint–Miller Gaussianity conjecture. As $N\to\infty$, the distribution of the game length converges to a Gaussian distribution, with expectation and variance approxim…

Longest-game conjecture. The longest game on any $n$ is achieved by applying splitting moves whenever possible: first adding $1$'s, then splitting from smallest to largest, and fin…

Linear-growth conjecture. For Split Smallest, the number of moves grows linearly with $n$, with the asymptotic constant appearing numerically to be the square of the golden mean. F…