Skip to content

Instantly share code, notes, and snippets.

@thunklife
Last active May 23, 2019 13:11
Show Gist options
  • Save thunklife/ee6332f858e20e2d47bd937ffa9b1f89 to your computer and use it in GitHub Desktop.
Save thunklife/ee6332f858e20e2d47bd937ffa9b1f89 to your computer and use it in GitHub Desktop.

Conway's Game Of Life

From Wikipedia

The universe of the Game of Life is an infinite, two-dimensional orthogonal grid of square cells, each of which is in one of two possible states, alive or dead, (or populated and unpopulated, respectively). Every cell interacts with its eight neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

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

The initial pattern constitutes the seed of the system. The first generation is created by applying the above rules simultaneously to every cell in the seed; births and deaths occur simultaneously, and the discrete moment at which this happens is sometimes called a tick. Each generation is a pure function of the preceding one. The rules continue to be applied repeatedly to create further generations.

The Challenge

Using any size grid and any initial pattern, determine the next generation(s). You can build a UI if you want to see the patterns that emerge, but this isn't required. There are lot of examples out there on the iternet, here are a few examples:

https://bitstorm.org/gameoflife/

http://thunklife.github.io/react-life/

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment