扫雷舰的相变
A Phase Transition in Minesweeper
摘要:
我们研究了经典扫雷游戏的平均情况下的复杂性,玩家推断地雷的位置在一个二维晶格。玩扫雷游戏是co-NP-complete。我们的经验表明,扫雷表现出类似的相变研究SAT相变。超过临界地雷密度,几乎不可能通过逻辑推理来玩扫雷。我们使用布尔不可满足性的约简来表征扫雷舰实例的硬度,并表明硬度在相变处达到峰值。此外,我们证明了算法的障碍,在相变的多项式时间的方法扫雷推理。最后,我们评论期望的相变的渐近行为。
英文摘要:
We study the average-case complexity of the classic Minesweeper game in which players deduce the locations of mines on a two-dimensional lattice. Playing Minesweeper is known to be co-NP-complete. We show empirically that Minesweeper exhibits a phase transition analogous to the well-studied SAT phase transition. Above the critical mine density it becomes almost impossible to play Minesweeper by logical inference. We use a reduction to Boolean unsatisfiability to characterize the hardness of Minesweeper instances, and show that the hardness peaks at the phase transition. Furthermore, we demonstrate algorithmic barriers at the phase transition for polynomial-time approaches to Minesweeper inference. Finally, we comment on expectations for the asymptotic behavior of the phase transition.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。