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

Chuzo IWAMOTO; Tatsuya IDE

doi:10.1587/transfun.2021DMP0006

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Special Section on Discrete Mathematics and Its Applications

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

Chuzo IWAMOTO, Tatsuya IDE

Author information

Keywords: Moon-or-Sun, Nagareru, Nurimeizu, pencil puzzle, NP-complete

JOURNAL RESTRICTED ACCESS

2022 Volume E105.A Issue 9 Pages 1187-1194

DOI https://doi.org/10.1587/transfun.2021DMP0006

Browse “Advance online publication” version

Details

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.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!