The Game of Life

 John Horton Conway was a mathematician at Cambridge University (later at Princeton). He sought to simplify von Neumann's "universal constructor" based on cellular automata, but with fewer states and rules. "... only after the rejection of many patterns, triangular and hexagonal lattices as well as square ones, and of many other laws of birth and death, including the introduction of two and even three sexes. Acres of squared paper were covered, and he and his admiring entourage of graduate students shuffled poker chips, foreign coins, cowrie shells, Go stones or whatever came to hand, until there was a viable balance between life and death." J. J. O'Connor and E. F. Robertson, "John Horton Conway," http://www-groups.dcs.st-andrews.ac.uk/~history/Mathematicians/Conway.html Conway had contributed previously to the "Mathematical Recreations" column in Scientific American, written by his friend Martin Gardner. Published in Gardner's column as "The Fantastic Combinations of John Conway's New Solitaire Game 'Life'," Scientific American (1970): 120-23. Conway's Prize Question: R. William Gosper (MIT) and computer Life (glider gun and puffer train) prove infinite expansion. Early community-based game, developed and extended by programmers and players. Possibly the most-programmed computer game of all time. Especially popular with microcomputer enthusiasts: Byte magazine, Cromemco "Dazzler," many versions of game.
 Conway's Desired Results:: Rules: There should be no initial pattern for which there is a simple proof that the population can grow without limit. There should be initial patterns that apparently do grow without limit. There should be simple initial patterns that grow and change for a considerable period of time before coming to end in three possible ways: fading away completely (from overcrowding or becoming too sparse), settling into a stable configuration that remains unchanged thereafter, or entering an oscillating phase in which they repeat an endless cycle of two or more periods. Survivals. Every counter with two or three neighboring counters survives for the next generation. Deaths. Each counter with four or more neighbors dies (is removed) from overpopulation. Every counter with one neighbor or none dies from isolation ["loneliness."] Births. Each empty cell adjacent to exactly three neighbors--no more, no fewer--is a birth cell. A counter is placed on it at the next move.
 The "Cheshire Cat" Sequence. Mark Alpert, "Not Just Fun and Games," Scientific American (April 1999). A "Glider" A "Blinker". A "Puffer Train."

Top 60 of Game-of-Life Objects: http://wwwhomes.uni-bielefeld.de/achim/freq_top_life.html

Java version: http://hensel.lifepatterns.net/

Java version that steps through game: http://www.bitstorm.org/gameoflife/

Life32 (best Windows version: http://psoup.math.wisc.edu/Life32.html