Game of Life


The selected pattern is bigger than the board itself. Please either decrease the cell size accordingly or select a different pattern from the settings.



This is a simulator for Conway's Game of Life which is a cellular automaton developed by mathematician John Horton Conway in 1970. The game universe consists of two-dimensional orthogonal square cells with two possible states, alive (black) or dead (white), each having 8 neighbours according to Moore neighbourhood. This version uses a user defined fixed size toroidal array as the board meaning that the top and the bottom most cells are neighbours as well as the left and the right most cells. Note that this game is referred as a zero-player game in which user interaction is minimal.


Rules are defined as follows:

Rule 1: Any live cell with fewer than two live neighbours dies, as if caused by under-population.

Rule 2: Any live cell with two or three live neighbours lives on to the next generation.

Rule 3: Any live cell with more than three live neighbours dies, as if by overcrowding.

Rule 4: Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.


Settings can be found in the top left of the screen:

Speed: Sets the play speed of the simulation to the nth power of 2 frames per second. Note that the actual speed of the simulation may depend on the board size and the performance of the device used.

Cell Size: Sets the size of cells on the board to the nth power of 2 pixels.

Pattern: Sets the initial pattern of the board. The list consists of some of the most common patterns and more can be found in here.


Control buttons can be found in the bottom of the screen:

Resets the board to the initial pattern.

Advances the board by one generation (i.e. "tick") and stops.

/ Plays / Pauses the simulation.

Clears the board.

Enables / Disables eraser mode to delete cells. Right click can be used wherever available to delete cells without using this button.