Five Cells and Tilepaint are NP-Complete
Chuzo IWAMOTO, Tatsuya IDE · IEICE Transactions on Information and Systems · 2022
Five Cells and Tilepaint are Nikoli's pencil puzzles. We study the computational complexity of Five Cells and Tilepaint puzzles. It is shown that deciding whether a given instance of each puzzle has a solution is NP-complete.