Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2018.25
URN: urn:nbn:de:0030-drops-88168
URL: https://drops.dagstuhl.de/opus/volltexte/2018/8816/
Kimura, Kei ; Kamehashi, Takuya ; Fujito, Toshihiro
The Fewest Clues Problem of Picross 3D
| pdf-format: |
|
Abstract
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 Sigma_2^P-complete and that the counting version and the another solution problem of Picross 3D are #P-complete and NP-complete, respectively.
BibTeX - Entry
@InProceedings{kimura_et_al:LIPIcs:2018:8816,
author = {Kei Kimura and Takuya Kamehashi and Toshihiro Fujito},
title = {{The Fewest Clues Problem of Picross 3D}},
booktitle = {9th International Conference on Fun with Algorithms (FUN 2018)},
pages = {25:1--25:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-067-5},
ISSN = {1868-8969},
year = {2018},
volume = {100},
editor = {Hiro Ito and Stefano Leonardi and Linda Pagli and Giuseppe Prencipe},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/8816},
URN = {urn:nbn:de:0030-drops-88168},
doi = {10.4230/LIPIcs.FUN.2018.25},
annote = {Keywords: Puzzle, computational complexity, fewest clues problem}
}
| Keywords: | Puzzle, computational complexity, fewest clues problem | |
| Seminar: | 9th International Conference on Fun with Algorithms (FUN 2018) | |
| Issue date: | 2018 | |
| Date of publication: | 04.06.2018 |
