SELECTION SEARCH FOR MEAN AND TEMPERATURE OF MULTI-BRANCH COMBINATORIAL GAMES
| dc.citation.epage | 176 | en_US |
| dc.citation.issue | 3 | en_US |
| dc.citation.spage | 157 | en_US |
| dc.citation.volume | 35 | en_US |
| dc.citation.woscount | 0 | en_US |
| dc.contributor.author | Kao, Kuo-Yuan | en_US |
| dc.contributor.author | Wu, I-Chen | en_US |
| dc.contributor.author | Shan, Yi-Chang | en_US |
| dc.contributor.author | Yen, Shi-Jim | en_US |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2019-04-03T06:37:20Z | |
| dc.date.available | 2019-04-03T06:37:20Z | |
| dc.date.issued | 2012-09-01 | en_US |
| dc.description.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. | en_US |
| dc.identifier.doi | 10.3233/ICG-2012-35303 | en_US |
| dc.identifier.issn | 1389-6911 | en_US |
| dc.identifier.journal | ICGA JOURNAL | en_US |
| dc.identifier.uri | http://dx.doi.org/10.3233/ICG-2012-35303 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/25246 | |
| dc.identifier.wosnumber | WOS:000209088700002 | en_US |
| dc.language.iso | en_US | en_US |
| dc.title | SELECTION SEARCH FOR MEAN AND TEMPERATURE OF MULTI-BRANCH COMBINATORIAL GAMES | en_US |
| dc.type | Article | en_US |