LaserTank is NP-complete
Computational Complexity
2020-04-21 v1 Combinatorics
Abstract
We show that the classical game LaserTank is -complete, even when the tank movement is restricted to a single column and the only blocks appearing on the board are mirrors and solid blocks. We show this by reducing -SAT instances to LaserTank puzzles.
Cite
@article{arxiv.1908.05966,
title = {LaserTank is NP-complete},
author = {Per Alexandersson and Petter Restadh},
journal= {arXiv preprint arXiv:1908.05966},
year = {2020}
}
Comments
5 pages