2 citations · 2 across the 2 of their papers we have counts for
Showing cs.AIShow all
2 papers · 1 filter
cs.AI2021
Optimizing
Tristan Cazenave, Swann Legras, Véronique Ventos
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 Br…
cs.AI2019★ 2 cited
The αμ Search Algorithm for the Game of Bridge
Tristan Cazenave, Véronique Ventos
αμ is an anytime heuristic search algorithm for incomplete information games that assumes perfect information for the opponents. αμ addresses the strategy fusion and non-locality p…