NP is as easy as detecting unique solutions
Theoretical Computer Science
Computers and Intractability; A Guide to the Theory of NP-Completeness
Computers and Intractability; A Guide to the Theory of NP-Completeness
The troubles of interior design: a complexity analysis of the game Heyawake
FUN'07 Proceedings of the 4th international conference on Fun with algorithms
Hi-index | 0.00 |
We present a new proof of NP-completeness for the problem of solving instances of the Japanese pencil puzzle KAKURO (also known as Cross-Sum). While the NP-completeness of KAKURO puzzles has been shown before [T. Seta. The complexity of CROSS SUM. IPSJ SIG Notes, AL-84:51-58, 2002], there are still two interesting aspects to our proof: we show NP-completeness for a new variant of KAKURO that has not been investigated before and thus improves the aforementioned result. Moreover some parts of the proof have been generated automatically, using an interesting technique involving SAT solvers.