Re: A86: Re: game of life

To: assembly-86@lists.ticalc.org
Subject: Re: A86: Re: game of life
From: rabidcow@juno.com
Date: Sun, 3 Sep 2000 18:17:08 -0700
Reply-To: assembly-86@lists.ticalc.org

yeah, but i do it with logical operators instead of a straight compare
at least i think that's what i use, it's been a while since i wrote that
part of the code.  it uses the standard rules, whatever they are.

that's: [new cell value] = not ( [neighbor count bit 2] and  [neighbor
count bit 1] and ( [neighbor count bit 0] or [old cell value] ) )

-josh

On Sun, 3 Sep 2000 18:42:27 -0600 "David Phillips" <david@acz.org>
writes:
> 
> Nice :)
> 
> Are you using these rules?
> 
> 0 - 1: cell dies
> 2: cell lives
> 3: cell is born (lives if exists)
> 4 - 8: cell dies
> 
> > in case, by some freak chance, anyone cares about this, the 
> absolute
> > fastest a full-screen game of life implementation on the ti-86 
> could run
> > is about 6.5 frames per second.
> > 
> > i've got it down to ~953000 clocks for one screen update, that's 
> ~116
> > clocks per pixel.
> > with a 6mhz clock, that's ~6.3 frames/sec 
> > 
> > just a few useless statistics!
> 
> 
> 
> 

________________________________________________________________
YOU'RE PAYING TOO MUCH FOR THE INTERNET!
Juno now offers FREE Internet Access!
Try it today - there's no risk!  For your FREE software, visit:
http://dl.www.juno.com/get/tagj.