Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard
Computational Complexity
2020-10-20 v1
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.
Keywords
Cite
@article{arxiv.2010.08862,
title = {Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard},
author = {Michael Hoffmann and Jayson Lynch and Andrew Winslow},
journal= {arXiv preprint arXiv:2010.08862},
year = {2020}
}
Comments
17 pages, 4 appendix, 1 figure