Please in order to save solutions and appear on the leaderboards.

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 it 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 cellsNew centre cell
1110
1101
1011
1000
0111
0101
0011
0000
where 1 is alive, 0 is dead, and the middle digit represents the previous state of the current cell.

The first 10 rows are shown here:

         █
        ██
       ███
      ██ █
     █████
    ██   █
   ███  ██
  ██ █ ███
 ███████ █
██     ███
0 bytes, 0 chars
Restore solution
All
Compiled from AT&T syntax to x86-64 Linux. Use syscalls to write output.
ctrl + enter or

Delete Solution

Are you sure you want to delete your solution(s) for Rule 110?

If you have seperate bytes and chars solutions then both will be deleted.

This is irreversible, please backup any code you care about.

Type I understand and press confirm to continue.