Conway's Game of Life

Conway's Game of Life in JavaScript

Sorry, this applications needs JavaScript to work.

This is an implementation of Conway's Game of Life or more precisely, the super-fast Hashlife algorithm, written in JavaScript using the canvas-tag. It can simulate the largest known patterns, including the Tetris Processor (0.1MB, 29201m cells), Caterpillar (2.5MB, 11m cells), Gemini (1.4MB, 846k cells), and Turing Machine (0.1MB, 252k cells).

If you encounter any bugs or have feedback, you can contact me at this email.

Click on the pattern name on the bottom left to get some information about the current pattern.

List of all patterns — Source code on Github — Report an issue

Controls:

        Left mouse          - Move around
        Right mouse         - Create / Delete cells
        Mouse wheel         - Zoom

        Arrow keys, HJKL    - Move around
        +, -                - Zoom
        Space               - One generation forward
        Tab                 - Many generations forward
        Enter               - Run/Pause
        Backspace           - Rewind
        ]                   - Faster
        [                   - Slower
        Escape              - Close Popups

1	«	»
F	+	–
↖	↑	↗
←	M	→
↙	↓	↘

Conway's Game of Life in JavaScript

Sorry, this applications needs JavaScript to work.

Import Pattern

Settings

Downloading pattern file