標題: SELECTION SEARCH FOR MEAN AND TEMPERATURE OF MULTI-BRANCH COMBINATORIAL GAMES
作者: Kao, Kuo-Yuan
Wu, I-Chen
Shan, Yi-Chang
Yen, Shi-Jim
資訊工程學系
Department of Computer Science
公開日期: 1-Sep-2012
摘要: 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.
URI: http://dx.doi.org/10.3233/ICG-2012-35303
http://hdl.handle.net/11536/25246
ISSN: 1389-6911
DOI: 10.3233/ICG-2012-35303
期刊: ICGA JOURNAL
Volume: 35
Issue: 3
起始頁: 157
結束頁: 176
Appears in Collections:Articles


Files in This Item:

  1. 2f2fd926a02b13298662137ed107e896.pdf