4 ms·
How are these huge “maps” of game of life simulated at these speeds anyway
by tobyhinloopen 5y ago
How are these huge “maps” of game of life simulated at these speeds anyway
- ColinWright 5y agoIt uses "Golly": http://golly.sourceforge.net/ http://golly.sourceforge.net/
- Doxin 5y agoA quadtree, where every node is first looked up in a hash table before simulating it. Eventually the hash table has enough entries to where most changes aren't even simulated but just looked up. It's a pretty plain CPU/memory tradeoff, but it works surprisingly well for game of life.
- tobyhinloopen 5y agohttps://en.m.wikipedia.org/wiki/Hashlife https://en.m.wikipedia.org/wiki/Hashlife Nice