A handle is enough for a hard game of Pull
Computational Complexity
2018-01-01 v2
Abstract
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
Cite
@article{arxiv.1605.08951,
title = {A handle is enough for a hard game of Pull},
author = {Oscar Temprano},
journal= {arXiv preprint arXiv:1605.08951},
year = {2018}
}