/Game_of_life

The Conway's Game of Life

Primary LanguagePythonMIT LicenseMIT

Conway's Game of Life

The Game of Life devised by John Horton Conway in 1970 is a zero-player game, meaning that its evolution is determined by its initial state.


About this project

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. In this example, the initial state was randomly generated. Rules have been modified for the added dimension and are: Every cell interacts with its 27 neighbours, which are the cells that are horizontally, vertically, or diagonally adjacent. At each step in time, the following transitions occur:

  1. Any live cell with fewer than 6 live neighbours dies, as if caused by under-population. (disappears)
  2. Any live cell with 6 to 8 live neighbours lives on to the next generation. (stays the same color).
  3. Any live cell with more than 8 live neighbours dies, as if by over-population.
  4. Any dead cell with 6 to 8 live neighbours becomes a live cell, as if by reproduction. (Appears and has a new color assigned to it)

Overview


How it Works


Authors


Finished 17 / 06 / 2021