Push-Pull Block Puzzles are Hard

Demaine, ED; Grosof, I; Lynch, J

Lynch, J (reprint author), MIT, Comp Sci & Artificial Intelligence Lab, 32 Vassar St, Cambridge, MA 02139 USA.

ALGORITHMS AND COMPLEXITY (CIAC 2017), 2017; 10236 ( ): 177

Abstract

This paper proves that push-pull block puzzles in 3D are PSPACE-complete to solve, and push-pull block puzzles in 2D with thin walls are NP-hard to so......

Full Text Link


Links

期刊讨论 | 中国SCI论文 | 期刊主页 | 投稿经验 | 杂志官网 | 投稿链接 | 作者需知 | PMC链接 | Pubmed全文检索