Computational Complexity of Nurimisaki and Sashigane
Summary :
Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane 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.E103-A No.10 pp.1183-1192
- Publication Date
- 2020/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1587/transfun.2019DMP0002
- Type of Manuscript
- Special Section PAPER (Special Section on Discrete Mathematics and Its Applications)
- Category
- complexity theory
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, "Computational Complexity of Nurimisaki and Sashigane" in IEICE TRANSACTIONS on Fundamentals,
vol. E103-A, no. 10, pp. 1183-1192, October 2020, doi: 10.1587/transfun.2019DMP0002.
Abstract: Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane 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.2019DMP0002/_p
Copy
@ARTICLE{e103-a_10_1183,
author={Chuzo IWAMOTO, Tatsuya IDE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Computational Complexity of Nurimisaki and Sashigane},
year={2020},
volume={E103-A},
number={10},
pages={1183-1192},
abstract={Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.},
keywords={},
doi={10.1587/transfun.2019DMP0002},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Computational Complexity of Nurimisaki and Sashigane
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1183
EP - 1192
AU - Chuzo IWAMOTO
AU - Tatsuya IDE
PY - 2020
DO - 10.1587/transfun.2019DMP0002
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E103-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2020
AB - Nurimisaki and Sashigane are Nikoli's pencil puzzles. We study the computational complexity of Nurimisaki and Sashigane puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
ER -
English
