2018年6月1日
The fewest clues problem of picross 3D
Leibniz International Proceedings in Informatics, LIPIcs
- ,
- ,
- 巻
- 100
- 号
- 開始ページ
- 251
- 終了ページ
- 2513
- 記述言語
- 英語
- 掲載種別
- 研究論文(国際会議プロシーディングス)
- DOI
- 10.4230/LIPIcs.FUN.2018.25
- 出版者・発行元
- Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Picross 3D is a popular single-player puzzle video game for the Nintendo DS. It is a 3D variant of Nonogram, which is a popular pencil-and-paper puzzle. While Nonogram provides a rectangular grid of squares that must be filled in to create a picture, Picross 3D presents a rectangular parallelepiped (i.e., rectangular box) made of unit cubes, some of which must be removed to construct an image in three dimensions. Each row or column has at most one integer on it, and the integer indicates how many cubes in the corresponding 1D slice remain when the image is complete. It is shown by Kusano et al. that Picross 3D is NP-complete. We in this paper show that the fewest clues problem of Picross 3D is ΣP2 -complete and that the counting version and the another solution problem of Picross 3D are #P-complete and NP-complete, respectively.
- ID情報
-
- DOI : 10.4230/LIPIcs.FUN.2018.25
- ISSN : 1868-8969
- SCOPUS ID : 85048950116