2000 character limit reached
Motion planning with pull moves (1008.2952v1)
Published 17 Aug 2010 in cs.CC
Abstract: It is well known that Sokoban is PSPACE-complete (Culberson 1998) and several of its variants are NP-hard (Demaine et al. 2003). In this paper we prove the NP-hardness of some variants of Sokoban where the warehouse keeper can only pull boxes.