A probabilistic extension to Conway’s Game of Life
- 12 Downloads
The “Game of life” model was created in 1970 by the mathematician John Horton Conway using cellular automata. Since then, different extensions of these cellular automata have been used in many applications. In this work, we introduce probabilistic cellular automata which include non-deterministic rules for transitions between successive generations of the automaton together with probabilistic decisions about life and death of the cells in the next generation of the automaton. Different directions of the neighbours of each cell are treated with the possibility of applying distinct probabilities. This way, more realistic situations can be modelled and the obtained results are also non-deterministic. In this paper, we include a brief state of the art, the description of the model and some examples obtained with an implementation of the model made in Java.
KeywordsProbabilistic cellular automata Game of Life
Mathematics Subject Classification (2010)68Q80 37B15 68Q87 68W20
Unable to display preview. Download preview PDF.
We thank the anonymous reviewers for their suggestions and comments which have improved the quality of the paper.
- 3.Aguilera–Venegas, G., Egea-Guerrero, R., Galán–García, J.L.: Introducing probabilistic cellular automata. A versatile extension of Game of Life (Abstract). In: Solin, P., Karban, P., Ruis, J (eds.) ESCO 2018. 6th European Seminar on Computing (Book of Abstracts). University of West Bohemia, Pilsen, Czech Republic, p 75 (2018)Google Scholar
- 9.Bays, C.: Introduction to cellular automata and Conway’s Game of Life. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 1–7. Springer, London (2010)Google Scholar
- 17.Rendell, P.: A simple universal Turing machine for the Game of Life Turing machine. In: Adamatzky, A. (ed.) Game of Life Cellular Automata, pp. 519–545. Springer, London (2010)Google Scholar