Clumsy packing of dominoes
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.
scientific article; zbMATH DE number 4083646