Special Section on Discrete Mathematics and Its Applications
Moon-or-Sun, Nagareru, and Nurimeizu are NP-Complete
2022 年 E105.A 巻 9 号 p. 1187-1194
詳細
2022 年 E105.A 巻 9 号 p. 1187-1194
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.
