{"type":"ScholarlyArticle","title":"The Complexity of Playing Durak","authors":[{"name":"Edouard Bonnet","slug":"edouard-bonnet","given":"Edouard","family":"Bonnet","affiliation":""}],"abstract":"Durak is a Russian card game in which players try to get rid of all their cards via a particular attack/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 Durak 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.","doi":null,"url":"https://ijcai.org/proceedings/2016/23","pdf":"https://ijcai.org/proceedings/2016/0023.pdf","markdown":"https://ijcai.org/proceedings/2016/23.md","bibtex":"https://ijcai.org/proceedings/2016/bibtex/23","volume":{"slug":"2016","title":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2016","url":"https://ijcai.org/proceedings/2016/","year":2016,"location":"New York, NY, USA","dates":"9–15 July 2016","editors":"Subbarao Kambhampati","isbn":"978-1-57735-770-4; 978-1-57735-771-1","publisher":"AAAI Press / International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":23,"pages":{"first":109,"last":114},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}