Chapter

Fun with Algorithms

Volume 4475 of the series Lecture Notes in Computer Science pp 198-212

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

  • Markus HolzerAffiliated withInstitut für Informatik, Technische Universität München, Boltzmannstrasse 3, D-85748 Garching bei München
  • , Oliver RueppAffiliated withInstitut für Informatik, Technische Universität München, Boltzmannstrasse 3, D-85748 Garching bei München

* Final gross prices may vary according to local VAT.

Get Access

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.