DeepAI AI Chat
Log In Sign Up

Re-determinizing Information Set Monte Carlo Tree Search in Hanabi

02/16/2019
by   James Goodman, et al.
janigo.co.uk
0

This technical report documents the winner of the Computational Intelligence in Games(CIG) 2018 Hanabi competition. We introduce Re-determinizing IS-MCTS, a novel extension of Information Set Monte Carlo Tree Search (IS-MCTS) IS-MCTS that prevents a leakage of hidden information into opponent models that can occur in IS-MCTS, and is particularly severe in Hanabi. Re-determinizing IS-MCTS scores higher in Hanabi for 2-4 players than previously published work. Given the 40ms competition time limit per move we use a learned evaluation function to estimate leaf node values and avoid full simulations during MCTS. For the Mixed track competition, in which the identity of the other players is unknown, a simple Bayesian opponent model is used that is updated as each game proceeds.

READ FULL TEXT
07/18/2018

Traditional Wisdom and Monte Carlo Tree Search Face-to-Face in the Card Game Scopone

We present the design of a competitive artificial intelligence for Scopo...
05/14/2020

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

Advances in intelligent game playing agents have led to successes in per...
05/22/2023

Know your Enemy: Investigating Monte-Carlo Tree Search with Opponent Models in Pommerman

In combination with Reinforcement Learning, Monte-Carlo Tree Search has ...
01/30/2019

Learning Position Evaluation Functions Used in Monte Carlo Softmax Search

This paper makes two proposals for Monte Carlo Softmax Search, which is ...
03/08/2021

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

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

Optimizing αμ

αμ is a search algorithm which repairs two defaults of Perfect Informati...
10/05/2021

Deep Synoptic Monte Carlo Planning in Reconnaissance Blind Chess

This paper introduces deep synoptic Monte Carlo planning (DSMCP) for lar...