|
|
|
|
# cellular-automaton
|
|
|
|
|
This is an implementation of 256 elementary cellular automatons: http://mathworld.wolfram.com/ElementaryCellularAutomaton.html
|
|
|
|
|
|
|
|
|
|
Example usage and output for rule 30:
|
|
|
|
|
```
|
|
|
|
|
./cellaut.pl 10 30 30
|
|
|
|
|
111111111111110111111111111111
|
|
|
|
|
111111111111100011111111111111
|
|
|
|
|
111111111111001101111111111111
|
|
|
|
|
111111111110010000111111111111
|
|
|
|
|
111111111100110111011111111111
|
|
|
|
|
111111111001000010001111111111
|
|
|
|
|
111111110011011110110111111111
|
|
|
|
|
111111100100001100000011111111
|
|
|
|
|
111111001101110001111101111111
|
|
|
|
|
111110010000100110111000111111
|
|
|
|
|
111100110111101000010011011111
|
|
|
|
|
```
|
|
|
|
|
Example usage and output for rule 110:
|
|
|
|
|
```
|
|
|
|
|
./cellaut.pl 10 30 110
|
|
|
|
|
111111111111110111111111111111
|
|
|
|
|
111111111111100111111111111111
|
|
|
|
|
111111111111000111111111111111
|
|
|
|
|
111111111110010111111111111111
|
|
|
|
|
111111111100000111111111111111
|
|
|
|
|
111111111001110111111111111111
|
|
|
|
|
111111110001100111111111111111
|
|
|
|
|
111111100101000111111111111111
|
|
|
|
|
111111000000010111111111111111
|
|
|
|
|
111110011111000111111111111111
|
|
|
|
|
111100011110010111111111111111
|
|
|
|
|
```
|
