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.

中文翻译：

---

疯狂科学证明很难：炉石传说 Boomsday 实验室中的谜题是 NP 难的

我们考虑了《炉石传说》中赢得这一回合（一对一或“寻找致命”）以及 Boomsday Lab 扩展中引入的其他几种单回合谜题类型的计算复杂性。我们考虑了炉石的三个自然概括（其中手牌大小、棋盘大小和甲板大小比例）并证明每个概括中的各种谜题类型都是 NP-hard。