Simulating Infinity in Conway's Game of Life with Modern C++
30 points
2 days ago
| 4 comments
| ryanjk5.github.io
| HN
eps
17 minutes ago
[-]
Small nit, this - https://ryanjk5.github.io/assets/2026-05-14-GOLDE/torus.gif - is not what's conventionally referred to as a torus in CGoL. In torus left and right edges are also connected.
reply
hiroakiaizawa
19 minutes ago
[-]
Interesting approach. I like that the implementation focuses on scalability rather than only visualization.
reply
jdw64
2 hours ago
[-]
It seems like the thread_local CacheIndex only determines which cache to use, but it doesn't actually guarantee thread safety for concurrent access to the HashLifeCache itself. What would be a good solution for this?

Should I use a mutex for each cache instance? As a beginner developer, my guess is that the original author assumes data races won't occur based on the execution timing. However, I'm really not sure if that assumption is actually correct/safe.

reply
classified
1 hour ago
[-]
Fricking cool, I love it.
reply