Conway's Game of Life

Description

The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is a zero-player game, meaning that its evolution is determined by its initial state, requiring no further input. One interacts with the Game of Life by creating an initial configuration and observing how it evolves. It is Turing complete and can simulate a universal constructor or any other Turing machine.

- From Wikipedia

Rules

  1. Any live cell with fewer than two live neighbours dies, as if by underpopulation.
  2. Any live cell with two or three live neighbours lives on to the next generation.
  3. Any live cell with more than three live neighbours dies, as if by overpopulation.
  4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

Controls

  • LMB - Revive cells
  • RMB - Kill cells
  • MMB - Move camera
  • MOUSE SCROLL - Zoom in and out
  • G - Toggle grid
  • S - Start / Stop simulation
  • END - Clear simulation
  • ESC - Cancel import
  • PgDn - Minimal zoom
  • PgUp - Normal zoom
  • H - Toggle this sidebar

Universe informations

Can't keep up! Running ms behind!

Population:

Iteration:

Status:

Zoom: %


Performance

Framerate:

Iteration time (ms/i):

Import patterns

Select pattern

Brush

Use brush