https://github.com/jon4hz/conways_game_of_life_python

A pygame adaption of conway's game of life.
https://github.com/jon4hz/conways_game_of_life_python

conway conways-game-of-life gameoflife math pthon3

Last synced: 1 day ago
JSON representation

A pygame adaption of conway's game of life.

• Host: GitHub
• URL: https://github.com/jon4hz/conways_game_of_life_python
• Owner: jon4hz
• License: mit
• Created: 2021-03-14T22:32:46.000Z (almost 4 years ago)
• Default Branch: master
• Last Pushed: 2021-03-22T22:25:08.000Z (almost 4 years ago)
• Last Synced: 2024-11-08T19:53:16.841Z (about 2 months ago)
• Topics: conway, conways-game-of-life, gameoflife, math, pthon3
• Language: Python
• Homepage:
• Size: 47.9 KB
• Stars: 1
• Watchers: 3
• Forks: 1
• Open Issues: 0
• Metadata Files:
  • Readme: README.md
  • License: LICENSE

Awesome Lists containing this project

README

        
# Conway's Game of Life

A python adaption

## Prerequisites

- `python3`

## Installation

- Clone the repository: `git clone https://github.com/jon4hz/conways_game_of_life_python`

- Move to the directory: `cd conways_game_of_life_python`

- Install the dependencies: `python -m pip install -r requirements.txt`

- Start the game: `python game.py`

## Keybinding

- `p` for `play` and `pause`

- `c` to clear the board when the game is paused

## Customization

[to be added]

## About the Game

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. 

### 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; 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. 

### Source

[https://www.wikiwand.com/en/Conway%27s_Game_of_Life](https://www.wikiwand.com/en/Conway%27s_Game_of_Life)