Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard

Journal of Information Processing(2020)

引用 0|浏览3
暂无评分
摘要
We consider the computational complexity of winning this turn (mate-in-1 or "finding lethal") in Hearthstone as well as several other single turn puzzle types introduced in the Boomsday Lab expansion. We consider three natural generalizations of Hearthstone (in which hand size, board size, and deck size scale) and prove the various puzzle types in each generalization NP-hard.
更多
查看译文
关键词
mad science,puzzles,boomsday lab,hearthstone,np-hard
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要