AI Chat AI Image Generator AI Video Text to Speech

The αμ Search Algorithm for the Game of Bridge

11/18/2019

∙

by Tristan Cazenave, et al.

∙

∙

αμ is an anytime heuristic search algorithm for incomplete information games that assumes perfect information for the opponents. αμ addresses the strategy fusion and non-locality problems encountered by Perfect Information Monte Carlo sampling. In this paper αμ is applied to the game of Bridge.

Tristan Cazenave
27 publications
Véronique Ventos
3 publications

page 1

page 2

page 3

page 4

research

∙ 01/29/2021

Optimizing αμ

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

0 Tristan Cazenave, et al. ∙

research

∙ 06/03/2011

GIB: Imperfect Information in a Computationally Challenging Game

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

0 M. L. Ginsberg, et al. ∙

research

∙ 08/07/2020

Perfect Reconstruction of Sparse Signals via Greedy Monte-Carlo Search

We propose a Monte-Carlo-based method for reconstructing sparse signals ...

0 Kao Hayash, et al. ∙

research

∙ 02/08/2023

Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge

In this paper, we extend the Descent framework, which enables learning a...

0 Quentin Cohen-Solal, et al. ∙

research

∙ 03/22/2019

Improving Search with Supervised Learning in Trick-Based Card Games

In trick-taking card games, a two-step process of state sampling and eva...

0 Christopher Solinas, et al. ∙

research

∙ 01/10/2021

Stabilized Nested Rollout Policy Adaptation

Nested Rollout Policy Adaptation (NRPA) is a Monte Carlo search algorith...

0 Tristan Cazenave, et al. ∙

research

∙ 05/11/2020

A Game Theoretic Approach for Parking Spot Search with Limited Parking Lot Information

We propose a game theoretic approach to address the problem of searching...

0 Yutong Li, et al. ∙