Conway’s Game of Life (#104)

This program is a simulation of the famous cellular automaton created by John Conway. The so-called “game” is rather a simulated evo­lu­tion of cells in a two-di­men­sion­al world. Each cell can either be dead (black) or alive (white) and always has eight neighbours surrounding them. In each cycle of the simulation their state will be changed based on two simple rules, which are listed below.
Despite the rule’s simplicity, the outcomes are often very interesting and complex.
For more details on the game of life, check this Wikipedia entry.

The Rules

• A live cell can on­ly survive with exactly 2 or 3 neighbours, or else it dies.
• A dead cell with exactly 3 neighbours comes to life.

Controls

• Left click turns cell at current mouse position alive,
• Right click turns cell at current mouse position dead,
• “r” turns every cell dead,
• “q” cycles once,
• “w” cycles continuously.

Source code: conways-game-of-life.py