A Cellular Automata The game is comprised of squares, or cells, in a grid. These squares can be dead or alive. There is a set of rules determining what cells will be dead and alive in the next generation 1. If a dead cell has exactly 3 live neighbors, it comes alive. 2. if an alive cell has 2-3 live neighbors, it stays alive. 3. if an alive cell has less than 2 live neighbors, or more than 3 live neighbors, it dies. The blank button kills all cells. The red button stops the simulation. The green button starts the simulation. The yellow button advances one generation. The blue button creates a random soup. Press the grid to switch the states of a cell
