2000 character limit reached
Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard
Published 17 Oct 2020 in cs.CC | (2010.08862v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
