Optimal strategy in games with chance nodes

Authors

  • Ervin Melkó
  • Benedek Nagy

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.

Downloads

Download data is not yet available.

Downloads

Published

2007-01-01

How to Cite

Melkó, E., & Nagy, B. (2007). Optimal strategy in games with chance nodes. Acta Cybernetica, 18(2), 171–192. Retrieved from https://cyber.bibl.u-szeged.hu/index.php/actcybern/article/view/3712

Issue

Section

Regular articles

Most read articles by the same author(s)