Conway's Game of Life

A classic cellular automaton, ported to Gno — board state lives on-chain.

Generation: 0 | Population: 5 | Board: 20×15

+--------------------+
|.O..................|
|..O.................|
|OOO.................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
|....................|
+--------------------+

Transactions

Call	Effect
Step()	Advance one generation
MultiStep(n)	Advance n generations (max 100)
SetCell(x, y, alive)	Flip a single cell
Reset(w, h)	Clear and resize (max 50×40)
LoadPreset(name)	glider · blinker · toad · beacon · block · pulsar

Rules

1. A live cell with 2 or 3 live neighbours survives.
2. A dead cell with exactly 3 live neighbours becomes alive.
3. All other cells die or remain dead.