Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.
Michael HoffmannJayson LynchAndrew WinslowPublished in: CoRR (2020)
Keyphrases
- np hard
- worst case
- computationally hard
- virtual laboratory
- virtual lab
- lower bound
- special case
- scheduling problem
- np complete
- optimal solution
- approximation algorithms
- constraint satisfaction
- constraint satisfaction problems
- linear programming
- computer science
- computational complexity
- np hardness
- electrical engineering
- decision problems
- neural network
- voting protocols
- greedy heuristic
- science learning
- integer programming
- knapsack problem
- middle school
- middle school students
- science education
- scientific knowledge
- closely related