arXiv
Open Access
2010
Motion planning with pull moves
Marcus Ritt
Abstrak
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.
Topik & Kata Kunci
Penulis (1)
M
Marcus Ritt
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2010
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓