Simplified game of life: Algorithms and complexity

Chatterjee, K, Ibsen-Jensen, R ORCID: 0000-0003-4783-0389, Jecker, I and Svoboda, J (2020) Simplified game of life: Algorithms and complexity .

Text 2007.02894.pdf - Submitted version Download (556kB) | Preview

Abstract

Game of Life is a simple and elegant model to study dynamical system over networks. The model consists of a graph where every vertex has one of two types, namely, dead or alive. A configuration is a mapping of the vertices to the types. An update rule describes how the type of a vertex is updated given the types of its neighbors. In every round, all vertices are updated synchronously, which leads to a configuration update. While in general, Game of Life allows a broad range of update rules, we focus on two simple families of update rules, namely, underpopulation and overpopulation, that model several interesting dynamics studied in the literature. In both settings, a dead vertex requires at least a desired number of live neighbors to become alive. For underpopulation (resp., overpopulation), a live vertex requires at least (resp. at most) a desired number of live neighbors to remain alive. We study the basic computation problems, e.g., configuration reachability, for these two families of rules. For underpopulation rules, we show that these problems can be solved in polynomial time, whereas for overpopulation rules they are PSPACE-complete.

Item Type:	Conference Item (Unspecified)
Depositing User:	Symplectic Admin
Date Deposited:	08 Oct 2020 08:24
Last Modified:	04 Jun 2025 16:26
DOI:	10.4230/LIPIcs.MFCS.2020.22
Related Websites:	Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3103673
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.