Special Section on Foundations of Computer Science- Frontiers of Theory of Computation and Algorithm -
Polynomial-Time Reductions from 3SAT to Kurotto and Juosan Puzzles
2020 年 E103.D 巻 3 号 p. 500-505
詳細
2020 年 E103.D 巻 3 号 p. 500-505
Kurotto and Juosan are Nikoli's pencil puzzles. We study the computational complexity of Kurotto and Juosan puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.
