TAG
#academic
0 reviews · 9 essays
Related essays
"It Learned to Solve Without Being Taught To" — A Diffusion Model That Generates Solvable Sokoban Without a Solver
One piece today: the preprint "Solvable Sokoban Without a Solver via Diffusion" (Sina Baghal), posted to arXiv on August 16, 2026. Deciding whether a Sokoban puzzle is solvable is PSPACE-complete, so puzzle generation has traditionally relied on expensively running an actual solver. This paper trains a Transformer-based discrete diffusion model with no access to solvers, rewards, or solvability labels — just the task of filling in masked grid cells — and finds that 77.4% of generated puzzles are directly solvable, with 94.5% of the rest fixable by removing a single wall. It explains the mechanism through generation-order flexibility: a global property (solvability) leaking out of a purely local training objective.
"Getting It Wrong Isn't the Punishment" — 20 Puzzle Developers on Redesigning Failure
One piece today: "Designed to Fail: Puzzle Game Developers' Perspectives on Designing Challenge and Failure" by Craig G. Anderson (University of Utah) and Nasim Eshgarf, Zack Carpenter, David DeLiema (University of Minnesota), published in the FDG 2026 proceedings. Based on semi-structured interviews with 20 professional puzzle game developers, the paper shows that developers reframe "failure" away from wrong answers or performance and toward complete player disengagement — which they treat as a failure of the design, not the player. Trial and error and wrong guesses are viewed as an intentional learning mechanism that encourages experimentation and nudges players toward solutions. ACM's download page returned a 403 error for me, so this summary is based on the authors' published abstract, cross-checked across academic databases.
"Simple-Looking, Surprisingly Tough" — Generating Slit Paperfolding Puzzles at FDG 2026
One piece today: "Difficulty-based generation of paperfolding puzzles" by Stiliyan Nanovski, Mrinal Dhume, and Rafael Bidarra (TU Delft, Netherlands), presented at the Procedural Content Generation Workshop co-located with Foundations of Digital Games 2026 (FDG '26), held August 10–13, 2026 in Copenhagen. The paper generalizes an existing square-grid, slit-based paperfolding puzzle into a model supporting arbitrary shapes and slits, and builds a constraint-solving generator that derives folded states for a given paper shape and size. Puzzle difficulty is scored based on the types of folds required, and the generator surfaced new fold types made possible only by the slits. I was unable to load the full PDF due to its file size, so this summary is based on the authors' published abstract.
The MDA Framework (2004) — Three Words Puzzle Designers Still Use
In 2004, a few-page paper presented at an AAAI workshop reshaped the vocabulary of game design. Robin Hunicke, Marc LeBlanc, and Robert Zubek formalized Mechanics, Dynamics, Aesthetics. This piece follows those three words from Doug Church's unfinished 1999 homework, through a GDC workshop room, into the real project Oasis, and onto the shelf we now call Steam.
Turning “what makes a good puzzle” into a formula: DeepMind quantifies the counter-intuitiveness of chess puzzles
One piece today. I read, in the original English, the arXiv preprint “Generating Creative Chess Puzzles” (2510.23881, October 2025) by Xidong Feng and colleagues at Google DeepMind. Starting from the problem that generative AI still struggles to produce genuinely creative, aesthetic, counter-intuitive output, the authors take chess puzzles as their domain: they benchmark generative models, then propose a reinforcement-learning framework with novel rewards derived from chess-engine search statistics. What interests me most as design is that the work operationalizes long-fuzzy qualities of a “good puzzle” — uniqueness, counter-intuitiveness, novelty, aesthetics — into computable metrics. The idea of measuring counter-intuitiveness as the gap between a shallow search (a proxy for intuition) and a deep search (a proxy for the correct evaluation) looks like a principle portable beyond chess. I take it up as a pre-review preprint, with its date made explicit.
“Writing the rules of a puzzle as mathematics”: an attempt to systematize pencil-puzzle rules
One piece today. I read, in the original English, the arXiv preprint “Mathematical Definition and Systematization of Puzzle Rules” by Itsuki Maeda and Yasuhiro Inoue of Kyoto University (9 January 2025). Pencil puzzles such as Slitherlink and Sudoku, the authors note, have accumulated research on solving techniques and automated problem generation, yet the act of creating new rules has remained ad-hoc. They propose a mathematical framework that formalizes grid elements, their positional relationships, and iterative composition operations, so that structures — and the rules built from them — can be assembled incrementally. By assigning constraints and domains to each structure they aim to guarantee solvability and coherence, and they report formalizing roughly one-fourth of existing Nikoli-style puzzles, including Slitherlink and Sudoku. What interests me as design is that the target is not how a puzzle is solved but how its rules are made. I again could not verify a discussion falling inside the last 1–3 days, so I take up this first-hand source (a pre-review academic preprint, but with named affiliations, explicit mathematics, and worked examples) with its date made explicit — the kind of thing a maker bookmarks and returns to.
Let the LLM Handle Story and Puzzles, Let the Symbolic Layer Keep the World From Breaking — Uruguay's IVIE on Incremental, Validated Generation of Interactive Fiction (ICCC'26)
One article today: IVIE, a paper headed to ICCC'26 by a team at the Universidad de la República in Uruguay (Vaucher, Silveira, Góngora, Chiruzzo), which I read in full in the original English on arXiv. The goal is to generate complete, playable interactive-fiction (text-adventure) worlds from scratch. The trick is a division of labor: creative decisions—setting, characters, puzzle design—go to an LLM, while a symbolic layer guarantees structural facts like spatial connectivity and objective solvability. Worlds are built backwards from the objective across four stages, each with a validation gate. In the puzzle stage, obstacle and solution are placed in different locations, solutions must be discoverable through exploration, and hints disclose in three escalating levels. Tellingly, in 3 of 16 evaluated worlds players slipped past puzzles simply by claiming they had solved them—surfacing a design tug-of-war: validate too strictly and you choke creativity; too loosely and the puzzles become hollow. Not a puzzle game per se, but a paper that touches the root of design: how to make 'validation' and 'freedom' coexist.
Where 'Solvable' and 'Fun' Diverge — PuzzleJAX Hands 500+ PuzzleScript Games to the Machines (arXiv, Aug 2025)
One article today: "PuzzleJAX: A Benchmark for Reasoning and Learning" (arXiv preprint, August 2025) by researchers at NYU, the University of Malta, the University of the Witwatersrand (South Africa), and Microsoft (Sam Earle, Graham Todd, Ahmed Khalifa, Julian Togelius and others). They reimplement PuzzleScript — Stephen Lavelle's (increpare) 2013 puzzle-authoring language — on the GPU and hand 500+ human-authored games to tree search, reinforcement learning, and large language models. Read as a designer, the core is one observation: 'solvable by a machine' and 'interesting to a human' are not the same thing. Tree search brute-forces simple games but stalls the moment they get richer; LLMs score 0% on most. The authors even note PuzzleScript's own creator hesitating to embed an auto-solver into the IDE, a caution about measuring difficulty by search.
"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.
_studio.JPG)