Conway's Game of Life   In 1970 the English mathematician John Conway defined the rules for 'the game of life', not so much a real game but an implementation of the mathematical concept of cellular automata. Cellular automata are objects that follow a (simple) set of rules to evolve from one generation to the next. This application of the same rules over and over is a property that cellular automata share with fractals, although Conway's game of life does not produce a fractal image. The game of life consists of a field of cells that can be in one of two states: populated or not populated. Starting from an initial condition where some cells of the field are populated and some are not, the following set of three rules is applied repeatedly. Birth Death by loneliness Death by overpopulation If an unpopulated cell is surrounded by three populated cells, it becomes populated. If a populated cell is surrounded by at most one other populated cell, it becomes unpopulated. If a populated cell is surrounded by at least four other populated cells, it becomes unpopulated. Click on the Start button and see how these rules make a randomly generated population evolve. You can click the Stop button to stop the evolution, and when the evolution is stopped the Seed button will create a new initial random population. If you find that the game runs too slow on your computer, try this smaller version.

Bugs in the Netscape 6 browser distort most pages of this site. If this annoys you, use Internet Explorer, Netscape Communicator/Navigator or Opera instead. © All material on this site is owned by Berend Meijer. You are not allowed to copy any of the text, images, music, sounds, scripts or other contents unless you get his permission first. You are also not allowed to use any of the text, images, music, sounds, scripts or other contents outside the context of this site.