Computational Complexity of NURIKABE

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2011 English Publisher:SAGE PublicationsJournal:Fundamenta Informaticae, volume 110, pages 159-174 (issn: 0169-2968, eissn: 1875-8681,

Copyright policy )

Authors: Markus Holzer 0001; Andreas Klein 0001; Martin Kutrib; Oliver Ruepp;

doi: 10.3233/fi-2011-534

Computational Complexity of NURIKABE

- Summary
- Subjects
- Metrics

Abstract

We show that the popular pencil puzzle NURIKABE is intractable from the computational complexity point of view, that is, it is NP-complete, even when the involved numbers are 1 and 2 only. To this end, we show how to simulate Boolean gates by the puzzle under consideration. Moreover, we also study some NURIKABE variants, which remain NP-complete, too.

Related Organizations

Justus Liebig University Giessen
Germany
Technical University of Munich
Germany
TECHNISCHE UNIVERSITAET MUENCHEN
Germany

Keywords

computational complexity, pencil puzzle Nurikabe, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Orthogonal arrays, Latin squares, Room squares, NP-complete

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Top 10%
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average