Paper by Erik D. Demaine

Reference:

Zachary Abel, Jeffrey Bosboom, Michael Coulombe, Erik D. Demaine, Linus Hamilton, Adam Hesterberg, Justin Kopinsky, Jayson Lynch, Mikhail Rudoy, and Clemens Thielen, “Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible”, Theoretical Computer Science, volume 839, November 2020, pages 41–102.

BibTeX

@Article{Witness_TCS,
  AUTHOR        = {Zachary Abel and Jeffrey Bosboom and Michael Coulombe and Erik D. Demaine and Linus Hamilton and Adam Hesterberg and Justin Kopinsky and Jayson Lynch and Mikhail Rudoy and Clemens Thielen},
  TITLE         = {Who witnesses {The} {Witness}? {Finding} witnesses in {The} {Witness} is hard and sometimes impossible},
  JOURNAL       = {Theoretical Computer Science},
  journalurl    = {https://www.journals.elsevier.com/theoretical-computer-science},
  VOLUME        = 839,
  MONTH         = {November},
  YEAR          = 2020,
  PAGES         = {41--102},

  withstudent   = 1,
  replaces      = {Witness_FUN2018},
  papers        = {Witness_FUN2018},
  doi           = {https://dx.doi.org/10.1016/J.TCS.2020.05.031},
  dblp          = {https://dblp.org/rec/journals/tcs/AbelBCDHHKLRT20},
  comments      = {This paper is also available from <A HREF="https://doi.org/10.1016/j.tcs.2020.05.031">ScienceDirect</A>
                   and as <A HREF="https://arXiv.org/abs/1804.10193">arXiv:1804.10193</A>.},
}

Abstract:

We analyze the computational complexity of the many types of pencil-and-paper-style puzzles featured in the 2016 puzzle video game The Witness. In all puzzles, the goal is to draw a simple path in a rectangular grid graph from a start vertex to a destination vertex. The different puzzle types place different constraints on the path: preventing some edges from being visited (broken edges); forcing some edges or vertices to be visited (hexagons); forcing some cells to have certain numbers of incident path edges (triangles); or forcing the regions formed by the path to be partially monochromatic (squares), have exactly two special cells (stars), or be singly covered by given shapes (polyominoes) and/or negatively counting shapes (antipolyominoes). We show that any one of these clue types (except the first) is enough to make path finding NP-complete (“witnesses exist but are hard to find”), even for rectangular boards. Furthermore, we show that a final clue type (antibody), which necessarily “cancels” the effect of another clue in the same region, makes path finding Σ₂-complete (“witnesses do not exist”), even with a single antibody (combined with many anti/polyominoes), and the problem gets no harder with many antibodies. On the positive side, we give a polynomial-time algorithm for monomino clues, by reducing to hexagon clues on the boundary of the puzzle, even in the presence of broken edges, and solving “subset Hamiltonian path” for terminals on the boundary of an embedded planar graph in polynomial time.

Comments:

This paper is also available from ScienceDirect and as arXiv:1804.10193.

Availability:

The paper is available in PDF (3478k).

See information on file formats.

[Google Scholar search]

Related papers:

Witness_FUN2018 (Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible)