Tiling complexity of small n-ominoes \((N<10)\) (Q1114701): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Removed claim: reviewed by (P1447): Item:Q331377 |
||
| Property / reviewed by | |||
| Property / reviewed by: Egon Schulte / rank | |||
Revision as of 13:28, 13 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Tiling complexity of small n-ominoes \((N<10)\) |
scientific article |
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
