Skip to Main content Skip to Navigation
Conference papers

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 random games and on a card game with incomplete information.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-03658925
Contributor : Bruno Zanuttini Connect in order to contact the contributor
Submitted on : Wednesday, May 4, 2022 - 1:18:08 PM
Last modification on : Saturday, June 25, 2022 - 9:57:38 AM

File

main.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03658925, version 1

Citation

Junkang Li, Tristan Cazenave, Bruno Zanuttini, Véronique Ventos. Generalisation of alpha-beta search for AND-OR graphs with partially ordered values. 16es Journées d'Intelligence Artificielle Fondamentale (JIAF 2022), Jun 2022, Saint-Étienne, France. ⟨hal-03658925⟩

Share

Metrics

Record views

13

Files downloads

4