AI Chat AI Image Generator AI Video Text to Speech

LaserTank is NP-complete

08/16/2019

∙

by Per Alexandersson, et al.

∙

∙

We show that the classical game LaserTank is 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.

Per Alexandersson
2 publications
Petter Restadh
3 publications

page 4

page 5

research

∙ 09/29/2020

Tetris is NP-hard even with O(1) rows or columns

We prove that the classic falling-block video game Tetris (both survival...

0 Sualeh Asif, et al. ∙

research

∙ 01/13/2020

NP-complete variants of some classical graph problems

Some classical graph problems such as finding minimal spanning tree, sho...

0 Per Alexandersson, et al. ∙

research

∙ 04/29/2021

Revising Johnson's table for the 21st century

What does it mean today to study a problem from a computational point of...

0 Celina M. H. de Figueiredo, et al. ∙

research

∙ 03/28/2022

Chess is hard even for a single player

We introduce a generalization of "Solo Chess", a single-player variant o...

0 N. R. Aravind, et al. ∙

research

∙ 11/10/2022

Complexity of Chess Domination Problems

We study different domination problems of attacking and non-attacking ro...

0 Alexis Langlois-Rémillard, et al. ∙

research

∙ 04/03/2017

Graph Partitioning with Acyclicity Constraints

Graphs are widely used to model execution dependencies in applications. ...

0 Orlando Moreira, et al. ∙

research

∙ 09/06/2019

NP-completeness of the game Kingdomino

Kingdomino is a board game designed by Bruno Cathala and edited by Blue ...

0 Viet-Ha Nguyen, et al. ∙