Policy Based Inference in Trick-Taking Card Games
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Optimizing Hearthstone Agents using an Evolutionary Algorithm
Identifying and Clustering Counter Relationships of Team Compositions in PvP Games for Efficient Balance Analysis
AlphaDou: High-Performance End-to-End Doudizhu AI Integrating Bidding
Enhancing Commentary Strategies for Imperfect Information Card Games: A Study of Large Language Models in Guandan Commentary
GTBench: Uncovering the Strategic Reasoning Limitations of LLMs via Game-Theoretic Evaluations
DanZero+: Dominating the GuanDan Game through Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.