  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.
