Mad Science is Provably Hard: Puzzles in Hearthstone's Boomsday Lab are NP-hard.
Michael HoffmannJayson LynchAndrew WinslowPublished in: J. Inf. Process. (2020)
Keyphrases
- np hard
- worst case
- computationally hard
- virtual laboratory
- approximation algorithms
- optimal solution
- constraint satisfaction
- scheduling problem
- linear programming
- np complete
- artificial intelligence
- constraint satisfaction problems
- virtual lab
- special case
- electrical engineering
- computer science
- np hardness
- minimum cost
- computational complexity
- lower bound
- science learning
- data mining
- closely related
- remains np hard
- voting protocols
- longitudinal study
- branch and bound algorithm
- integer programming
- greedy heuristic
- science education
- approximation ratio
- maximum weight
- computationally challenging
- middle school
- subject matter
- crossword puzzles