Optimal strategy in games with chance nodes

Melkó Ervin and Nagy Benedek: Optimal strategy in games with chance nodes. In: Acta cybernetica, (18) 2. pp. 171-192. (2007)

[thumbnail of Melko_2007_ActaCybernetica.pdf]
Cikk, tanulmány, mű

Download (1MB) | Preview


In this paper, games with chance nodes are analysed. The evaluation of these game trees uses the expectiminimax algorithm. We present pruning techniques involving random effects. The gamma-pruning aims at increasing the efficiency of expectiminimax (analogously to alpha-beta pruning and the classical minimax). Some interesting properties of these games are shown: for instance, a game without draw can be fair. A fair game may not be fair any more if it is played iteratively. To handle these phenomena, the use of additional indicators, such as the minimal guaranteed outcome value, is suggested.

Item Type: Article
Journal or Publication Title: Acta cybernetica
Date: 2007
Volume: 18
Number: 2
ISSN: 0324-721X
Page Range: pp. 171-192
Language: English
Place of Publication: Szeged
Event Title: Symposium of Young Scientists on Intelligent Systems (1.) (2006) (Budapest)
Related URLs: http://acta.bibl.u-szeged.hu/38524/
Uncontrolled Keywords: Számítástechnika, Kibernetika
Additional Information: Bibliogr.: p. 191-192. ; összefoglalás angol nyelven
Subjects: 01. Natural sciences
01. Natural sciences > 01.02. Computer and information sciences
Date Deposited: 2016. Oct. 15. 12:25
Last Modified: 2022. Jun. 16. 13:57
URI: http://acta.bibl.u-szeged.hu/id/eprint/12810

Actions (login required)

View Item View Item