activity
20112020
most citedOne Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece

19 citations · 46 across the 18 of their papers we have counts for

collaborators
Showing 2020Show all

1 paper · 1 filter

cs.CC2020

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

Michael Hoffmann, Jayson Lynch, Andrew Winslow

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 Boo…