On the Minimum Number of Pieces for Two-Dimensional Anti-Slide Using T-Tetrominoes
-
- KIMURA Kento
- School of Science and Technology, Gunma University
-
- AMANO Kazuyuki
- School of Science and Technology, Gunma University
-
- ARAKI Tetsuya
- School of Science and Technology, Gunma University
抄録
<p>Given a box of some specified size and a number of pieces of some specified shape, the anti-slide problem considers how to pack the pieces such that none of the pieces in the box can slide in any direction. The object is to find such a sparsest packing. In this paper, we consider the problem for the case of a two-dimensional square box using T-tetromino pieces. We show that, for a square box of side length n, the number of pieces in a sparsest packing is exactly $\lfloor 2n/3 \rfloor$ when n≢0 (mod 3), and is between 2n/3-1 and n-1 when n≡0 (mod 3).</p>
収録刊行物
-
- IEICE Transactions on Information and Systems
-
IEICE Transactions on Information and Systems E104.D (3), 355-361, 2021-03-01
一般社団法人 電子情報通信学会
- Tweet
詳細情報 詳細情報について
-
- CRID
- 1390005822570109824
-
- NII論文ID
- 130007993186
-
- ISSN
- 17451361
- 09168532
-
- 本文言語コード
- en
-
- データソース種別
-
- JaLC
- Crossref
- CiNii Articles
- KAKEN
-
- 抄録ライセンスフラグ
- 使用不可