Clumsy packing of dominoes (Q1114697): 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 | Clumsy packing of dominoes |
scientific article |
Statements
Clumsy packing of dominoes (English)
0 references
1988
0 references
Assume dominoes are placed on an \(n\times n\) chessboard. If there is no room for further dominoes, the board is said to be full. The authors discuss the problem of finding the minimum number d(n) of dominoes lying on a full \(n\times n\) board. It is proved that \(d(n)=n^ 3/3\) if \(3| n\), and \(n^ 2/3+n/111<d(n)<n^ 2/3+n/12+1\) if n is large and \(3\nmid n\). Also similar problems are investigated for triangulated and hexa boards.
0 references
dominoes
0 references
chessboard
0 references