The Complexity of Playing Durak - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

The Complexity of Playing Durak

Résumé

Durak is a Russian card game in which players try to get rid of all their cards via a particular at-tack/defense mechanism. The last player standing with cards loses. We show that, even restricted to the perfect information two-player game, finding optimal moves is a hard problem. More precisely , we prove that, given a generalized du-rak position, it is PSPACE-complete to decide if a player has a winning strategy. We also show that deciding if an attack can be answered is NP-hard.
Fichier principal
Vignette du fichier
Bonnet_durak.pdf (207.4 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01994440 , version 1 (25-07-2019)

Identifiants

  • HAL Id : hal-01994440 , version 1

Citer

Edouard Bonnet. The Complexity of Playing Durak. 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), Jul 2016, New-York, NY, United States. pp.109-115. ⟨hal-01994440⟩
357 Consultations
147 Téléchargements

Partager

Gmail Mastodon Facebook X LinkedIn More