Metraipolis › archive › dc_91c3e66200b3

Programmable Cellular Automata — arXiv:2609.06102

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.06102
License (as archived)
CC0-1.0
Archived
2026-10-16T13:58:50.212Z
SHA-256 of the archived text
430c8df5c1191fe0a46fa0579582447fd6588654f8670456e235d0e128d323af
Stable URL of this page
https://metraipolis.com/documento/dc_91c3e66200b3

How to cite

Programmable Cellular Automata — arXiv:2609.06102 — arXiv (en), https://arxiv.org/abs/2609.06102 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_91c3e66200b3 (Metraipolis archive dc_91c3e66200b3, sha256 430c8df5c1191fe0a46fa0579582447fd6588654f8670456e235d0e128d323af)
BibTeX
@misc{dc91c3e66200b3,
  title = {Programmable Cellular Automata — arXiv:2609.06102},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.06102},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_91c3e66200b3; sha256 430c8df5c1191fe0a46fa0579582447fd6588654f8670456e235d0e128d323af},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.06102. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Cellular automata is a local computation paradigm where complex behavior can arise from local interactions between simple functions. This paradigm has been used to explain many systems such as biological processes, traffic simulation, computer networks, etc. In games, cellular automata have been used in games such as SimCity and for the generation of spatial content such as caves or dungeons. However, creating effective local rules is hard and unintuitive. Cellular automata can be effectively evolved, but may still be hard to interpret. In this work, we introduce the concept of programmable cellular automata, where we represent the system as Python code. We also modularize the cellular automata into local functions and a decision function. Local functions take a local neighborhood and return a value, while the decision function takes the output of the local functions and decides the value of the next state. Separating the cellular automata into modules written in Python helps with understanding how these systems are working. We also explore adding global functions where they take the whole state and compute a function from it. We tested generating levels for three different games from the PCG Benchmark. The results showed that global functions decrease the number of iterations that cellular automata need to solve a problem, and that we cannot find solutions for some problems with purely local functions. Looking into the generated functions, we can see common functions that have been used in different experiments, which not only helps us understand the generator but also helps us understand these games better and what is important for them.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-09 in cs.LG).
Categorie arXiv: Neural and Evolutionary Computing (cs.NE) ; Artificial Intelligence (cs.AI); Formal Languages and Automata Theory (cs.FL); Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.06102 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T13:39:43.147Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).