Counting Polyominoes, Revisited
preprint
OA: closed
Abstract
Abstract A polyomino is an edge-connected set of squares on the square lattice. In this paper, we improve Jensen's algorithm for counting polyominoes by considering bounding boxes on the square lattice rotated by 45o instead of on the regular unrotated lattice. This allows us to extend significantly the count of polyominoes from 56 to 70 terms.
My notes (saved in your browser only)
Citation neighborhood (no data yet)
We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2024) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.
Source provenance
- europepmc
- last seen: 2026-05-20T01:45:00.602351+00:00