Iterative Widening
Abstract
We propose a method to gradually expand the moves to consider at the nodes of game search trees. The algorithm is an extension of Abstract Proof Search, an algorithm that solves more problem than basic Alpha-Beta search in less time and which is more reliable. Unlike other related algorithms, iterative winding adapts to the game via genearal game definition functions. In the game of Go, it can solve more problems than the original non windening algorithm in approximately half of the time, as shown by the experimental results.
Cite
Text
Cazenave. "Iterative Widening." International Joint Conference on Artificial Intelligence, 2001.Markdown
[Cazenave. "Iterative Widening." International Joint Conference on Artificial Intelligence, 2001.](https://mlanthology.org/ijcai/2001/cazenave2001ijcai-iterative/)BibTeX
@inproceedings{cazenave2001ijcai-iterative,
title = {{Iterative Widening}},
author = {Cazenave, Tristan},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2001},
pages = {523-528},
url = {https://mlanthology.org/ijcai/2001/cazenave2001ijcai-iterative/}
}