Conway's Game of Life is a cellular automaton invented by mathematician John Conway in 1970. It is played on an infinite two-dimensional grid where each cell can be either alive or dead. The game's evolution occurs in generations, with each cell's status changing based on the status of its eight neighbors (horizontally, vertically, and diagonally adjacent cells).

The initial pattern of live and dead cells constitutes the first generation. Subsequent generations are determined by applying the following rules simultaneously to every cell:

• Survival: A live cell remains alive if it has two or three live neighbors.
• Death: A live cell dies (becomes dead) if it has fewer than two live neighbors (underpopulation) or more than three live neighbors (overpopulation).
• Birth: A dead cell becomes alive if it has exactly three live neighbors.

Conway experimented with various rule variations before settling on these specific rules. Some variations resulted in populations quickly dying out, while others led to unlimited expansion. The current rules exist near the boundary between these extremes, creating a balance between expansion and death, which in turn gives rise to complex and fascinating patterns.

What's New in the Latest Version 0.2.2

• Last updated on Aug 3, 2024