Abstract
We introduce an n-state Game of Life (GoL) on a cellular array (cells indexed by (i, j)), where each state σ = 0, ..., n − 1 has a nominal values vσ ≥ 0. The game involves computing the sum of the state values of the eight cells that surround cell (i, j) and using this sum to determine whether cell (i, j) stays in state σ, progress to state σ + 1, or reverts at state 0. We illustrate examples of this game, identifying still-life, oscillator, glider, and replicator patterns, as well as the long term behavior arising from random and regular starting configurations. Importantly, we provide two freely downloadable application programs that can be used to explore the behavior of the three and four state GoLs discussed in this paper
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
