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
Every polyomino is a winner in the weak achievement game on a rectangular infinite board with large ...
Includes bibliographical references (leaf 46)This thesis is developed from the following problem: De...
Tiks izpētītas dažādas polimino iepakošanas problēmas, to atrisināmība un sarežģītība. Tiks piedāvāt...
AbstractA polyomino is a connected collection of squares on an unbounded chessboard. There is no kno...
AbstractRecently I. Jensen published a novel transfer-matrix algorithm for computing the number of p...
Abstractd-dimensional polycubes are the generalization of planar polyominoes to higher dimensions. T...
A polyomino (or animal) is an edge-connected set of squares on the regular square lattice. Enumerati...
. Lin and Chang gave a generating function for the number of convex polyominoes with an m+1byn+ 1 mi...
Beginning with a transfer matrix method used by R. C. Read to find the number of all polyominoes wit...
Abstract. The exact enumeration of most interesting combinatorial problems has exponential computati...
We improve the lower bounds on Klarner's constant, which describes the exponential growth rate of th...
AbstractA new generating function enumerating column-convex polyominoes is defined and determined. T...
AbstractThe goal of this paper is to propose a method to construct exact expressions and generating ...
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regul...
AbstractIn this paper, the use of algebraic languages theory in solving an open problem in combinato...
Every polyomino is a winner in the weak achievement game on a rectangular infinite board with large ...
Includes bibliographical references (leaf 46)This thesis is developed from the following problem: De...
Tiks izpētītas dažādas polimino iepakošanas problēmas, to atrisināmība un sarežģītība. Tiks piedāvāt...
AbstractA polyomino is a connected collection of squares on an unbounded chessboard. There is no kno...
AbstractRecently I. Jensen published a novel transfer-matrix algorithm for computing the number of p...
Abstractd-dimensional polycubes are the generalization of planar polyominoes to higher dimensions. T...
A polyomino (or animal) is an edge-connected set of squares on the regular square lattice. Enumerati...
. Lin and Chang gave a generating function for the number of convex polyominoes with an m+1byn+ 1 mi...
Beginning with a transfer matrix method used by R. C. Read to find the number of all polyominoes wit...
Abstract. The exact enumeration of most interesting combinatorial problems has exponential computati...
We improve the lower bounds on Klarner's constant, which describes the exponential growth rate of th...
AbstractA new generating function enumerating column-convex polyominoes is defined and determined. T...
AbstractThe goal of this paper is to propose a method to construct exact expressions and generating ...
As a generalization of polyominoes we consider edge-to-edge connected nonoverlapping unions of regul...
AbstractIn this paper, the use of algebraic languages theory in solving an open problem in combinato...
Every polyomino is a winner in the weak achievement game on a rectangular infinite board with large ...
Includes bibliographical references (leaf 46)This thesis is developed from the following problem: De...
Tiks izpētītas dažādas polimino iepakošanas problēmas, to atrisināmība un sarežģītība. Tiks piedāvāt...