Showing cs.CCShow all
2 papers · 1 filter
cs.CC2016
A handle is enough for a hard game of Pull
Oscar Temprano
We are going to show that some variants of a puzzle called Pull in which the boxes have handles (i.e. we can only pull the boxes in certain directions) are NP-hard
cs.CC2015
Complexity of a Tetris variant
Oscar Temprano
In this paper we are going to solve an open problem about the game tetris. We are going to give the first results in the complexity of a variant of offline tetris introduced by Eri…