Claude's Cycles [pdf]
Summary
A detailed exploration of memoized and canonicalized recursive algorithms using quadtrees, illustrating how to divide, memoize, and re-use subresults to accelerate operations like rotation and averaging. The piece connects these techniques to hashlife and cellular automata, discusses edge handling and padding, and proposes generalizations to higher-order patterns for large-scale pattern evolution.