paper-with-me

홈 › Papers

Policy Based Inference in Trick-Taking Card Games

2019-05-27 · Douglas Rebstock, Christopher Solinas, Michael Buro, Nathan R. Sturtevant

Trick-taking card games feature a large amount of private information that slowly gets revealed through a long sequence of actions. This makes the number of histories exponentially large in the action sequence length, as well as creating extremely large information sets. As a result, these games become too large to solve. To deal with these issues many algorithms employ inference, the estimation of the probability of states within an information set. In this paper, we demonstrate a Policy Based Inference (PI) algorithm that uses player modelling to infer the probability we are in a given state. We perform experiments in the German trick-taking card game Skat, in which we show that this method vastly improves the inference as compared to previous work, and increases the performance of the state-of-the-art Skat AI system Kermit when it is employed into its determinized search algorithm.

📄 PDF Abstract BibTeX arXiv:1905.10911

Code (0)

등록된 구현이 없습니다.

Tasks

Card Games

Similar Papers 제목 키워드 기반

Improving Search with Supervised Learning in Trick-Based Card Games

2019-03-22 · Christopher Solinas, Douglas Rebstock, Michael Buro

In trick-taking card games, a two-step process of state sampling and evaluation is widely used to approximate move values. While the evaluation component is vital, the accuracy of move value estimates is also fundamental…

Card Games

Knowledge-Based Paranoia Search in Trick-Taking

2021-04-07 · Stefan Edelkamp

This paper proposes \emph{knowledge-based paraonoia search} (KBPS) to find forced wins during trick-taking in the card game Skat; for some one of the most interesting card games for three players. It combines efficient p…

Card Games

Transformer Based Planning in the Observation Space with Applications to Trick Taking Card Games

2024-04-19 · Douglas Rebstock, Christopher Solinas, Nathan R. Sturtevant, Michael Buro

Traditional search algorithms have issues when applied to games of imperfect information where the number of possible underlying states and trajectories are very large. This challenge is particularly evident in trick-tak…

Card Games

On the Power of Refined Skat Selection

2021-04-07 · Stefan Edelkamp

Skat is a fascinating combinatorial card game, show-casing many of the intrinsic challenges for modern AI systems such as cooperative and adversarial behaviors (among the players), randomness (in the deal), and partial k…

Board Games

Outer-Learning Framework for Playing Multi-Player Trick-Taking Card Games: A Case Study in Skat

2025-12-17 · Stefan Edelkamp arxiv

In multi-player card games such as Skat or Bridge, the early stages of the game, such as bidding, game selection, and initial card selection, are often more critical to the success of the play than refined middle- and en…