IEICE TRANSACTIONS on Fundamentals
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete
Summary :
Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E105-A No.9 pp.1187-1194
- Publication Date
- 2022/09/01
- Publicized
- 2022/03/01
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2021DMP0006
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- Algorithms and Data Structures
Authors
Chuzo IWAMOTO
Hiroshima University
Tatsuya IDE
Hiroshima University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Chuzo IWAMOTO, Tatsuya IDE, "Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete" in IEICE TRANSACTIONS on Fundamentals,
vol. E105-A, no. 9, pp. 1187-1194, September 2022, doi: 10.1587/transfun.2021DMP0006.
Abstract: Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.2021DMP0006/_p
Copy
@ARTICLE{e105-a_9_1187,
author={Chuzo IWAMOTO, Tatsuya IDE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete},
year={2022},
volume={E105-A},
number={9},
pages={1187-1194},
abstract={Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.},
keywords={},
doi={10.1587/transfun.2021DMP0006},
ISSN={1745-1337},
month={September},}
Copy
TY - JOUR
TI - Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1187
EP - 1194
AU - Chuzo IWAMOTO
AU - Tatsuya IDE
PY - 2022
DO - 10.1587/transfun.2021DMP0006
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E105-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2022
AB - Moon-or-Sun, Nagareru, and Nurimeizu are Nikoli's pencil puzzles. We study the computational complexity of Moon-or-Sun, Nagareru, and Nurimeizu puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
ER -
English
