Conway's Game of Life is a simulation game with a few simple rules designed to simulate cellular automaton. For each iteration all cells are evaluated by specific criteria and as such either "live" or "die" for the next generation.
I've created this game with 2 of the more common rules.
1) A live cell stays alive if it has 2 or 3 live neighbors.
2) A dead cell comes to life if it has exactly 3 neighbors.
The idea is that a cell will either either die of loneliness if too few neighbors exist or die of overpopulation when too many neighbors exist. Additionally this rule set simulates the unique requirements for reproduction in that a group must have both space (not too many) and resources (not too few) neighbors to generate new cells.
There are several known patterns that produce interesting affects but for this game I am randomly generating a grid for the simulation. I'm really just wanting to demonstrate the simplest version of this simulation I can.
[Please log in to post a comment]
