Year: 2024
Type: article
Abstract: Yajisan-Kazusan and Stained Glass are Nikoli’s pencil puzzles. We study the computational complexity of Yajisan-Kazusan and Stained Glass puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
Authors: Chuzo IWAMOTO, Ryo TAKAISHI
Institution: Hiroshima University
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4401599245