Abstract
HEYAWAKE is one of many recently popular Japanese pencil puzzles. We investigate the computational complexity of the problem of deciding whether a given puzzle instance has a solution or not. We show that Boolean gates can be emulated via HEYAWAKE puzzles, and that it is possible to reduce the Boolean Satisfiability problem to HEYAWAKE. It follows that the problem in question is NP-complete. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Holzer, M., & Ruepp, O. (2007). The troubles of interior design-A complexity analysis of the game Heyawake. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4475 LNCS, pp. 198–212). Springer Verlag. https://doi.org/10.1007/978-3-540-72914-3_18
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
