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…