← Home

A few Interesting Patterns of Conway's Game of Life

Simple rules, emergent complexity

Date: January 31, 2026 |

Gosper Gun

Conway’s Game of Life is a cellular automaton with simple rules. It is Turing-complete, demonstrating that universal computation emerges from simple local rules rather than being explicitly encoded in them.

Conway’s Game of Life was created by mathematician John Horton Conway in 1970. Published in Scientific American, it became one of the most famous examples of cellular automata.

Code generated with AI coding assistant.