Search arXivSearch

arXiv · 2205.10463

Glaberish: Generalizing the continuously-valued Lenia framework to arbitrary Life-like cellular automata

Abstract

Recent work with Lenia, a continuously-valued cellular automata (CA) framework, has yielded $\sim$100s of compelling, bioreminiscent and mobile patterns. Lenia can be viewed as a continuously-valued generalization of the Game of Life, a seminal cellular automaton developed by John Conway that exhibits complex and universal behavior based on simple birth and survival rules. Life's framework of totalistic CA based on the Moore neighborhood includes many other interesting, Life-like, CA. A simplification introduced in Lenia limits the types of Life-like CA that are expressible in Lenia to a specific subset. This work recovers the ability to easily implement any Life-like CA by splitting Lenia's growth function into genesis and persistence functions, analogous to Life's birth and survival rules. We demonstrate the capabilities of this new CA variant by implementing a puffer pattern from Life-like CA Morley/Move, and examine differences between related CA in Lenia and Glaberish frameworks: Hydrogeminium natans and s613, respectively. These CA exhibit marked differences in dynamics and character based on spatial entropy over time, and both support several persistent mobile patterns. The CA s613, implemented in the Glaberish framework, is more dynamic than the Hydrogeminium CA in terms of a consistently high variance in spatial entropy over time. These results suggest there may be a wide variety of interesting CA that can be implemented in the Glaberish variant of the Lenia framework, analogous to the many interesting Life-like CA outside of Conway's Life.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Q. Tyrell Davis, Josh Bongard. 2022-05-20. Glaberish: Generalizing the continuously-valued Lenia framework to arbitrary Life-like cellular automata. https://arxiv.org/abs/2205.10463

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Dimension-dependent continuum limits in tissue mechanics

Continuum descriptions of epithelial tissue mechanics can replace expensive individual-based simulations with tractable macroscopic models, yet the link between cell-scale forces and tissue-scale transport remains poorly understood. We show that dimensionality controls this link: long-time mechanical relaxation rates reveal generalized porous-media-type nonlinear transport phenomena, $D(ρ)\proptoρ^γ$. Exponents in nonlinear diffusivities are fixed by microscopic mechanics and dimensionality, providing a novel physical mechanism for emergent macroscopic transport phenomena.

nlin.CG

Gliders on Aperiodic Monotilings: Cellular Automata on the Hat and Spectre

The hat and spectre monotiles, discovered in 2023, tile the plane only aperiodically; no cellular automaton dynamics on these tilings has previously been reported. Cellular automata are studied here on patches generated by finite-state transducers, so that every experiment regenerates deterministically from a small record. Within edge-adjacency semi-totalistic rules, exhaustive and evolutionary searches find only mortal travelers: gliders are absent. Guided by a reproduction of the known Penrose-tiling glider, the rule space is extended to vertex neighborhoods and to priority-table rules whose non-quiescent states are visible to neighbors. Evolutionary search then discovers gliders on both monotilings; tracked by a sliding window that regenerates the patch along the flight, they travel one million rings at constant speed and heading. All headings are quantized, to millidegrees, onto a six-spoke compass - the fast axes of the tiling's graph metric. An ablation shows both rule-space extensions are individually necessary. All results replay exactly in an accompanying interactive essay.

nlin.CG

Diagonal Bases and Diagonal Periods of Elementary Cellular Automata

Which cellular-automaton diagonal families form bases in every finite window? For canonical polynomial lifts of elementary rules, two truth-table bits determine triangularity, and units on the matrix diagonal determine invertibility. Exactly 24 rules give universal binary bases; all remain universal over every modulus. Among triangular binary coordinate maps, the Pascal transform is uniquely characterized by converting OR convolution into pointwise multiplication, while increment becomes strict prefix summation. Explicit inverses and coordinate comparisons distinguish sparsity from evaluation cost. A Rule 30 polynomial construction gives Fibonacci bounds on interpolation order and prime-modulus periods. Exact additive periods anchor a finite census modulo two and three. These results separate all-window basis classification from optimization of a representation and from period patterns observed in finite windows.

nlin.CG