Conway's Game of Life: The Rules

These are the slides that I am using while facilitating Coderetreats, especially at Global Day of Code Retreats.

Transcript

1. Zero-player game Cellular automation system Devised by John Horton Conway Evolution is determined by initial state Each cell can be alive or dead Conway’s Game of Life Problem to solve:
2. Each cell has 8 neighbours and follows 3 rules 1 2 3 4 5 6 7 8
3. Any live cell with fewer than 2 live neighbours dies of loneliness Rule 1
4. Any live cell with more than 3 live neighbours dies of overcrowding Rule 2
5. Any dead cell with exactly 3 live neighbours comes to life of warmth Rule 3