LaserTank is NP-complete
arXiv:1908.05966 · doi:10.1007/978-3-030-43120-4_26
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.
5 pages