ABSTRACT

A polyomino is a finite, connected subgraph of the square-grid graph consisting of infinitely many unit cells matched edge-to-edge, with pairs of adjacent cells forming edges of the graph. Polyominoes have a long history, going back to the start of the 20th century, but they were popularized in the present era initially by Solomon Golomb, then by Martin Gardner in his Scientific American columns “Mathematical Games,” and finally by many research papers by David Klarner. They now constitute one of the most popular subjects in mathematical recreations, and have found interest among mathematicians, physicists, biologists, and computer scientists as well.