3 papers
cs.AI2026
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…
cs.AI2026
Generalized Rapid Action Value Estimation in Memory-Constrained Environments
Aloïs Rautureau, Tristan Cazenave, Ãric Piette
Generalized Rapid Action Value Estimation (GRAVE) has been shown to be a strong variant within the Monte-Carlo Tree Search (MCTS) family of algorithms for General Game Playing (GGP…
cs.AI2025
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…