Tiling complexity of small n-ominoes \((N<10)\) (Q1114701)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tiling complexity of small n-ominoes (N<10) |
scientific article; zbMATH DE number 4083648
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tiling complexity of small n-ominoes \((N<10)\) |
scientific article; zbMATH DE number 4083648 |
Statements
Tiling complexity of small n-ominoes \((N<10)\) (English)
0 references
1988
0 references
The author studies monohedral plane tilings by n-ominoes (polyominoes) for \(n<10\). He defines the complexity of a tile as the smallest number of congruent copies of the tile that are needed to form a patch which tiles by translation. A computer is used to calculate the complexity of n- ominoes for small n. Also examples of the different tiling types are given.
0 references
monohedral plane tilings
0 references
n-ominoes
0 references
polyominoes
0 references
0.8007313013076782
0 references
0.7736790776252747
0 references
0.7701635956764221
0 references
