What is it?

Conway's Game of Life is a cellular automaton — a grid of cells that live, die, and reproduce based on simple rules. Despite its simplicity, it can produce astonishingly complex behavior, from gliders to oscillators to Turing-complete computers.

In this cipher, you're given a 6×6 initial pattern. You simulate N generations of the Game of Life. Each row of the final grid is read as a 6-bit binary number (live=1, dead=0). That number mod 26 gives a letter. The 6 rows produce a 6-letter word.

Concrete Example

Here's a worked example with a small 3×3 grid to illustrate the rules:

Initial pattern:

Row 0: ● ○ ○   (1 0 0)
Row 1: ● ● ○   (1 1 0)
Row 2: ● ○ ●   (1 0 1)

Step 1: Apply Conway's rules to each cell.

Cell (0,0) is alive. It has 2 neighbors (right and below) → survives.
Cell (0,1) is dead. It has 3 neighbors (left, below-left, below) → becomes alive!
Cell (0,2) is dead. It has 1 neighbor → stays dead.
Cell (1,0) is alive. 2 neighbors → survives.
Cell (1,1) is alive. 4 neighbors → overcrowded, dies.
Cell (1,2) is dead. 2 neighbors → stays dead.
Cell (2,0) is alive. 2 neighbors → survives.
Cell (2,1) is dead. 3 neighbors → becomes alive!
Cell (2,2) is alive. 1 neighbor → dies.

After 1 generation:

Row 0: ● ● ○   (1 1 0)
Row 1: ● ○ ○   (1 0 0)
Row 2: ● ● ○   (1 1 0)

Each row as binary (6-bit in 6×6 grid, but for this small example):
Row 0: 110 → 6 → G
Row 1: 100 → 4 → E
Row 2: 110 → 6 → G

The answer from this 3×3 would be "GEG". In the real puzzle, it's a 6×6 grid producing a 6-letter word.

Why It Works

Conway's Game of Life is deterministic — given the same initial state and rules, the evolution is always the same. By choosing an initial pattern that evolves into a specific final arrangement after N generations, we can encode any 6-letter word into the final grid. The mapping from binary rows to letters is straightforward, and the cellular automaton rules are simple enough to simulate by hand or with a short program.

Solving Tips

• Rules: a live cell with 2-3 neighbors survives; a dead cell with exactly 3 neighbors becomes alive
• All other cells die or stay dead
• Simulate all N generations step by step
• After N generations, read each row left-to-right as 6-bit binary (live=1, dead=0)
• Convert each 6-bit value to decimal, mod 26, map to letter (A=0)

Real-World Applications

• Computational theory: The Game of Life is Turing-complete — it can simulate any computer, given enough space and time
• Pattern formation: Biologists study cellular automata to model morphogenesis, pattern formation in seashells, and tissue growth
• Cryptography: Cellular automata have been used for stream ciphers and random number generation
• Physics simulation: Lattice gas automata (a cousin of Life) can simulate fluid dynamics without solving Navier-Stokes equations
• Art: Life patterns are a form of generative art — gliders, spaceships, and oscillators are beautiful in their own right