arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.02849cs.CCcs.DM
收藏

Kingdomino对策的NP完全性

NP-completeness of the game Kingdomino

Viet-Ha Nguyen, Kevin Perrot, Mathieu Vallet

摘要:

Kingdomino是一款由Bruno Cathala设计并由Blue Orange自2016年以来编辑的棋盘游戏。目标是将$2 \times 1$多米诺骨牌放在网格布局上,并获得比其他玩家更好的分数。每个$1 \times 1$多米诺骨牌单元格都有一个必须与至少一个相邻单元格匹配的颜色,以及用于计算分数的整数个冠(可能没有)。我们证明,即使完全了解游戏的未来,为了最大限度地提高他们在Kingdomino的分数,玩家面临着一个NP完全优化问题。

英文摘要:

Kingdomino is a board game designed by Bruno Cathala and edited by Blue Orange since 2016. The goal is to place $2 \times 1$ dominoes on a grid layout, and get a better score than other players. Each $1 \times 1$ domino cell has a color that must match at least one adjacent cell, and an integer number of crowns (possibly none) used to compute the score. We prove that even with full knowledge of the future of the game, in order to maximize their score at Kingdomino, players are faced with an NP-complete optimization problem.

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

↑