The Game of Life, also known simply as Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970.

The "game" 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, or, for advanced "players", by creating patterns with particular properties.

- Conway's Game of Life Wiki

What To Do:

  • Click the cells to toggle their state ('alive' or 'dead')
  • Use the functions at the bottom to play, pause, reset, control speed, and generate a random starting pattern.

This implementation explores the properties of the simulation of a hexagonal grid, while following the same simple rules of the original:

  1. Any live cell with fewer than two live neighbours dies, as if caused 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.

Source code

Source code can be downloaded via my bitbucket:

Mirrored on GitHub:

Leave a comment

Log in with to leave a comment.