The Surprising Effectiveness of Approximate Value Iteration in Self-Play
Combining search with function approximation has driven major advances in game-playing programs, making self-play algorithms more competitive than ever. Still, the computational overhead of the most popular methods, based on Monte Carlo Tree Search (MCTS), can be substantial. In this work, we investigate whether simpler methods remain competitive in non-trivial, moderately sized games such as…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
