AI Chat AI Image Generator AI Video Text to Speech

Monte Carlo Game Solver

01/15/2020

∙

by Tristan Cazenave, et al.

∙

∙

We present a general algorithm to order moves so as to speedup exact game solvers. It uses online learning of playout policies and Monte Carlo Tree Search. The learned policy and the information in the Monte Carlo tree are used to order moves in game solvers. They improve greatly the solving time for multiple games.

page 1

page 2

page 3

page 4

research

∙ 07/12/2018

Monte Carlo Methods for the Game Kingdomino

Kingdomino is introduced as an interesting game for studying game playin...

0 Magnus Gedda, et al. ∙

research

∙ 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...

0 Jack Reinhardt, et al. ∙

research

∙ 11/22/2022

Monte Carlo Forest Search: UNSAT Solver Synthesis via Reinforcement learning

We introduce Monte Carlo Forest Search (MCFS), an offline algorithm for ...

0 Chris Cameron, et al. ∙

research

∙ 12/14/2021

Split Moves for Monte-Carlo Tree Search

In many games, moves consist of several decisions made by the player. Th...

0 Jakub Kowalski, et al. ∙

research

∙ 04/09/2021

Batch Monte Carlo Tree Search

Making inferences with a deep neural network on a batch of states is muc...

0 Tristan Cazenave, et al. ∙

research

∙ 05/31/2019

Multiple Policy Value Monte Carlo Tree Search

Many of the strongest game playing programs use a combination of Monte C...

4 Li-Cheng Lan, et al. ∙

research

∙ 10/28/2018

P-MCGS: Parallel Monte Carlo Acyclic Graph Search

Recently, there have been great interests in Monte Carlo Tree Search (MC...

0 Chen Yu, et al. ∙