Motion planning with pull moves

Details Motion planning with pull moves Motion planning with pull moves

2010-08-17

arxiv.org/abs/1008.2952v1

Computer Science

Computational Complexity

9 pages, 7 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Motion planning with pull moves does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Motion planning with pull moves, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Motion planning with pull moves will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-398310