Game of life
A simple implementation of the Conway's Game of Life using WebAssembly.
- Rules of life for a cell:
- Any live cell with fewer than two live neighbours dies (underpopulation)
- Any live cell with more than three live neighbours dies (overpopulation)
- Any live cell with two or three live neighbours lives, unchanged, to the next generation
- Any dead cell with exactly three live neighbours will come to life
- Controls:
- Click on a cell to toggle it's state (makes sense when the simulation is paused)
- 1 + Click - spawn a glider
- 2 + Click - spawn a pulsar
- 3 + Click - spawn a Gosper glider gun
Compact universe
Cells on the edges have neighbors that wrap around to the other side of the universe (e.g. infinite patterns, like gliders, can keep running forever until they bump into other patterns)
Flat universe
Cells on the edges have fewer neighbors than cells in the middle (e.g. gliders that reach the end of the universe are snuffed out)
Powered by
