关于警匪博弈的计算复杂性
On the computational complexity of a game of cops and robbers
摘要:
研究了Aigner和Fromme提出的完全信息二人对策的计算复杂性。游戏发生在一个无向图上,n个同时移动的警察试图抓住一个抢劫犯,所有人都以相同的速度移动。玩家可以在第一步选择他们的起始位置。决定这个博弈的计算复杂性的问题是由Goldstein和Reingold在90年代提出的。我们证明了这个博弈对于PSPACE是困难的。
英文摘要:
We study the computational complexity of a perfect-information two-player game proposed by Aigner and Fromme. The game takes place on an undirected graph where n simultaneously moving cops attempt to capture a single robber, all moving at the same speed. The players are allowed to pick their starting positions at the first move. The question of the computational complexity of deciding this game was raised in the '90s by Goldstein and Reingold. We prove that the game is hard for PSPACE.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。