Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values

Generalisation of Alpha-Beta Search for AND-OR Graphs With Partially Ordered Values

Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence
Main Track. Pages 4769-4775. https://doi.org/10.24963/ijcai.2022/661

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.
Keywords:
Search: Game Playing
Multidisciplinary Topics and Applications: Computer Games