One-dimensional cellular automata: Difference between revisions
One-dimensional cellular automata (view source)
Revision as of 03:02, 25 December 2013
, 10 years ago→{{header|Perl 6}}: slightly shorter + joining output
(→{{header|D}}: Add Déjà Vu example) |
(→{{header|Perl 6}}: slightly shorter + joining output) |
||
Line 2,360:
=={{header|Perl 6}}==
{{works with|Rakudo Star|
Short though it is, this solution even detects stability. Z+ is a zip metaop with addition,
and X== is a cross metaop with equality. (Crossing with a scalar always producing a list of the same length.) We have taken the slight liberty of defining a wraparound universe, but it doesn't matter for this example.
<lang perl6>my @c = <_ #>;
my @array = '_###_##_#_#_#_#__#__'.comb
repeat until @array eqv my @prev {
say @c[@prev = @array].join;
@array = ((@array Z+ @array.rotate(1)) Z+ @array.rotate(-1)) X== 2;
}</lang>
| |||