Playing Dominoes Is Hard, Except by Yourself.

Lecture Notes in Computer Science(2014)

引用 3|浏览13
暂无评分
摘要
Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that single-player dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players compete, the game is PSPACE-complete. In addition, we show that these hardness results easily extend to games involving team play.
更多
查看译文
关键词
algorithmic combinatorial game theory,mathematical games and puzzles,computational complexity
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要