Skip to content

EmirBaran-Ozdemir/C_Pyhton-GameOfLife

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

9 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Python-GameOfLife

Conway's Game Of Life recreated using Python's pygame and C's fast calculations.
My previous project was using only Python's numpy libraray to calculate cells.
This project is 10-15 times faster than my previous Python-GameOfLife project.

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.

Examples of Patterns

Many different types of patterns occur in the Game of Life, which are classified according to their behaviour. Common pattern types include: still lifes, which do not change from one generation to the next; oscillators, which return to their initial state after a finite number of generations; and spaceships, which translate themselves across the grid.

Stable Lifes

Block Bee-hive Loaf Boat Tub
Block Bee-hive Loaf Boat Tub

Oscillators

Blinker Toad Beacon Pulsar Penta-decathlon
Blinker Toad Beacon Pulsar Pentha-decathlon

Spaceships

Glider Light-Weight Spaceship Middle-Weight Spacehip Heavy-Weight Spaceship
Glider LWSS WWSS HWSS

For further explanation check this wiki page.

Required Libraries

Installation

git clone https://github.com/EmirBaran-Ozdemir/Python-GameOfLife.git
pip install -r requirements.txt
cc -fPIC -shared -o c_sum.so c_sum.c
python main.py

BADGES

GitHub issues GitHub forks GitHub stars GitHub license
Twitter

About

Conway's Game Of Life created using C and Python

Resources

License

Stars

Watchers

Forks

Packages

No packages published