arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1605.04715cs.CCcs.AI
收藏

关于联系对策的复杂性

On the Complexity of Connection Games

Hungarian Academy of Sciences(匈牙利科学院);The University of New South Wales(新南威尔士大学)

Édouard Bonnet, Florian Jamain, Abdallah Saffidine

摘要:

在本文中,我们研究了三个最广泛发挥的连接游戏:Havannah,Twixt和Slither。我们表明,确定一个任意的输入位置的结果是PSPACE完全在所有三种情况下。我们的减少是基于流行的图形问题广义地理和十六进制本身。我们还考虑了由解的长度参数化的Hex的推广的复杂性,并建立了当Short Generalized Hex是W[1]-hard时,Short Hex是FPT。最后,我们证明了超弱解决方案的空开始位置在十六进制不能完全适应这三个游戏。

英文摘要:

In this paper, we study three connection games among the most widely played: Havannah, Twixt, and Slither. We show that determining the outcome of an arbitrary input position is PSPACE-complete in all three cases. Our reductions are based on the popular graph problem Generalized Geography and on Hex itself. We also consider the complexity of generalizations of Hex parameterized by the length of the solution and establish that while Short Generalized Hex is W[1]-hard, Short Hex is FPT. Finally, we prove that the ultra-weak solution to the empty starting position in hex cannot be fully adapted to any of these three games.

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

↑