Conway's Game of Life.
Small rules. Unexpected patterns. Explore a living grid, or load a board from my MPI + CUDA project.
GENERATION 0ALIVE 5BOARD 64 × 40STATUS Paused
Pause to draw or erase cells. Scroll to explore a zoomed board. Reset returns to your starting pattern.
Import or export a board / lifeout.out
Load output from my MPI + CUDA project, or paste a board below. Files stay in your browser. Maximum: 512 × 512 cells.
How it works
Each cell has eight neighbors. A live cell survives with two or three live neighbors. A dead cell becomes alive with exactly three. Every generation updates all cells together. Wrap edges connects opposite sides of the board.
This browser simulation uses the same Conway rules as my parallel computing project. The MPI and CUDA program runs separately on AiMOS; you can explore its text output here.
Explore the source repository ↗