WOLFRAM

Patterns of surprising complexity, generated by a rule that fits in eight bits.

Wolfram's cellular automata start from a line of black or white cells and a very simple rule: a cell's colour at the next step depends only on itself and its two neighbours. Some of those rules produce patterns of astonishing richness, sometimes even chaotic. All of it written in Haskell, a language with no mutable variables and no loops.

A Haskell implementation of Wolfram's elementary cellular automaton (rules 30, 90 and 110), with configurable starting generation, line count, window width and display offset.