 |
Chris Langton's self-producing loops
David Bagley.
1996
History 01-Nov-2000: Allocation checks
16-Jun-2000: Fully coded the hexagonal rules. (Rules that end up in
state zero were not bothered with since a calloc was used
to set non-explicit rules to zero. This allows the
compile-time option RAND_RULES to work here (at least to
generation 540).)
Also added compile-time option DELAYDEBUGLOOP for debugging
life form. This also turns off the random initial direction
of the loop. Set DELAYDEBUGLOOP to be 10 and use with
something like this:
xlock -mode loop -neighbors 6 -size 5 -delay 1 -count 540 -nolock
18-Oct-1998: Started creating a hexagon version.
It proved not that difficult because I used Langton's Loop
as a guide, hexagon have more neighbors so there is more
freedom to program, and the loop will has six sides to
store its genes (data).
(Soon after this a triangular version with neighbors = 6 but
was unsuccessful).
10-May-1997: Compatible with xscreensaver
15-Nov-1995: Coded from Chris Langton's Self-Reproduction in Cellular
Automata Physica 10D 135-144 1984, also used wire.c as a
guide.
|
|
|
|
