Conway’s Game of Life
Conway’s Game of Life isn’t a game in the traditional aspect. It’s a cellular automaton which was devised by British mathematician John Conway in 1970.
This implementation was written in .NET using the Windows Forms API. There are various options in the application including:
Randomizing the initial world state based on Time or Seed.
Changing the universe size for larger or smaller simulations
Choose colors for the cells, lines, and text color
Show or hide grid lines and 10x lines
Save and Load universe data
Move through generations step-by-step or continuously
Overview
Each cell (square) is considered a tribe or group of people. Each cell only has 2 states. Living or dead.
The rules of the game are:
1. Any live cell with two or three live neighbors survives.
2. Any dead cell with three live neighbors becomes a live cell.
3. All other live cells die in the next generation.
Similarly, all other dead cells stay dead. When you start the game every tick of the timer is considered a new generation. The rules of the game are applied, and the cells will either multiply of die. The universe can be toggled between toroidal or finite. Toroidal universes wrap around the boundaries creating an infinite universe. Finite universes will constrain the cells to the boundaries and prevent cells from moving beyond the boundaries.
