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

扫雷舰的计算复杂性

The computational complexity of Minesweeper

Michiel de Bondt

摘要:

我们表明,扫雷游戏是PP难,当目标是找到所有地雷的概率最高。当找到所有地雷的概率可能是无穷小时,扫雷游戏甚至是PSPACE完全的。在我们的构造中,玩家可以在多项式时间内发现一个布尔电路,在猜出一个没有周围地雷的初始正方形后,猜测有99%的成功概率。随后,必须以最大的成功概率确定地雷的位置。此外,我们还证明了在六边形和三角形网格以及正方形网格下,确定部分未覆盖的扫雷艇棋盘的可解性是NP完全的,仅通过R推广了正方形网格的类似结果。凯实际上,找到成功概率最大的地雷也是PP困难或PSPACE完全的。我们的结构是在这样一种方式,地雷的数量可以计算在多项式时间,因此,一个可能的地雷计数器不提供额外的信息。结果是通过将[3]中的二元门替换为两个原语来获得的,这使得在此上下文中的生活更容易。

英文摘要:

We show that the Minesweeper game is PP-hard, when the object is to locate all mines with the highest probability. When the probability of locating all mines may be infinitesimal, the Minesweeper game is even PSPACE-complete. In our construction, the player can reveal a boolean circuit in polynomial time, after guessing an initial square with no surrounding mines, a guess that has 99 percent probability of success. Subsequently, the mines must be located with a maximum probability of success. Furthermore, we show that determining the solvability of a partially uncovered Minesweeper board is NP-complete with hexagonal and triangular grids as well as a square grid, extending a similar result for square grids only by R. Kaye. Actually finding the mines with a maximum probability of success is again PP-hard or PSPACE-complete respectively. Our constructions are in such a way that the number of mines can be computed in polynomial time and hence a possible mine counter does not provide additional information. The results are obtained by replacing the dyadic gates in [3] by two primitives which makes life more easy in this context.

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

↑