IJCAI 2022poster12 citations
Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values
Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos
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.
Search: Game PlayingMultidisciplinary Topics and Applications: Computer Games
BibTeX
@inproceedings{ijcai2022p661,
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 = {Proceedings of the Thirty-First International Joint Conference on
Artificial Intelligence, {IJCAI-22}},
publisher = {International Joint Conferences on Artificial Intelligence Organization},
editor = {Lud De Raedt},
pages = {4769--4775},
year = {2022},
month = {7},
note = {Main Track},
doi = {10.24963/ijcai.2022/661},
url = {https://doi.org/10.24963/ijcai.2022/661},
}