2000 character limit reached
Perfect Information Hearthstone is PSPACE-hard (2305.12731v1)
Published 22 May 2023 in cs.CC
Abstract: We consider the computational complexity of Hearthstone which is a popular online CCG (collectible card game). We reduce a PSPACE-complete problem, the partition game, to perfect information Hearthstone in which there is no hidden information or random elements. In the reduction, each turn in Hearthstone is used to simulate one choice in the partition game. It is proved that determining whether the player has a forced win in perfect information Hearthstone is PSPACE-hard.