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

研究成果: Article同行評審

1 引文 斯高帕斯(Scopus)

摘要

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.

原文English
頁(從 - 到)157-176
頁數20
期刊ICGA Journal
35
發行號3
DOIs
出版狀態Published - 1 一月 2012

指紋 深入研究「Selection search for mean and temperature of multi-branch combinatorial games」主題。共同形成了獨特的指紋。

引用此