arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1208.2432math.COcs.DM
收藏

海盗与宝藏

Pirates and Treasure

Fraser Stewart

摘要:

在本文中,我们介绍了一个新的游戏,在这个游戏中有两个球员谁扮演对手的海盗团伙。目标是比你的对手收集更多的宝藏。游戏在一个图上进行,玩家通过移动到一个未访问的顶点来收集宝藏。在游戏结束时,拥有最多宝藏的玩家获胜。我们将证明这个博弈是NP难的,我们也将研究这个博弈在析取和下的结构。我们将展示这个博弈在某些情况下表现得像一个正常的博弈,在某些情况下表现得像一个错误的博弈。然后,我们留下一个关于得分的开放问题。

英文摘要:

In this paper we introduce a new game; in this game there are two players who play as rival pirate gangs. The goal is to gather more treasure than your rival. The game is played on a graph and a player gathers treasure by moving to an unvisited vertex. At the end of the game, the player with the most treasure wins. We will show that this game is NP-Hard, and we will also look at the structure of this game under the disjunctive sum. We will show that there are cases where this game behaves like a normal play game, and cases where it behaves like a mis`ere play game. We then leave an open problem about scoring play games in general.

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

↑