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.

翻译：我们考虑了热门在线集换式卡牌游戏《炉石传说》的计算复杂性。通过将一个PSPACE完全问题——分区博弈——归约至不存在隐藏信息或随机元素的完美信息炉石传说，本归约中《炉石传说》的每个回合被用于模拟分区博弈中的一次选择。研究证明，判定玩家在完美信息炉石传说中是否拥有必胜策略属于PSPACE-hard问题。