Metadata-Version: 2.1
Name: gameoflife-lam
Version: 0.0.1
Summary: An example package of lamdoanduc
Home-page: https://github.com/lamdoanduc/game-of-life
Author: lamdoanduc
Author-email: duclamsp@gmail.com
License: UNKNOWN
Platform: UNKNOWN
Classifier: Programming Language :: Python :: 3
Classifier: License :: OSI Approved :: MIT License
Classifier: Operating System :: OS Independent
Description-Content-Type: text/markdown

project-python
Project 1 - Game of life

Game of life is a cellular automaton devised by John Conway in 70's: http://en.wikipedia.org/wiki/Conway's_Game_of_Life

The game consists of two dimensional orthogonal grid of cells. Cells are in two possible states, alive or dead. Each cell interacts with its eight neighbours, and at each time step the following transitions occur:

Any live cell with fewer than two live neighbours dies, as if caused by underpopulation
Any live cell with more than three live neighbours dies, as if by overcrowding
Any live cell with two or three live neighbours lives on to the next generation
Any dead cell with exactly three live neighbours becomes a live cell
The initial pattern constitutes the seed of the system, and the system is left to evolve according to rules. Deaths and births happen simultaneously.

In a git repository implement the Game of Life using Numpy. Try first 32x32 square grid and cross-shaped initial pattern:

Try also other grids and initial patterns (e.g. random pattern). Try to avoid for loops. For visualization you ca use Matplotlib: import matplotlib.pyplot as plt plt.imshow(array)

Make a pip package out of it including dependencies. Add CI using Travis, testing installation from pip and running one game of 1000 iterations checking that it matches a pre known pattern.

