On the Complexity of Trick-Taking Card Games
نویسندگان
چکیده
Determining the complexity of perfect information trick-taking card games is a long standing open problem. This question is worth addressing not only because of the popularity of these games among human players, e.g., DOUBLE DUMMY BRIDGE, but also because of its practical importance as a building block in state-of-the-art playing engines for CONTRACT BRIDGE, SKAT, HEARTS, and SPADES. We define a general class of perfect information twoplayer trick-taking card games dealing with arbitrary numbers of hands, suits, and suit lengths. We investigate the complexity of determining the winner in various fragments of this game class. Our main result is a proof of PSPACE-completeness for a fragment with bounded number of hands, through a reduction from Generalized Geography. Combining our results with Wästlund’s tractability results gives further insight in the complexity landscape of trick-taking card games.
منابع مشابه
The Importance of Rank in Trick-Taking Card Games
Recent years have seen a surge of interest in computational complexity results in card games. We focus in this paper on trick-taking card games, extending a study started in 2013. This class ranges from WHIST and CONTRACT BRIDGE to SKAT and TAROT. We investigate how the number of cards per suit, the ranks, impacts the complexity of solving arbitrary positions. We prove that 2 distinct ranks are...
متن کاملAn Expert-Level Card Playing Agent Based on a Variant of Perfect Information Monte Carlo Sampling
Despite some success of Perfect Information Monte Carlo Sampling (PIMC) in imperfect information games in the past, it has been eclipsed by other approaches in recent years. Standard PIMC has well-known shortcomings in the accuracy of its decisions, but has the advantage of being simple, fast, robust and scalable, making it well-suited for imperfect information games with large state-spaces. We...
متن کاملTwo-Person Symmetric Whist
The game of two-person whist is played with a deck of cards. Each card belongs to a suit, and each suit is totally ordered. The cards are distributed between the two players so that each player receives the same number of cards. Hence both players have complete information about the deal. Play proceeds in tricks, with the obligation to follow suit, as in many real-world card games. We study the...
متن کاملA Doppelkopf Player Based on UCT
We propose doppelkopf, a trick-taking card game with similarities to skat, as a benchmark problem for AI research. While skat has been extensively studied by the AI community in recent years, this is not true for doppelkopf. However, it has a substantially larger state space than skat and a unique key feature which distinguishes it from skat and other card games: players usually do not know wit...
متن کاملOn Pruning Techniques for Multi-Player Games
Max (Luckhardt and Irani, 1986) is the extension of the minimax backup rule to multi-player games. We have shown that only a limited version of alpha-beta pruning, shallow pruning, can be applied to a max search tree. We extend this work by calculating the exact bounds needed to use this pruning technique. In addition, we show that branch-and-bound pruning, using a monotonic heuristic, has the ...
متن کامل