Kris J. Gasteiger
16019 Partell Ct.
Bowie, MD 20716-1638

CIS User # 73637,2004

	This archive contains the following files:

	1: BLITSCRN.O ----> Object file of BLITSCRN.PAS.
	2: BLITSCRN.PAS --> Code for screen "blitter".
	3: CA_1_1.PAS -----> Code for Cellular Automata program.
	4: CA_1_1.PRG -----> The executable.
	5: GEMRAST.O -----> Object file needed by BLITSCRN.PAS.
	6: CELLAUT.TXT ---> This file.

	The program, CA_1_1.PRG, allows you to run a one dimensional
cellular automata. It is the only file needed, all the other files are for
the benefit of interested programmers. You can delete them if you don't
want them cluttering your disk.

    Feel free to share this program with friends, upload it or whatever.
I only ask for credit ( or blame! ) where due, and that you don't change
the contents of the archive without at least making a note of the changes
as an addition to this text file. Send me your changes if you want, I'd be
curious.

CAVEATS: This program runs on my systems (2.5M ST w TOS 1.4, and a Falcon),
I make no claims as to its suitability or utility on any other systems,
and am in no way to be held responsible for damages or liabilities from its
use, misuse, or abuse. That said, I do hope you find it amusing and 
educational...

( I sure hate to have to include that above paragraph, but seeing as how
this is the Garb-age, and we live in a nation of sue-ers, as members of the
effluent society, I figured I better cover my but this has gone on long
enough... )   ;-{)>

So...	What is a Cellular Automata?

	In a nut shell, it is a rule based, deterministic system.
This program runs a one dimensional automata of four states. Another kind
of cellular automata is represented by Conway's LIFE, which is two 
dimensional and two state.

	In this automata, the state of the next generation of a particular
cell is determined by it's own state, the states of it's immediate 
neighbors in the line, and the RULE. For example...

Sum of values of a cell and it's two neighbors:0 1 2 3 4 5 6 7 8 9
The RULE:......................................0 1 3 1 3 2 1 0 0 0
if the sum of a cell and it's two neighbors is 0 . . . it's next state is 0
if the sum of a cell and it's two neighbors is...1 . . it's next state is 1
if the sum of a cell and it's two neighbors is.....2 . it's next state is 3
if the sum of a cell and it's two neighbors is.......3 it's next state is 1
Etc.

Succeeding generations are displayed below the previous ones on the screen,
so the automata advances down the screen. When it reaches the bottom of
the screen, it will begin to scroll.)

	This very simple application of arithmetic can produce beautiful
and interesting patterns. Some patterns are cyclic, some chaotic, all are 
interesting.
	
	For more information on cellular automata, see the bibliography at
the end of this file.
	
	To run this program, you need to be in ST Low resolution. Then,
double click on the file CA_10.PRG.

	When the screen clears, there will be a GEM menu across the top of
the screen. Desk will give you a Blurb, Choices is for control and quitting.

	Under Choices are:

		Random: When checked, randomizes the initial state of the
			automata.

		Pre set: Lets you set the initial state of the automata.

		Set Rule: Lets you set the rule governing the automata.

		Run: Runs the automata. Try this for a default rule/random
		     init automata before you change the other settings.

		Quit: Quit and restore your screen colors.

	This is a fairly rudimentary program, it doesn't do screen redraws.
It won't restart in the middle of the screen, so if you stop it, you'll 
lose all the generations but the current one. I just never got around to
writing those parts in...

BIBLIOGRAPHY:
	1: BYTE, December 1986, Abstract Mathematical Art,
	   By Kenneth E. Perry

	2: ARTIFICIAL LIFE, 1992, pantheon books,
	   By Steven Levy

	3: THE RECURSIVE UNIVERSE, 1985, contemporary books,
	   By William Poundstone

	4: PERMUTATION CITY, 1995, harper prism,
	   By Greg Egan

	This is just a skimming of whats out there. These are written for
the layman, there is a lot of other stuff you'd need a better education
than I have to wade through!

	This program started as a translation to ST BASIC of the one in
BYTE, I later rewrote it in OSS/ICD Personal Pascal, and am currently
attempting to translate it to Lattice C and DSP assembler on the Falcon.
There are lots of other kinds of CA I'd like to implement once I get a 
handle on C...

	Why bother with cellular automata? Because they're fun!
If you have an interest in these things, and want to share ideas with a
madman, I mean layman, do write!

	Enjoy,

	Kris
	4/14/96
