携带是困难的：探索NP和PSPACE难度之间的Hanano和Jelly no谜题的差距
Carrying is Hard: Exploring the Gap between Hardness for NP and PSPACE for the Hanano and Jelly no Puzzles
AI总结：
研究发现Hanano谜题在特定限制下仍保持PSPACE完全性，揭示方块相互携带机制是导致PSPACE难问题的关键因素。
摘要：
Hanano谜题是一种单人游戏，具有不可逆的重力，目标是让彩色方块与对应颜色的花朵接触。Jelly no谜题具有相似的机制。一般来说，确定两种游戏中给定关卡是否可解是PSPACE完全问题。已知在某些限制条件下，确定Jelly no谜题的关卡是否可解是NP完全问题。我们发现，在相同的限制条件下，确定Hanano谜题的关卡是否可解仍保持PSPACE完全性。因此，我们研究了几种Hanano的限制条件，将其与已知的Jelly no谜题结果进行对比，并提出PSPACE难问题的核心机制是方块之间相互携带的能力。
英文摘要：
The Hanano Puzzle is a one-player game with gravity, where the goal is to make colored blocks make contact with flowers of the corresponding color. The game Jelly no Puzzle shares similar mechanics. In general, determining if a given level of each of the two games is solvable is PSPACE-complete. There are also known restrictions under which determining if a level of Jelly no Puzzle is solvable is NP-complete. We find that under the same restrictions, determining if a level of Hanano Puzzle is solvable remains PSPACE-complete. We thus study several restrictions on Hanano, contrast them with known results about Jelly no Puzzle---at times giving membership in P---and posit that the mechanism at the heart of the PSPACE-hardness is the ability for blocks to carry other blocks.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
