Generalisation of alpha-beta search for AND-OR graphs with partially ordered values - GREYC mad Access content directly
Reports Year : 2022

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.
Fichier principal
Vignette du fichier
hal.pdf (532.1 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03656224 , version 1 (02-05-2022)
hal-03656224 , version 2 (24-05-2022)

Identifiers

  • HAL Id : hal-03656224 , version 2

Cite

Junkang Li, Bruno Zanuttini, Tristan Cazenave, Véronique Ventos. Generalisation of alpha-beta search for AND-OR graphs with partially ordered values. [Research Report] GREYC CNRS UMR 6072, Universite de Caen. 2022. ⟨hal-03656224v2⟩
113 View
122 Download

Share

Gmail Facebook X LinkedIn More