Rule 110
Details
Print the first 100 rows in the Rule 110 cellular automaton starting from an initial single living cell.
Each new row in the life of the automaton should be a new line, and the rules for whether a cell is alive or dead depends on whether is was alive on the previous iteration, as well as the state of the two neighbouring cells. The rules which dictate whether a cell is alive or dead in the next iteration are as follows:
Previous cells | New centre cell |
---|---|
111 | 0 |
110 | 1 |
101 | 1 |
100 | 0 |
011 | 1 |
010 | 1 |
001 | 1 |
000 | 0 |
The first 10 rows are shown here:
â ââ âââ ââ â âââââ ââ â âââ ââ ââ â âââ âââââââ â ââ âââ
0 characters
Top-level programs are supported, args holds ARGV.
ARGV is available via STDIN, joined on NULL. x is a no-op.
arguments holds ARGV, print() to output with a newline,
write() to output without a newline.
say() is available without any import.
SELECT arg FROM argv to access the arguments, only the first
column of the first result set will be printed, NULL values will be
skipped, and the dialect is SQLite.
ctrl + enter
or
Run