Life, part 33

added by DotNetKicks
8/27/2020 5:17:24 PM

406 Views

Last time we learned about the fundamental (and only!) data structure in Gosper's algorithm: a complete quadtree, where every leaf is either alive or dead and every sub-tree is deduplicated by memoizing the static factory. Suppose we want to make this 2-quad, from the last episode: This is easy enough to construct recursively: Quad q...


0 comments