Generalisation of Alpha-Beta Search for AND-OR Graphs with Partially Ordered Values
Abstract
We define a new setting related to the evaluation of AND-OR directed acyclic graphs with partially ordered values. Such graphs arise naturally when solving games with incomplete information (e.g. most card games such as Bridge) or games with multiple criteria. In particular, this setting generalises standard AND-OR graph evaluation and computation of optimal strategies in games with complete information. Under this setting, we propose a new algorithm which uses both alpha-beta pruning and cached values. In this paper, we present our algorithm, prove its correctness, and give experimental results on a card game with incomplete information.
Cite
Text
Li et al. "Generalisation of Alpha-Beta Search for AND-OR Graphs with Partially Ordered Values." International Joint Conference on Artificial Intelligence, 2022. doi:10.24963/IJCAI.2022/661Markdown
[Li et al. "Generalisation of Alpha-Beta Search for AND-OR Graphs with Partially Ordered Values." International Joint Conference on Artificial Intelligence, 2022.](https://mlanthology.org/ijcai/2022/li2022ijcai-generalisation/) doi:10.24963/IJCAI.2022/661BibTeX
@inproceedings{li2022ijcai-generalisation,
title = {{Generalisation of Alpha-Beta Search for AND-OR Graphs with Partially Ordered Values}},
author = {Li, Junkang and Zanuttini, Bruno and Cazenave, Tristan and Ventos, Véronique},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2022},
pages = {4769-4775},
doi = {10.24963/IJCAI.2022/661},
url = {https://mlanthology.org/ijcai/2022/li2022ijcai-generalisation/}
}