Complexity of Tiling a Polygon with Trominoes or Bars
- 182 Downloads
We study the computational hardness of the tiling puzzle with polyominoes, where a polyomino is a right-angled polygon (i.e., a polygon made by connecting unit squares along their edges). In the tiling problem, we are given a right-angled polygon P and a set S of polyominoes, and asked whether P can be covered without any overlap using translated copies of polyominoes in S. In this paper, we focus on trominoes and bars as polyominoes; a tromino is a polyomino consisting of three unit squares, and a bar is a rectangle of either height one or width one. Notice that there are essentially two shapes of trominoes, that is, I-shape (i.e., a bar) and L-shape. We consider the tiling problem when restricted to only L-shape trominoes, only I-shape trominoes, both L-shape and I-shape trominoes, or only two bars. In this paper, we prove that the tiling problem remains NP-complete even for such restricted sets of polyominoes. All reductions are carefully designed so that we can also prove the # P-completeness and ASP-completeness of the counting and the another-solution-problem variants, respectively. Our results answer two open questions proposed by Moore and Robson (Discrete Comput Geom 26:573–590, 2001) and Pak and Yang (J Comb Theory 120:1804–1816, 2013).
KeywordsTiling problem Polyominoes NP-complete # P-complete ASP-complete
Mathematics Subject Classification52C15 68Q17
We are grateful to Yoshio Okamoto for his fruitful suggestions, and thank anonymous referees of the preliminary version and of this journal version for their helpful suggestions. This work is partially supported by MEXT/JSPS KAKENHI Grant Numbers JP15K00008 and JP24106007 (T. Horiyama), JP15H00849 and JP16K00004 (T. Ito), JP26730001 (A. Suzuki), and JP26330009 and JP24106004 (R. Uehara).
- 3.El-Khechen, D., Dulieu, M., Iacono, J., van Omme, N.: Packing \(2\times 2\) unit squares into grid polygons is NP-complete. In: Proceedings of the 21st Canadian Conference on Computational Geometry (CCCG 2009), pp. 33–36 (2009). http://cccg.ca/proceedings/2009/cccg09_09.pdf
- 7.Horiyama, T., Ito, T., Nakatsuka, K., Suzuki, A., Uehara, R.: Packing trominoes is NP-complete, #P-complete and ASP-complete. In: Proceedings of the 24th Canadian Conference on Computational Geometry (CCCG 2012), pp. 211–216 (2012). http://2012.cccg.ca/e-proceedings.pdf
- 8.Kenyon, C., Kenyon, R.W.: Tiling a polygon with rectangles. In: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS 1992), pp. 610–619. IEEE, Piscataway (1992)Google Scholar
- 14.Schaefer, T.J.: The complexity of satisfiability problems. In: Proceedings of the 10th Annual ACM Symposium on Theory of Computing (STOC’78), pp. 216–226. ACM, New York (1978)Google Scholar
- 15.Yato, T., Seta, T.: Complexity and completeness of finding another solution and its application to puzzles. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E86–A(5), 1052–1060 (2003)Google Scholar