Computational Complexity of Yajisan-Kazusan and Stained Glass

Chuzo IWAMOTO; Ryo TAKAISHI

doi:10.1587/transinf.2024FCP0004

Special Section on Foundations of Computer Science —Mathematical Foundations of Computer Science and Its Applications—

Computational Complexity of Yajisan-Kazusan and Stained Glass

Chuzo IWAMOTO, Ryo TAKAISHI

著者情報

キーワード: Yajisan-Kazusan, Stained Glass, pencil puzzle, computational complexity, NP-complete

ジャーナルフリー

2025 年 E108.D 巻 3 号 p. 201-207

DOI https://doi.org/10.1587/transinf.2024FCP0004

Browse “Advance online publication” version

詳細

抄録

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.

責任著者(Corresponding author)

J-STAGEへの登録はこちら（無料）