14 citations · 29 across the 20 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.CC2018
Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible
Zachary Abel, Jeffrey Bosboom, Michael Coulombe +7
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…
cs.CG2018
Path Puzzles: Discrete Tomography with a Path Constraint is Hard
Jeffrey Bosboom, Erik D. Demaine, Martin L. Demaine +3
We prove that path puzzles with complete row and column information--or equivalently, 2D orthogonal discrete tomography with Hamiltonicity constraint--are strongly NP-complete, ASP…