home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.theory.cell-automata
- Path: sparky!uunet!mnemosyne.cs.du.edu!nyx!eeklund
- From: eeklund@nyx.cs.du.edu (Eivind Eklund)
- Subject: Re: Symmetric Life rules
- Message-ID: <1992Nov18.191744.16470@mnemosyne.cs.du.edu>
- X-Disclaimer: Nyx is a public access Unix system run by the University
- of Denver for the Denver community. The University has neither
- control over nor responsibility for the opinions of users.
- Sender: usenet@mnemosyne.cs.du.edu (netnews admin account)
- Organization: Nyx, Public Access Unix at U. of Denver Math/CS dept.
- References: <1992Nov17.122445.14209@odin.diku.dk>
- Date: Wed, 18 Nov 92 19:17:44 GMT
- Lines: 31
-
- In article <1992Nov17.122445.14209@odin.diku.dk> torbenm@diku.dk (Torben AEgidius Mogensen) writes:
- [...]
- >I have found such a set of rules and carried out some experiments with
- >these. The rules are also interesting in that the central cell in the
- >3x3 neighbourhood counts the same as the other cells.
-
- Well, that is just another way of writing rules. Conrad's Gam of Life can
- be written like this:
-
- 0 .
- 1 .
- 2 .
- 3 O
- 4 O (If set)
- 5 .
- 6 .
- 7 .
- 8 .
- 9 .
-
- And this is also nice for doing FAST implementations - see if you can find
- out how... (This might be common knowledge allready, but I have a hack
- which
- I believe to be VERY fast - somebody tell me how many cells/second they
- are able to do on what kinds of computers 8-)
- I am able to do approx 1.3 million cells/second on a 1 MIPS Amiga.
- (7.14 Mhz 68000)
-
- Eivind Eklund AKA Vishnu CRB
- eeklund@nyx.cs.du.edu or phone +47-(0)-9-944946 (BBS, shout to get ME)
-
-