Competing in a Complex Hidden Role Game with Information Set Monte Carlo Tree Search

by   Jack Reinhardt, et al.
University of Minnesota

Advances in intelligent game playing agents have led to successes in perfect information games like Go and imperfect information games like Poker. The Information Set Monte Carlo Tree Search (ISMCTS) family of algorithms outperforms previous algorithms using Monte Carlo methods in imperfect information games. In this paper, Single Observer Information Set Monte Carlo Tree Search (SO-ISMCTS) is applied to Secret Hitler, a popular social deduction board game that combines traditional hidden role mechanics with the randomness of a card deck. This combination leads to a more complex information model than the hidden role and card deck mechanics alone. It is shown in 10108 simulated games that SO-ISMCTS plays as well as simpler rule based agents, and demonstrates the potential of ISMCTS algorithms in complicated information set domains.


page 2

page 3


Monte Carlo Game Solver

We present a general algorithm to order moves so as to speedup exact gam...

Monte Carlo Continual Resolving for Online Strategy Computation in Imperfect Information Games

Online game playing algorithms produce high-quality strategies with a fr...

Combining Prediction of Human Decisions with ISMCTS in Imperfect Information Games

Monte Carlo Tree Search (MCTS) has been extended to many imperfect infor...

Evaluating and Modelling Hanabi-Playing Agents

Agent modelling involves considering how other agents will behave, in or...

Re-determinizing Information Set Monte Carlo Tree Search in Hanabi

This technical report documents the winner of the Computational Intellig...

Monte Carlo Tree Search: A Review of Recent Modifications and Applications

Monte Carlo Tree Search (MCTS) is a powerful approach to designing game-...

Optimizing αμ

αμ is a search algorithm which repairs two defaults of Perfect Informati...

Please sign up or login with your details

Forgot password? Click here to reset