Optimizing αμ

by   Tristan Cazenave, et al.

αμ is a search algorithm which repairs two defaults of Perfect Information Monte Carlo search: strategy fusion and non locality. In this paper we optimize αμ for the game of Bridge, avoiding useless computations. The proposed optimizations are general and apply to other imperfect information turn-based games. We define multiple optimizations involving Pareto fronts, and show that these optimizations speed up the search. Some of these optimizations are cuts that stop the search at a node, while others keep track of which possible worlds have become redundant, avoiding unnecessary, costly evaluations. We also measure the benefits of parallelizing the double dummy searches at the leaves of the αμ search tree.


page 1

page 2

page 3

page 4


The αμ Search Algorithm for the Game of Bridge

αμ is an anytime heuristic search algorithm for incomplete information g...

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

Customized Monte Carlo Tree Search for LLVM/Polly's Composable Loop Optimization Transformations

Polly is the LLVM project's polyhedral loop nest optimizer. Recently, us...

GIB: Imperfect Information in a Computationally Challenging Game

This paper investigates the problems arising in the construction of a pr...

Re-determinizing Information Set Monte Carlo Tree Search in Hanabi

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

A Standard Approach for Optimizing Belief Network Inference using Query DAGs

This paper proposes a novel, algorithm-independent approach to optimizin...

What can we learn from slow self-avoiding adaptive walks by an infinite radius search algorithm?

Slow self-avoiding adaptive walks by an infinite radius search algorithm...

Please sign up or login with your details

Forgot password? Click here to reset