game-of-life

Required libraries

• Boost
• SFML == 2.5

Usage

Usage: game-of-life [options]

Options:
  -h [ --help ]                     Print help.
  -x [ --field-x ] arg (=300)       Set the field size on the X-axis.
  -y [ --field-y ] arg (=300)       Set the field size on the Y-axis.
  -w [ --window-width ] arg (=600)  Set the window width.
  -h [ --window-height ] arg (=600) Set the window height.
  -s [ --speed ] arg (=0.1)         Set the simulation speed (seconds for 1 frame).

Rules

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, live 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.

These rules, which compare the behavior of the automaton to real life, can be condensed into the following:

• Any live cell with two or three live neighbours survives.
• Any dead cell with three live neighbours becomes a live cell.
• All other live cells die in the next generation. Similarly, all other dead cells stay dead.

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, live or dead; 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.