{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T20:10:09Z","timestamp":1746303009336,"version":"3.40.4"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091648"},{"type":"electronic","value":"9783319091655"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09165-5_7","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"72-83","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Analyzing Simulations in Monte-Carlo Tree Search for the Game of Go"],"prefix":"10.1007","author":[{"given":"Sumudu","family":"Fernando","sequence":"first","affiliation":[]},{"given":"Martin","family":"M\u00fcller","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Arneson, B., Hayward, R., Henderson, P.: Solving hex: beyond humans. In: van den Herik, H.J., et al. [13], pp. 1\u201310 (2011)","key":"7_CR1","DOI":"10.1007\/978-3-642-17928-0_1"},{"doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Hassidim, A.: The Bayesian learner is optimal for noisy binary search (and pretty good for quantum as well). In: FOCS, pp. 221\u2013230. IEEE, Washington, DC (2008)","key":"7_CR2","DOI":"10.1109\/FOCS.2008.58"},{"unstructured":"Dailey, D.: Computer Go Server (2007\u20132013). http:\/\/cgos.boardspace.net. Accessed 10 April 2013","key":"7_CR3"},{"unstructured":"Enzenberger, M.: GoGui (2007\u20132013). http:\/\/gogui.sourceforge.net. Accessed 10 April 2013","key":"7_CR4"},{"unstructured":"Enzenberger, M., M\u00fcller, M.: Fuego homepage (2008\u20132013). http:\/\/fuego.sf.net. Accessed 10 April 2013","key":"7_CR5"},{"doi-asserted-by":"crossref","unstructured":"Enzenberger, M., M\u00fcller, M., Arneson, B., Segal, R.: Fuego - an open-source framework for board games and Go engine based on Monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 2(4), 259\u2013270 (2010)","key":"7_CR6","DOI":"10.1109\/TCIAIG.2010.2083662"},{"doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML\u00a0\u201907: Proceedings of the 24th International Conference on Machine Learning, pp. 273\u2013280. ACM (2007)","key":"7_CR7","DOI":"10.1145\/1273496.1273531"},{"doi-asserted-by":"crossref","unstructured":"Huang, S., Coulom, R., Lin, S.: Monte-Carlo simulation balancing in practice. In: van den Herik, H.J., et al. [13], pp. 81\u201392 (2011)","key":"7_CR8","DOI":"10.1007\/978-3-642-17928-0_8"},{"unstructured":"Karp, R.M., Kleinberg, R.: Noisy binary search and its applications. In: SODA, pp. 881\u2013890. SIAM, Philadelphia, PA, USA (2007)","key":"7_CR9"},{"unstructured":"M\u00fcller, M.: Decomposition search: a combinatorial games approach to game tree search, with applications to solving Go endgames. In: IJCAI, pp. 578\u2013583, Stockholm, Sweden (1999)","key":"7_CR10"},{"doi-asserted-by":"crossref","unstructured":"Nowak, R.: Generalized binary search. In: Proceedings of the 46th Allerton Conference on Communications, Control, and Computing, pp. 568\u2013574 (2008)","key":"7_CR11","DOI":"10.1109\/ALLERTON.2008.4797609"},{"doi-asserted-by":"crossref","unstructured":"Silver, D., Tesauro, G.: Monte-Carlo simulation balancing. In: Danyluk, A., Bottou, L., Littman, M. (eds.) ICML, vol. 382, pp. 945\u2013952. ACM (2009)","key":"7_CR12","DOI":"10.1145\/1553374.1553495"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","volume-title":"Computers and Games","year":"2011","unstructured":"van den Herik, H.J., Iida, H., Plaat, A. (eds.): CG 2010. LNCS, vol. 6515. Springer, Heidelberg (2011)"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09165-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:36:24Z","timestamp":1746300984000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}