2 papers
cs.AI2026
The Surprising Effectiveness of Approximate Value Iteration in Self-Play
Raphael Boige, Amine Boumaza, Bruno Scherrer
Combining search with function approximation has driven major advances in game-playing programs, making self-play algorithms more competitive than ever. Still, the computational ov…
cs.AI2025
AlphaBeta is not as good as you think: a simple class of synthetic games for a better analysis of deterministic game-solving algorithms
Raphaël Boige, Amine Boumaza, Bruno Scherrer
Deterministic game-solving algorithms are conventionally analyzed in the light of their average-case complexity against a distribution of random game-trees, where leaf values are i…