|
|
On Fri, Feb 27, 2009 at 6:58 PM, Donny Viszneki
<donny.viszneki@xxxxxxxxx> wrote:
>> Also, I'm curious, what's a better way of doing the automata?
>> I haven't really done it before, aside from a very basic "Game of Life",
>> years
>> ago...
>
> Precalculating repeating patterns and indexing. It's possible that
> your CA does not have patterns that can precalculate. But maintaining
> an index to skip over empty space can help, though as I said above, I
> don't think it's your CA anymore.
>
> The most sophisticated Conway's Life implementation I saw would hash
> isolated chunks of the grid and store them in a b-tree index so that
> it could skip over empty space. When repeating patterns were revealed,
> it would store links alongside the chunk index so that it didn't have
> to recompute anything.
Yeah, hashlife, for the truly nutbar:
http://en.wikipedia.org/wiki/Hashlife
Bill Gosper is so awesome, it's beyond words.
--
http://pphaneuf.livejournal.com/
_______________________________________________
SDL mailing list
SDL@xxxxxxxxxxxxxxxx
http://lists.libsdl.org/listinfo.cgi/sdl-libsdl.org
|
|