Conway's Game of Life

Conway's Game of Life in C++ and SFML

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.

The rules of the game are pretty simple :

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

Prerequisites

• SFML 2.5.1 or higher
• g++
• make

Installation

1. Clone the repo:

git clone https://github.com/ihebu/life.git

2. Navigate to the project directory:

cd life

3. Compile the source files using make:

make

Running the game

To run the game, simply execute the binary file generated by the build process:

build/life