4 papers
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…
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…
The Mathematical Game
Marc Pierre, Quentin Cohen-Solal, Tristan Cazenave
Monte Carlo Tree Search can be used for automated theorem proving. Holophrasm is a neural theorem prover using MCTS combined with neural networks for the policy and the evaluation.…
Learning to Play Stochastic Two-player Perfect-Information Games without Knowledge
Quentin Cohen-Solal, Tristan Cazenave
In this paper, we extend the Descent framework, which enables learning and planning in the context of two-player games with perfect information, to the framework of stochastic game…