The Maze Generation Problem is NP-complete

@inproceedings{Alviano2009TheMG,
  title={The Maze Generation Problem is NP-complete},
  author={Mario Alviano},
  booktitle={ICTCS},
  year={2009}
}
TheMaze Generationproblem has been presented as a benchmark for the Second Answer Set Programming Competition. We prove that the prob lem is NP–complete and identify relevant classes of unsatisfiable instances. TheMaze Generation(MG) problem has been presented as a benchmark for the Second Answer Set Programming (ASP) Competition 1. The problem has been placed in the NP category, which contains problems in NP for which an algorithm inP is unknown. Here, we prove that the problem is in fact… CONTINUE READING