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

Hexasort -- 图上堆叠颜色的复杂性

Hexasort -- The Complexity of Stacking Colors on Graphs

TU Wien, Vienna, Austria(维也纳工业大学)

Linus Klocker, Simon D. Fink

AI总结:

Hexasort 是一种图上堆叠颜色的游戏,其决策版本被证明为 NP 难,即使在限制条件下仍保持强 NP 难性,且存在多项式时间求解的算法。

摘要:

许多流行的拼图和匹配游戏已通过计算复杂性理论进行了分析。著名的例子包括数独、糖果消消乐和 Flood-It。这些广受欢迎的游戏的通用决策版本都是 NP 难的,这通常被认为是其固有难度和对人类玩家吸引力的来源。在本文中,我们研究了一种流行的单人堆叠游戏,通常称为 Hexasort。该游戏可以建模为将彩色堆叠放置在图的顶点上,相邻的同色堆叠会根据确定性规则合并并消失。我们证明 Hexasort 是 NP 难的,即使在限制为单色堆叠和逐步更约束的图类的情况下,最终在高度或度数受限的树上表现出强 NP 难性。在固定参数可解算法方面,我们识别了问题在某些情况下可以多项式时间求解的设置,并提出了动态规划算法。

英文摘要:

Many popular puzzle and matching games have been analyzed through the lens of computational complexity. Prominent examples include Sudoku, Candy Crush, and Flood-It. A common theme among these widely played games is that their generalized decision versions are NP-hard, which is often thought of as a source of their inherent difficulty and addictive appeal to human players. In this paper, we study a popular single-player stacking game commonly known as Hexasort. The game can be modelled as placing colored stacks onto the vertices of a graph, where adjacent stacks of the same color merge and vanish according to deterministic rules. We prove that Hexasort is NP-hard, even when restricted to single-color stacks and progressively more constrained classes of graphs, culminating in strong NP-hardness on trees of either bounded height or degree. Towards fixed-parameter tractable algorithms, we identify settings in which the problem becomes polynomial-time solvable and present dynamic programming algorithms.

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

↑