2 citations · 5 across the 11 of their papers we have counts for
4 papers · 1 filter
Study and Improvement of Search Algorithms in Multi-Player Perfect-Information Games
Quentin Cohen-Solal
In this article, we generalize Unbounded Minimax, the state-of-the-art search algorithm for zero sums two-player games with perfect information to the framework of multiplayer game…
Completeness of Unbounded Best-First Minimax and Descent Minimax
Quentin Cohen-Solal
In this article, we focus on search algorithms for two-player perfect information games, whose objective is to determine the best possible strategy, and ideally a winning strategy.…
Minibal: Balanced Game-Playing Without Opponent Modeling
Quentin Cohen-Solal, Tristan Cazenave
Recent advances in game AI, such as AlphaZero and Athénan, have achieved superhuman performance across a wide range of board games. While highly powerful, these agents are ill-suit…
Deciding the Satisfiability of Combined Qualitative Constraint Networks
Quentin Cohen-Solal, Alexandre Niveau, Maroua Bouzid
Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise,…