Newsgroups: comp.ai.alife
From: Chris@smithg.demon.co.uk (Chris Gordon-Smith)
Path: cantaloupe.srv.cs.cmu.edu!das-news2.harvard.edu!news2.near.net!howland.reston.ans.net!news.sprintlink.net!pipex!peernews.demon.co.uk!smithg.demon.co.uk!Chris
Subject: Re: Life 1.06
References: <Ben.51.000B7BFD@ins.netins.net>
Reply-To: Chris@smithg.demon.co.uk
X-Newsreader: Demon Internet Simple News v1.29
Lines: 20
X-Posting-Host: smithg.demon.co.uk
Date: Thu, 6 Apr 1995 22:15:22 +0000
Message-ID: <797206522snz@smithg.demon.co.uk>
Sender: usenet@demon.co.uk

In article <Ben.51.000B7BFD@ins.netins.net>
           Ben@ins.netins.net "Ben Sinclair" writes:

> All I can say is... Wow! I want to know what type of data structure they used 
> to have such a HUGE world! It's a great program!

Yes indeed. I expect it stores a list of active cells/areas and ignores 'dead' 
cells. There has been an interesting dialogue recently in 
comp.theory.cell-automata (under a thread called 'Life') about optimisation of 
Life programs. A couple of algorithms were posted showing how you can process 
many cells at a time (on a single processor computer) by loading the states of 
32 cells into a 32 bit word so that all 32 cells are processed by the same 
instruction.

Regards
-- 
Chris Gordon-Smith
London
UK
Email: chris@smithg.demon.co.uk
