Scholarlink

In this paper, we introduce the k-PushingMachine problem, which shares some similarities with the classic Sokoban and sliding block puzzles, yet has significantly different features. We investigate the computational complexity of k-PushingMachine, and show that the k-PushingMachine is PSPACE-complete for \(k\ge 2\) .

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

On the Computational Complexity of Pushing Machine

  • 会议论文

  • 发表日期：

    2026年

查看全文
  • Chao Yang

摘要

In this paper, we introduce the k-PushingMachine problem, which shares some similarities with the classic Sokoban and sliding block puzzles, yet has significantly different features. We investigate the computational complexity of k-PushingMachine, and show that the k-PushingMachine is PSPACE-complete for \(k\ge 2\) .