| Institute of Informatics>>> Acta Cybernetica>>> Past Issues>>> Volume 18, Number 2, 2007>>> |
 Magyarul
|
Optimal strategy in games with chance nodes
Abstract (in LaTeX format)
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.
Keywords: game theory, artificial intelligence, game tree, games with chance nodes, expectiminimax algorithm, pruning, iterative games, fair games.
Full text
Available electronic editions: PDF.
Note that full text is available only for papers that are at least 3 years old. For more recent papers only the first page of the paper is provided.
BibTeX entry
@ARTICLE{Melko:2007:ActaCybernetica,author = {Ervin Melk\'o and Benedek Nagy},
title = {Optimal strategy in games with chance nodes},
journal = {Acta Cybernetica},
year = {2007},
volume = {18},
pages = {171--192},
number = {2},
abstract = {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. },
keywords = {game theory, artificial intelligence, game tree, games with chance nodes, expectiminimax algorithm, pruning, iterative games, fair games}
}