Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete

Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete

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.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences Communications and Computer Sciences, 2022/09/01, Vol.E105.A(9), pp.1187-1194
Hauptverfasser: IWAMOTO, Chuzo, IDE, Tatsuya
Format: Artikel
Sprache:eng
Schlagworte:
Moon-or-Sun
Nagareru
NP-complete
Nurimeizu
pencil puzzle
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0916-8508
1745-1337
DOI:10.1587/transfun.2021DMP0006