Computational Complexity of NURIKABE

DOI10.3233/FI-2011-534zbMath1236.68094OpenAlexW1544176485MaRDI QIDQ3100933

Oliver Ruepp, Markus Holzer, Martin Kutrib, Andreas G. Klein

Publication date: 22 November 2011

Published in: Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/fi-2011-534

zbMATH Keywords

computational complexityNP-completepencil puzzle Nurikabe

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (2)

Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle ⋮ Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori

This page was built for publication: Computational Complexity of NURIKABE