Conway's Game of Life is a classic simulation created by mathematician John Conway in 1970.
This cellular automaton unfolds on an infinite two-dimensional grid of cells. Every cell exists in one of two states: alive or dead. With each turn (called a generation), a cell's state updates based on the status of its eight surrounding neighbors—those adjacent horizontally, vertically, or diagonally.
The simulation begins with an initial pattern (generation one). The next generation emerges when the rules are applied simultaneously to every cell on the board, meaning all births and deaths occur at once. This process repeats to produce subsequent generations. For any given generation, a cell's next state is determined by the following straightforward rules:
A live cell remains alive only if it has exactly two or three live neighbors.
A dead cell becomes alive only if it has exactly three live neighbors.
Naturally, many rule variations exist, based on different number combinations that dictate cell survival or death. Conway tested numerous alternatives before selecting these particular parameters. Some variants lead populations to die out quickly, while others cause unchecked expansion across the universe. The chosen rules sit near the boundary between these extremes. As with other chaotic systems, the most intricate and fascinating patterns often emerge at this delicate balance, where the forces of explosive growth and extinction precisely counter each other.
What's New in the Latest Version 0.2.2
Tags : Simulation
