By Noah Labrecque.
‘Conway’s Game of Life’ is a ‘zero player’ program I created, meaning that the outcome is dependent on the initial configuration. It takes place on a grid of pixles, where each pixle has two different possible states: if a square is ‘alive’ it is black, if it’s ‘dead’ it is white.
Each pixle follows these rules:
- Any live cell with fewer than two live neighbours will die (referred to as ‘underpopulation’ or ‘exposure’).
- Any live cell with more than three live neighbours will die (referred to as ‘overpopulation’ or ‘overcrowding’).
- Any live cell with two or three live neighbours will live, unchanged, to the next generation.
- Any dead cell with exactly three live neighbours will come to life.
These relativley simple rules can create some complex machines such as the one featured here: https://www.youtube.com/watch?v=ZY5vcZG0tlcand
The version that I’ve made is small and slow in comparison to those programmed in other languages, such as C++, and takes place on a tiny grid. I’m currently programming a version to run on C++ that will be around 1,000 times faster than the one I made using Scratch, which can be found here: https://scratch.mit.edu/projects/105960379/.
Press the right arrow to cycle through all the pre-made patterns then press space to start the program.