Simulating Infinity in Conway’s Game of Life with Modern C++
Summary
A technical deep-dive into building GOLDE, a high-performance Conway’s Game of Life simulator in modern C++23. It explains HashLife’s memoized quadtree approach, a 65,536-entry base-case lookup, a memory-efficient LifeNodeArena allocator, and topology abstractions to support toroidal grids, multithreading, and safe stop handling with std::jthread and stop tokens.