From UBC Wiki

Cellular Automata in Haskel

Whats the problem?

We want to create a haskel program that does cellular automata, including Conway's Game of Life. This is a zero-player game that observes the evolution of an initial state set by the user as cells on a grid. The rules of the game are as follows (taken from Wikipedia):

1. Any live cell with fewer than two live neighbours dies, as if caused by under-population.

2. Any live cell with two or three live neighbours lives on to the next generation.

3. Any live cell with more than three live neighbours dies, as if by over-population.

4. Any dead cell with exactly three live neighbours becomes a live cell, as if by reproduction.

What is the something extra?

We want to output the results to PNGs using the "diagrams" library that would display the evolutionary process from the initial state set by the user.

What did we learn from doing this?