D. Hugh Redelmeier developed an enumeration algorithm for polyominoes. It grows connected collections of lattice squares while carrying a controlled set of candidate additions and inherited exclusions. This avoids reaching the same fixed polyomino through multiple growth histories, allowing exact counting without storing every smaller shape as a separate comparison object.[ref]
New to topics? Read the docs here!