Counting polyominoes: Yet another attack

84Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

A polyomino is a connected collection of squares on an unbounded chessboard. There is no known formula yielding the number of distinct polyominoes of a given number of squares A polyomino enumeration method, faster than any previous, is presented. This method includes the calculation of the number of symmetric polyominoes. All polyominoes containing up to 24 squares have been enumerated (using ten months of computer time). Previously, only polyominoes up to size 18 were enumerated. © 1981.

Cite

CITATION STYLE

APA

Redelmeier, D. H. (1981). Counting polyominoes: Yet another attack. Discrete Mathematics, 36(2), 191–203. https://doi.org/10.1016/0012-365X(81)90237-5

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free