Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!uwm.edu!rpi!image.soe.clarkson.edu!sunybcs!uhura.cc.rochester.edu!rochester!dietz
From: dietz@cs.rochester.edu (Paul Dietz)
Newsgroups: comp.theory.cell-automata
Subject: Re: Gosper's Algorithm for Life
Message-ID: <1990Jan15.222625.19716@cs.rochester.edu>
Date: 15 Jan 90 22:26:25 GMT
References: <1989Dec27.174849.13469@cs.rochester.edu> <1279@hamilton.maths.tcd.ie>
Reply-To: dietz@cs.rochester.edu (Paul Dietz)
Organization: University of Rochester Computer Science Department
Lines: 17

Thanks for the folks who sent me a copy of Lucas' C implementation
of Gosper's Hashlife algorithm.

I was wondering how good you could do with other algorithms.  I came
up with an implementation of an algorithm on my Sparcstation 1 that
does all 1103 generations of the R-pentomino, including the gliders,
in 1.3 seconds (no display), and runs

	o.....o.
	..o...o.
	..o..o.o
	.o.o....

(a pattern by Wainright recommended to me by Gosper) out to 10,000
generations in 45 seconds (again, without display).

	Paul