TL;DR
This paper proves that the puzzle game LaserTank is NP-complete, even under simplified conditions, by reducing 3-SAT problems to LaserTank puzzles, highlighting its computational complexity.
Contribution
It demonstrates NP-completeness of LaserTank with restricted movement and block types through a reduction from 3-SAT, establishing its computational difficulty.
Findings
LaserTank is NP-complete under restricted conditions
Reduction from 3-SAT to LaserTank puzzles
Complexity persists even with simplified game rules
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.