TAG
#level-generation
0 reviews · 6 essays
Related essays
Halina & Guzdial: Generating Levels as a "Cake of Time" — Fukai Reads
A procedural level-generation paper by Halina and Guzdial. It represents a level as a "cake" of board states stacked over time, and generates a level and its solution together with PRP, which recombines play traces. In Sokoban, against six existing methods, it reached 100% playability with high diversity, without hand-authored constraints or rewards.
Earle et al.: Recasting Level Design from a One-Person Job to a Multi-Agent Collaboration — Fukai Reads
A paper on reinforcement-learning level generation (PCGRL) by Earle et al. It recasts the traditional single-agent, tile-by-tile method as a multi-agent problem in which several agents divide the work and edit in parallel, showing across maze and dungeon domains that more agents improve generation quality, generalization to unseen boards, and computational efficiency.
Bhaumik et al.: Stitching WFC and Reinforcement Learning for Playable, Good-looking Levels — Fukai Reads
A procedural level generation paper by Bhaumik et al. It tackles the weaknesses of WFC (good-looking but unplayable) and reinforcement learning (playable but ugly) with WCRL, which narrows the RL agent's actions using WFC's local rules, generating Lode Runner levels that are both example-like and playable.
Özkan: Co-Training the Level-Generating AI and the Level-Solving AI — Fukai Reads
A paper by Miraç Buğra Özkan that trains level generation and level solving together via reinforcement learning. In Unity, a hummingbird (solver) and a floating island (generator) learn while watching each other's results, reaching about 90.2% success across 100 unseen layouts.
Kar: Using Autonomous Agents to Check at Runtime Whether Generated Levels Are Actually Playable — Fukai Reads
A PCG (procedural content generation) paper by Rishabh Kar of King's College London. It proposes Momentum, a mechanism that validates whether a generated course is actually traversable inside the same runtime loop, without pausing the game. Two autonomous agents run ahead of the player and inspect the path via geometric checks from the air and NavMesh checks on the ground. The evaluation is presented as structural estimates derived from the code.
Xu et al.: Promoting Game Mechanics to Coordinates to Generate Solvable Levels — Fukai Reads
A PCG (level generation) paper by Xu and Verbrugge of McGill University. Against geometry-first prior methods, it proposes HDPCG, which runs pathfinding on a dimensional-expanded graph that promotes mechanics such as gravity inversion and moving platforms to a coordinate, guaranteeing solvability during generation, and reproduces playable levels in Unity.
