C’Gol is an implementation of Conway’s Game of Life. It is a cellular automaton based on four simple rules:
- A living cell dies if it has fewer than 2 living neighbors.
- A living cell lives if it has 2 or 3 living neighbors.
- A living cell dies if it has more than 3 living neighbors.
- A dead cell lives if it has exactly 3 living neighbors.
Several special patterns emerge from these rules, which can be static, oscillating, moving or chaotic.
This program was a team work of Alexander Noss, Christian Rautenberg, David Zentner, Philipp Erler and Stephan Schneider for our studies of software engineering at the HS-Esslingen.