AI Chat AI Image Generator AI Video Text to Speech

Perfect Information Hearthstone is PSPACE-hard

05/22/2023

∙

by Zhujun Zhang, et al.

∙

∙

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.

page 16

page 17

page 18

research

∙ 11/21/2022

Celeste is PSPACE-hard

We investigate the complexity of the platform video game Celeste. We pro...

0 Lily Chung, et al. ∙

research

∙ 03/11/2020

Magic: the Gathering is as Hard as Arithmetic

Magic: the Gathering is a popular and famously complicated card game abo...

0 Stella Biderman, et al. ∙

research

∙ 03/22/2020

The Computational Complexity of Evil Hangman

The game of Hangman is a classical asymmetric two player game in which o...

0 Jérémy Barbay, et al. ∙

research

∙ 11/18/2019

On the Complexity of 2-Player Packing Games

We analyze the computational complexity of two 2-player games involving ...

0 Oliver Korten, et al. ∙

research

∙ 01/22/2018

Perfect simulation of the Hard Disks Model by Partial Rejection Sampling

We present a perfect simulation of the hard disks model via the partial ...

0 Heng Guo, et al. ∙

research

∙ 06/07/2010

Game Information System

In this Information system age many organizations consider information s...

0 Spits Warnars H. L. H, et al. ∙

research

∙ 12/19/2018

The Computational Complexity of Angry Birds

The physics-based simulation game Angry Birds has been heavily researche...

0 Matthew Stephenson, et al. ∙