The Troubles of Interior Design–A Complexity Analysis of the Game Heyawake

  • Markus Holzer
  • Oliver Ruepp
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4475)

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 \(\textsf{NP}\)-complete.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blass, A., Gurevich, Y.: On the unique satisfiability problem. Information and Control 55(1-3), 80–88 (1982)MathSciNetCrossRefMATHGoogle Scholar
  2. 2.
    Friedman, E.: Corral puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)Google Scholar
  3. 3.
    Friedman, E.: Pearl puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)Google Scholar
  4. 4.
    Friedman, E.: Spiral galaxies puzzles are NP-complete. Technical report, Stetson University, DeLand, FL 32723 (2002)Google Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co, New York, NY, USA (1990)MATHGoogle Scholar
  6. 6.
    Holzer, M., Klein, A., Kutrib, M.: On the NP-completeness of the NURIKABE pencil puzzle and variants thereof. In: Ferragnia, P., Grossi, R.: (eds.). In: Proceedings of the 3rd International Conference on FUN with Algorithms, Island of Elba, Italy, Edizioni Plus, Universitá di Pisa, pp. 77–89 (May 2004)Google Scholar
  7. 7.
    Seta, T.: The complexities of puzzles, cross sum and their another solution problems (asp). Senior thesis, Univ. of Tokyo, Dept. of Information Science, Faculty of Science, Hongo 7-3-1, Bunkyo-ku, Tokyo 113, Japan (February 2001)Google Scholar
  8. 8.
    Ueda, N., Nagao, T.: NP-completeness results for nonogram via parsimonious reductions, Technical Report TR96-008, Dept. of Computer Science, Tokyo Institute of Technology (1996) Google Scholar
  9. 9.
    Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science 8, 189–201 (1979)MathSciNetCrossRefMATHGoogle Scholar
  10. 10.
    Yato, T.: Complexity and completeness of finding another solution and its application to puzzles. Master’s thesis, Univ. of Tokyo, Dept. of Information Science, Faculty of Science, Hongo 7-3-1, Bunkyo-ku, Tokyo 113, Japan (January 2003)Google Scholar

Copyright information

© Springer Berlin Heidelberg 2007

Authors and Affiliations

  • Markus Holzer
    • 1
  • Oliver Ruepp
    • 1
  1. 1.Institut für Informatik, Technische Universität München, Boltzmannstrasse 3, D-85748 Garching bei MünchenGermany

Personalised recommendations