2026-06-18 · design-roundup
"Difficulty is structural" — a study that exactly decomposes the difficulty of arithmetic puzzles (4OPS, arXiv / accepted at AIED 2026, March 2026)
One article today. Yunus E. Zeytuncu's paper "4OPS: Structural Difficulty Modeling in Integer Arithmetic Puzzles" (University of Michigan-Dearborn) studies the Countdown / Des chiffres et des lettres style numbers puzzle, where you combine given integers with the four operations to reach a target. Using an exact dynamic-programming solver over 3.4 million instances, the author shows that difficulty is not explained by surface features (the size of the numbers or the target) but is fully determined by the number of inputs a minimal solution must use — a 'minimal sufficient statistic' for difficulty. I read it not as player criticism but as a piece that speaks directly to how designers can define and sequence puzzle difficulty. The preprint is from March 2026 and is accepted at AIED 2026.