Special Section on Foundations of Computer Science — Foundations of Computer Science and their New Trends —
Chained Block is NP-Complete
2024 年 E107.D 巻 3 号 p. 320-324
詳細
2024 年 E107.D 巻 3 号 p. 320-324
Chained Block is one of Nikoli's pencil puzzles. We study the computational complexity of Chained Block puzzles. It is shown that deciding whether a given instance of the Chained Block puzzle has a solution is NP-complete.
