LaserTank is NP-complete, shown by a polynomial-time reduction from 3-SAT using mirror-based gadgets, even with restricted tank movement and only mirrors and solid blocks.
The Mathematical Intelligencer 22(2), 9--15 (Mar 2000)
1 Pith paper cite this work, alongside 148 external citations. Polarity classification is still indexing.
1
Pith paper citing it
148
external citations · OpenAlex
fields
cs.CC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
LaserTank is NP-complete
LaserTank is NP-complete, shown by a polynomial-time reduction from 3-SAT using mirror-based gadgets, even with restricted tank movement and only mirrors and solid blocks.