1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
|
<html>
<title>Golly Help: QuickLife</title>
<body bgcolor="#FFFFCE">
<p>
QuickLife is a fast, conventional (non-hashing) algorithm for
exploring Life and other 2D outer-totalistic rules.
Such rules are defined using "B0...8/S0...8" notation, where
the digits after B specify the counts of live neighbors necessary
for a cell to be born in the next generation, and the digits
after S specify the counts of live neighbors necessary for a
cell to survive to the next generation.
Here are some example rules:
<p><b><a href="rule:B3/S23">B3/S23</a></b> [Life]<br>
John Conway's rule is by far the best known and most explored CA.
<p><b><a href="rule:B36/S23">B36/S23</a></b> [HighLife]<br>
Very similar to Conway's Life but with an interesting replicator.
<p><b><a href="rule:B3678/S34678">B3678/S34678</a></b> [Day & Night]<br>
Dead cells in a sea of live cells behave the same as live cells
in a sea of dead cells.
<p><b><a href="rule:B35678/S5678">B35678/S5678</a></b> [Diamoeba]<br>
Creates diamond-shaped blobs with unpredictable behavior.
<p><b><a href="rule:B2">B2</a></b> [Seeds]<br>
Every living cell dies every generation, but most patterns still explode.
<p><b><a href="rule:B234">B234</a></b> [Serviettes or Persian Rug]<br>
A single 2x2 block turns into a set of Persian rugs.
<p><b><a href="rule:B345/S5">B345/S5</a></b> [LongLife]<br>
Oscillators with extremely long periods can occur quite naturally.
<p>
QuickLife also supports Stephen Wolfram's 1D CA rules.
These rules are specified as "Wn" where n is an even number from
0 to 254. For example:
<p><b><a href="rule:W22">W22</a></b><br>
A single live cell creates a beautiful fractal pattern.
<p><b><a href="rule:W30">W30</a></b><br>
Highly chaotic and an excellent random number generator.
<p><b><a href="rule:W110">W110</a></b><br>
Matthew Cook proved that this rule is capable of universal computation.
</body>
</html>
|
