
This is an example of a simple 2D cellular automata.


Introduction
------------

  Given two complex numbers the program will iterate
forever (well... as long as your batteries hold on :-)
and show the journeys of an "ant" on your screen.

  If you'll wait long enough you'll get a nice surprise.
It seems this ant is not your ordinary ant, it can build
"highways"...

  This highway is the representation of the fact
that the trajectory of the ant is unbounded. This means
that the Ant will travel to infinity no matter what are
the initial conditions. This has been proven mathematically.


Running the program
-------------------
  The program should be saved under the var. 'ant'.
It needs as initial input two complex numbers (a,b)
and (c,d). (a,b) represents the stepsize and the initail
direction. One should notice that absolute value of this
number should be greater then zero, or else the ant will
not move. (c,d) represent the starting point of the ant
in the complex plane. Good initial values are
(a,b) = (0, 0.1) and (c,d) = (0,0)
which are optimal for the standard display size of 131x64.

  You may want to try different grobs in PICT
and see what happens....

--

I hope you'll enjoy it as I did...

E.D. Rivlis - erivlis@pob.huji.ac.il


BTW - I included the binary program file as an attachment,
it can be used in Emu48 or your HP48.



 -> D P
   PICT RCL ->LCD D P
    IF P PIX?
    THEN PIXOFF (0,1)
    ELSE PIXON (0,-1)
    END * P OVER + ant
  
