1 citations · 1 across the 4 of their papers we have counts for
7 papers · 1 filter
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-sui…
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,…
On some improvements to Unbounded Minimax
Quentin Cohen-Solal, Tristan Cazenave
This paper presents the first experimental evaluation of four previously untested modifications of Unbounded Best-First Minimax algorithm. This algorithm explores the game tree by…
Learning to Play Two-Player Perfect-Information Games without Knowledge
Quentin Cohen-Solal
In this paper, several techniques for learning game state evaluation functions by reinforcement are proposed. The first is a generalization of tree bootstrapping (tree learning): i…
Study and improvement of search algorithms in two-players perfect information games
Quentin Cohen-Solal
Games, in their mathematical sense, are everywhere (game industries, economics, defense, education, chemistry, biology, ...).Search algorithms in games are artificial intelligence…