A procedure for improving the upper bound for the number of n-ominoes
Auteur : Stanford University. Computer Science Department, David A. Klarner, Ronald L. Rivest
Date de publication : 1972
Éditeur : Computer Science Department, Stanford University
Nombre de pages : 33
Résumé du livre
An n-omino is a plane figure composed of n unit squares joined together along their edges. Every n-omino is generated by joining the edge of a unit square to the edge of a unit square in some (n-1)-omino so that the new square does not overlap any squares. Let t(n) denote the number of n-ominoes, then it is known that the sequence ((t(n)) (sup 1/n); n = 1,2 ...) increases to a limit theta, and 3.72