At 08:44 AM 1/11/2002 +0100, Sebastian Bergmann wrote: >Dan Sugalski wrote: > > Okay, I've abused examples/assembly/life.pasm to be a benchmark > > program. It now will time generations/sec, and does rather more than > > mops.pasm does. > > Where can I find implementations of this algorithm in other languages, > for instance for Perl 5, Python, Ruby, ..?
Good question. I stole it from Damian's SelfGOL program, but I know that's not up for a benchmark. Basically the program takes a 15x15 board and plays Life on it. Standard rules apply--dead cells with 3 neighbors spring to life, live cells with <2 or >3 neighbors die. It's a torroidal board, which is the only real funky part. (It made doing it possible with what was available at the time) Dan --------------------------------------"it's like this"------------------- Dan Sugalski even samurai [EMAIL PROTECTED] have teddy bears and even teddy bears get drunk