Abstract
The Game of Life is the exemplar of a cellular automaton (CA) and hence serves as a good starting point for our work with cellular automaton programming. Originally developed by John Conway, a British mathematician, the Game of Life was supposedly the first program run on a parallel processing computer. In fact, it has been estimated that more computer time has been spent running the Game of Life program than any other computer program. While the Game of Life is an abstract “toy” system that has not (yet) been found to directly represent any specific natural system, it has been the springboard for the study of so-called “artificial life” systems because of the amazingly complex behaviors displayed by some of the patterns that occur during the running of the CA. We will implement the Game of Life CA in the fastest high-level way we know of, by generating and using a lookup table consisting of 512 rules for updating sites on the Game of Life lattice.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Gaylord, Richard J. and Wellin, Paul R. Computer Simulations with Mathematical Explorations in Complex Physical and Biological Systems. TELOS/Springer-Verlag (1995).
Poundstone, William. The Recursive Universe. Oxford University Press (1985).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media New York
About this chapter
Cite this chapter
Gaylord, R.J., Nishidate, K. (1996). The Game of Life. In: Modeling Nature. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-9405-1_2
Download citation
DOI: https://doi.org/10.1007/978-1-4684-9405-1_2
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-94620-7
Online ISBN: 978-1-4684-9405-1
eBook Packages: Springer Book Archive