LaserTank is NP-Complete

DOI10.1007/978-3-030-43120-4_26OpenAlexW2967757923MaRDI QIDQ5014691

Petter Restadh, Per Alexandersson

Publication date: 8 December 2021

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1908.05966

zbMATH Keywords

NP-completeness3-SATLaserTank

Mathematics Subject Classification ID

Numerical analysis (65-XX) Computer science (68-XX)

Cites Work

• Gaming is a hard job, but someone has to do it!
• Minesweeper may not be NP-complete but is hard nonetheless
• SOKOBAN and other motion planning problems
• Tetris is Hard, Even to Approximate
• The complexity of theorem-proving procedures
• Minesweeper is NP-complete.
• Rush Hour is PSPACE-complete, or ``Why you should generously tip parking lot attendants

This page was built for publication: LaserTank is NP-Complete