Procedural Content Metageneration via Program Search and Continual Abstraction Discovery
Ranking
Overall
77
Content
95
Popularity
37
Observed public metrics from 1 member.
Merged summary
TL;DR - This paper evolves complete Python generators for four games using LLM-driven mutation and crossover. Continual Abstraction Discovery (CAD) improves program-search fitness by extracting reusable primitives from successful generators.
- Evaluated on Sokoban, Zelda, Dangerous Dave, and Lode Runner across 160 complete evolutionary runs.
- A 2Ă—2 experiment tests CAD both with and without a fixed, hand-written domain API.
- CAD increases mean final-best fitness in all eight domain/API comparisons.
- Later programs widely adopt learned libraries, which repeatedly capture validation, reachability, and structural utilities.
Sources (1)
Procedural Content Metageneration via Program Search and Continual Abstraction Discovery
Public signals
Semantic Scholar citations 0 · Semantic Scholar influential citations 0
TL;DR - This paper evolves complete Python generators for four games using LLM-driven mutation and crossover. Continual Abstraction Discovery (CAD) improves program-search fitness by extracting reusable primitives from successful generators.
- Evaluated on Sokoban, Zelda, Dangerous Dave, and Lode Runner across 160 complete evolutionary runs.
- A 2Ă—2 experiment tests CAD both with and without a fixed, hand-written domain API.
- CAD increases mean final-best fitness in all eight domain/API comparisons.
- Later programs widely adopt learned libraries, which repeatedly capture validation, reachability, and structural utilities.