This is a simple Cellular Automata implementation in haskell done in a one-day rush.
It is based on the Wolfram's elementary cellular automata.
./wolfram --rule <rule> (flags)
Flags:
--rule <rule> : The rule to use (30|90|110)
--start <start> : The initial state of the automata (default:0)
--lines <lines> : The number of lines to print (default:infinity)
--window <win> : The window size (default:80)
--move <move> : The offset of the window (default:0)
The rules are based on the Wolfram's elementary cellular automata. The rules are:
- 30
- 90
- 110
./wolfram-exe --rule 90 --lines 150 --window 350
make