SK>If you're interested in the specific rules, let me know. I'll look
SK>them up and post them here.
RM> I think that would help me envision the task to a better
RM> extent, thanks...
SK>OK, here they are:
SK>1. Every empty cell with three living neighbors wil come to life in the
SK>next generation.
SK>2. Any cell with one or zero neighbors wil die of loneliness, while any
SK>cell with four or more neighbors will die from overcrowding.
SK>3. Any cell with two or three neighbors will live into the next
SK>generation.
SK>4. All births and deaths occur simulatneously.
SK>So, for example, imagine the grid we are playing on is 8x8 and a living
SK>cell is denoted with X and an empty cell is denoted with 0. The starting
SK>grid is given as follows:
SK>X00X0X00                                  00000XX0
SK>0000XX0X                                  0XOXOX00
SK>X0X00X00                                  00X00XX0
SK>0XX0X000    Then the next generation      00X0X000
SK>00X00XXX    would be this:                00X0XXXX
SK>0X00X00X                                  00000X0X
SK>00000000                                  00000000
SK>X00000X0                                  00000000
Ok...  I wasn't getting this at first, I was making it
recursive and therefore more complicated...  The unspoken
rule: "No cell can come to life if it has 4 neighbors", was
escaping me... I figured it didn't matter how many neighbors
it HAD, only how many there were when it came to life...
For example, the 5th symbol in the first row is surrounded
by 4 X's, but by the time it comes to life, it would be
surrounded by only 3 X's (and therefore "legal")...  The
simultaneity of events refers to EACH symbol as they are
processed one at a time, not ALL symbols processed at the
same time....
SK>Hope this helps!
I think so?!       ;-)
___
 * MR/2 2.26 * I went window shopping...and bought OS/2 WARP!
--- Silver Xpress Mail System 5.4P1a
---------------