License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FUN.2021.18
URN: urn:nbn:de:0030-drops-127797
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2020/12779/
Go to the corresponding LIPIcs Volume Portal

Kopczyński, Eryk

Hyperbolic Minesweeper Is in P

pdf-format:
LIPIcs-FUN-2021-18.pdf (1 MB)

Abstract

We show that, while Minesweeper is NP-complete, its hyperbolic variant is in P. Our proof does not rely on the rules of Minesweeper, but is valid for any puzzle based on satisfying local constraints on a graph embedded in the hyperbolic plane.

BibTeX - Entry

@InProceedings{kopczyski:LIPIcs:2020:12779,
  author =	{Eryk Kopczyński},
  title =	{{Hyperbolic Minesweeper Is in P}},
  booktitle =	{10th International Conference on Fun with Algorithms (FUN 2021)},
  pages =	{18:1--18:7},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-145-0},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{157},
  editor =	{Martin Farach-Colton and Giuseppe Prencipe and Ryuhei Uehara},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2020/12779},
  URN =		{urn:nbn:de:0030-drops-127797},
  doi =		{10.4230/LIPIcs.FUN.2021.18},
  annote =	{Keywords: Minesweeper}
}

Keywords: Minesweeper
Collection: 10th International Conference on Fun with Algorithms (FUN 2021)
Issue Date: 2020
Date of publication: 16.09.2020

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI