arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2501.12282cs.CC
收藏

Jelly-No和Hanano游戏在各种约束下的复杂性

Complexity of Jelly-No and Hanano games with various constraints

Sorbonne Université(索邦大学);CNRS LIP6(法国国家科学研究中心LIP6实验室);IRIF Université Paris Cité UMR 8243(巴黎西岱大学IRIF研究所)

Owen Crabtree, Valia Mitsou

AI总结:

本文研究了Jelly-No和Hanano游戏在不同约束下的复杂性,证明Jelly-No在无限制颜色数下为PSPACE完全问题,并探讨单色情况下游戏的复杂性。

摘要:

本文展示了Jelly-No和Hanano游戏在不同约束下的复杂性结果。Hanano和Jelly-No是单人2D侧视拼图游戏,具有动态的彩色可移动块。Jelly-No的目标是合并相同颜色的块,而Hanano的目标是通过接触同色花朵使所有块绽放。Chao Yang证明了Jelly-No在所有可移动块同色时为NP完全问题,而Michael C. Chavrimootoo证明了Hanano在所有可移动块同色时为PSPACE完全问题。本文证明了Jelly-No在无限制颜色数下为PSPACE完全问题,并进一步证明允许黑色块(无法合并)时,即使单色,游戏仍为PSPACE完全问题。此外,单色Jelly-No和Hanano在板宽或板高为常数时仍为NP难问题。

英文摘要:

This work shows new results on the complexity of games Jelly-No and Hanano with various constraints on the size of the board and number of colours. Hanano and Jelly-No are one-player, 2D side-view puzzle games with a dynamic board consisting of coloured, movable blocks disposed on platforms. These blocks can be moved by the player and are subject to gravity. Both games, created by Qrostar and available online, somehow vary in their gameplay, but the goal is always to move the coloured blocks in order to reach a specific configuration and make them interact with each other or with other elements of the game. In Jelly-No the goal is to merge all blocks of the same colour, which happens when they make contact. In Hanano the goal is to make all the coloured blocks bloom by making contact with flowers that have the same colour. Jelly-No was proven by Chao Yang to be NP-complete under the restriction that all movable blocks have the same colour and NP-hard for more colours. Hanano was proven by Michael C. Chavrimootoo to be PSPACE-complete under the restriction that all movable blocks have the same colour. However, the question of PSPACE-completeness for Jelly-No with more than one colours was left open. In this paper, we settle this question, proving that Jelly-No is PSPACE-complete with an unbounded number of colours. We further show that, if we allow black jellies (that is, jellies that cannot and do not need to merge), the game is PSPACE-complete even for one colour. We further show that one-colour Jelly-No and Hanano remain NP-hard even if the width or the height of the board are constants.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑