Special Section on Discrete Mathematics and Its Applications
Computational Complexity of Nurimisaki and Sashigane
2020 年 E103.A 巻 10 号 p. 1183-1192
詳細
2020 年 E103.A 巻 10 号 p. 1183-1192
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.
