1-PushingMachine is <b>PSPACE</b>-complete
Based on two puzzle games for mobile phones, Yang introduced the k-PushingMachine problem and showed that the 2-PushingMachine problem is PSPACE-complete. In this paper, we improve Yang's result by showing that the 1-PushingMachine is also PSPACE-complete, even without walls, by applying the door gadget framework.
Authors
- Zhujun Zhang (ORCID: https://orcid.org/0000-0001-8301-785X)
- Chao Yang (ORCID: https://orcid.org/0000-0003-4225-9566)
Institutions
- Guangdong University of Foreign Studies (CN)
- Beijing Institute of Big Data Research (CN)
Publication Details
- Journal
- Journal of Information Processing
- Published
- 2025-01-01
- DOI
- https://doi.org/10.2197/ipsjjip.33.1071
- Primary Topic
- Artificial Intelligence in Games
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Guangdong University of Foreign Studies