  We show that the classical game LaserTank is $\mathrm{NP}$-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
$3$-SAT instances to LaserTank puzzles.
