Chained Block is NP-Complete
Chuzo IWAMOTO, Tatsuya IDE · IEICE Transactions on Information and Systems · 2024
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.