Skip to content

Conway's Game Of Life implemented using a minimum size array (sparse model), keeping only a record of the alive cells, thus saving memory and processing time.

Notifications You must be signed in to change notification settings

amaynez/GameOfLife

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Conway's Game Of Life

Language Module Module Release

Simple implementation of Conway's Game Of Life, it can take a given state to start, or randomize the board with a given density.

The program is implemented using a minimum size array, keeping only a record of the alive cells, hence saving memory and processing time each iteration. The other alternative is to keep a full array of the board and specify 0 or 1 if the cell is dead or alive.

About

Conway's Game Of Life implemented using a minimum size array (sparse model), keeping only a record of the alive cells, thus saving memory and processing time.

Topics

Resources

Stars

Watchers

Forks

Languages