neural-cellular-automata technique sourced
Neural cellular automata
Cellular automata whose local update rule is a small learned network or logic circuit, trained so that cells grow, maintain, and regenerate a target pattern, texture, structure, or level from a seed.
mechanism
Each grid cell holds a state vector (16 channels in Growing NCA: RGB, an alpha channel that marks living cells, and hidden signaling channels). Every step a cell perceives its 3x3 neighborhood through fixed Sobel gradient filters, a shared network of about 8,000 parameters maps the perception vector to a state increment, and a random mask applies the update to roughly half the cells, so no global clock is needed. Cells with no living neighbor are zeroed. The rule is trained by backpropagating through many steps toward a target image or style, with damaged samples in the training pool to teach regeneration. Variants use 3D convolutions for voxel structures, quality-diversity search instead of gradients for game levels, or differentiable logic gates that compile to a discrete binary circuit (DiffLogic CA).
limitations
- Each trained rule targets one pattern, texture or structure family; changing the target requires retraining.
- Growth unfolds over many steps, so getting a stable result has a latency that instant procedural methods do not have.
- Learned rules are opaque to designers and players, apart from small logic-gate circuits, which makes failures hard to diagnose.
- Demonstrations are small 2D images, 3D structures of a few thousand blocks, and simple tile domains; robustness under player interference at game scale is not shown.
relations
4 stored edgesFalling-sand materials
Local per-cell material rules can be learned from examples of desired behavior instead of hand-coded; DiffLogic CA recovered Game of Life exactly as a compact logic circuit cheap enough for per-pixel use.
Procedural build assist
A seed block placed by the player can grow into a castle or tree over time under a learned 3D rule, a growth-based alternative to instant procedural detailing.
Procedural terrain
Tile maps and levels can be grown by NCA generators selected by quality-diversity search for solvability and diversity, replacing hand-tuned noise and placement rules.
Voxel destruction
Regenerating NCA regrow damaged shapes and 3D NCA regrow parts of machines, enabling destructible structures and organisms that heal from local rules rather than respawning.
backlinks
computed from other recordsclaims
5 with sourcesGrowing NCA grew an image from one seed cell with a shared update network of about 8,000 parameters; models trained on damaged samples regrew erased regions, including damage types not seen in training.
NCA texture models with 5,868 parameters synthesized textures interactively in real time in a WebGL demo.
3D NCA grew Minecraft castles, apartment blocks and trees, some over 3,000 blocks, and regrew parts of simple functional machines.
Quality-diversity search (CMA-ME) produced diverse NCA level generators for maze, Sokoban and Zelda domains, often meeting solvability criteria, and explored level space better than a CPPN baseline.
DiffLogic CA (2025) learned Conway's Game of Life from all 512 3x3 configurations as a 336-gate binary circuit and grew patterns such as a lizard with 577 gates, with asynchronous and self-healing variants.