Selection search for mean and temperature of multi-branch combinatorial games

Kuo Yuan Kao*, I-Chen Wu, Yi Cliang Shan, Shi Jim Yen

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

Abstract

This paper shows a new algorithm to calculate the mean and temperature of multi-branch combinatorial games. The algorithm expands gradually, one node at a time, the offspring of a game. After each step of expansion, the lower and upper bounds of the mean and temperature of the game are re-calculated. As the expanding process continues, the range between the lower and upper bounds is little by little narrowed. The key feature of the algorithm is its ability to generate a path of which the outcome is most likely to reduce the distance between the lower and upper bounds.

Original languageEnglish
Pages (from-to)157-176
Number of pages20
JournalICGA Journal
Volume35
Issue number3
DOIs
StatePublished - 1 Jan 2012

Fingerprint Dive into the research topics of 'Selection search for mean and temperature of multi-branch combinatorial games'. Together they form a unique fingerprint.

Cite this