论文标题
事实证明，疯狂的科学很难：炉石传说中的谜题是NP-HARD
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard
论文作者
论文摘要
我们考虑了在炉石传说中赢得此回合的计算复杂性（Mate-In-In-1或“发现致命”），以及Boomsday Lab扩展中引入的其他几种单转拼图类型。我们考虑了炉石的三种天然概括（在哪种手尺寸，板尺寸和甲板尺寸尺寸）中，并证明了每种概括NP中的各种拼图类型。
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.
