Game of Life

This is an implementation of Conway's Game of Life

Description

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.

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.

Implementation

• Our script will have the input file name, output file name, and the number of generations as arguments.
• It will load the initial pattern of the grid from the input file.
• It will apply the rules for the number of generations
• It will store the final grid in the output file.

File format

• Grid will be read from a text file.
• The first line of the text file indicated the width and height of the grid, unsigned integers separated space.
• All other lines will indicate the position of the living cells. Each line will have the horizontal and vertical positions of a living cell.
  1. The position is based on zero-indexing w/ top left cell is 0 0
  2. Horizontal index increases from left to right
  3. Vertical index increases from top to bottom.

How to use this

Before you use this file you need to change some parameters within the python code main function:

#For game_NoNdask 
input_path = "input.txt" ##this is directory to your input file
output_path = "output_test5x5.txt"   ##this is directory to save your output file
generations = 1  ##This is for the generation
data_type = "int32"  ##This is to change the format of the board

#For game_dask <br>
input_path = "input.txt" ##This is directory to your input file
output_path = "output_test5x5.txt"   ##This is the directory to save your output file
generations = 5 ##This is for the generation
chunksize = (100, 100) ##This is specify chunks
scheduler = "threads"  ##This is specify scheduler for DASK 
data_type = "int32"    ###This is to change the format of the board

You just need to run it in the terminal by using Python:

python game_NoNdask.py
python game_dask.py

Input/Output File

The example of the input file is provided in the input example folder. The input file consists of board size and indices of the living cells.

This code reads files like this:

5 5   ##The first line is the size of the board
0 0   ##The rest are indices of the living cells on the board
2 1
2 2
3 2
3 4

This is the content of input.txt

The outputs files will have similar format.

DASK AFTERTOUGHT

It is the code that was found after checking the line profiler and cprofile. It improves the loops for neighbour_count and different way to implement the Game of Life rules. To use this code, the step is is similiar with game_dask.

#For game_dask_aftertought
input_path = "input.txt" ##This is directory to your input file
output_path = "output_test5x5.txt"   ##This is the directory to save your output file
generations = 5 ##This is for the generation
chunksize = (100, 100) ##This is specify chunks
scheduler = "threads"  ##This is specify scheduler for DASK 
data_type = "int32"    ###This is to change the format of the board

In the terminal you can run it by:

python game_dask_aftertought.py

DOCUMENTATION

In this repository also provided a documentation that explain the benchmarking process that done.