If you want I can host it on codepsycho.org -- PM me and I'll PM you back an email address to send it to, and I'll put it up.
So, your grid basically holds pointers to the cells in the linked list? That is conceptually similar to how my version works (fast iteration over active cells + quick lookup of neighbors), except that the list and the grid are both represented in a single data structure (hash table).I went with a combination of a specialized linked list for the live cells, and a malloc'd "2-d array" for fast neighbor access. It tries to limit the amount of memory malloc'd at any given time for the array by incrementally malloc'ing only as the pattern grows
Sounds cool.