Conway's Game of Life

Conway's Game of Life is a cellular automaton, an automatic machine created by professor John Conway and his students at Cambridge, in 1970. It is a zero-player game, which means it is determined by only its initial state.  The standard rules are: a cell is born if it has 3 neighbors (from a total of 8 adjacent cells) and survives if it has 2 or 3 neighbors. Since the game's creation, many other rules were investigated, composing what today is the family of life-like cellular automata (there are 262,144 possible rules). The original game of life is Turing complete, so it can harbor universal computation and also self-replicating entities. It is a beautiful example of a minimal system capable of sustaining life-like organisms, yielding great complexity and (strong) unpredictability in a deterministic and substrate-agnostic setting.

Controls: Left-click the grid to breed cells and right-click to kill them. You can experiment with colors, patterns, different rules, and change variables on the fly. The game has an infinite size in theory, and interesting patterns can be incredibly large; this software presents a small 50x50 grid sample of the game, intended as an art toy, featuring its microlevel (with boundaries interaction).

Learn more:

https://conwaylife.com/wiki/Main_Page

https://en.wikipedia.org/wiki/Conway%27s_Game_of_Life