AI Chat AI Image Generator AI Video Text to Speech

Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard

10/17/2020

∙

by Michael Hoffmann, et al.

∙

∙

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.

Michael Hoffmann
19 publications
Jayson Lynch
42 publications
Andrew Winslow
3 publications

page 16

page 17

page 18

research

∙ 10/14/2017

Netrunner Mate-in-1 or -2 is Weakly NP-Hard

We prove that deciding whether the Runner can win this turn (mate-in-1) ...

0 Jeffrey Bosboom, et al. ∙

research

∙ 12/04/2020

Computational Complexity of Three Central Problems in Itemset Mining

Itemset mining is one of the most studied tasks in knowledge discovery. ...

0 Christian Bessiere, et al. ∙

research

∙ 04/30/2023

The iteration time and the general position number in graph convexities

In this paper, we study two graph convexity parameters: iteration time a...

0 Júlio Araújo, et al. ∙

research

∙ 10/09/2018

The Computational Complexity of Training ReLU(s)

We consider the computational complexity of training depth-2 neural netw...

0 Pasin Manurangsi, et al. ∙

research

∙ 06/30/2021

Backgammon is Hard

We study the computational complexity of the popular board game backgamm...

0 R. Teal Witter, et al. ∙

research

∙ 11/28/2017

Hardness Results on Finding Leafless Elementary Trapping Sets and Elementary Absorbing Sets of LDPC Codes

Leafless elementary trapping sets (LETSs) are known to be the problemati...

0 Ali Dehghan, et al. ∙

research

∙ 03/09/2020

On the computational complexity of uncapacitated multi-plant lot-sizing problems

Production and inventory planning have become crucial and challenging in...

0 J. O. Cunha, et al. ∙