{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T21:11:36Z","timestamp":1776114696087,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540876076","type":"print"},{"value":"9783540876083","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87608-3_6","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"60-71","source":"Crossref","is-referenced-by-count":136,"title":["Parallel Monte-Carlo Tree Search"],"prefix":"10.1007","author":[{"given":"Guillaume M. J. -B.","family":"Chaslot","sequence":"first","affiliation":[]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","unstructured":"KGS Go Server Tournaments, \n                    http:\/\/www.weddslist.com\/kgs\/past\/index.html"},{"key":"6_CR2","unstructured":"Computer Go Server (2008), \n                    http:\/\/cgos.boardspace.net"},{"key":"6_CR3","first-page":"93","volume-title":"Proceedings of the Computer Games Workshop 2007 (CGW 2007)","author":"T. Cazenave","year":"2007","unstructured":"Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M.P.D. (eds.) Proceedings of the Computer Games Workshop 2007 (CGW 2007), The Netherlands, pp. 93\u2013101. Universiteit Maastricht, Maastricht (2007)"},{"key":"6_CR4","unstructured":"Chaslot, G.M.J.-B., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo Strategies for Computer Go. In: Schobbens, P.-Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, pp. 83\u201390 (2006)"},{"issue":"3","key":"6_CR5","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"G.M.J.-B. Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo Tree Search. New Mathematics and Natural Computation\u00a04(3), 343\u2013357 (2008)","journal-title":"New Mathematics and Natural Computation"},{"key":"6_CR6","unstructured":"Coquelin, P.-A., Munos, R.: Bandit algorithms for tree search. In: proceedings of Uncertainty in Artificial Intelligence, Vancouver, Canada (to appear, 2007)"},{"key":"6_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-540-75538-8_7","volume-title":"Computers and Games","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M(J.) (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"6_CR8","unstructured":"Gelly, S., Wang, Y.: Exploration Exploitation in Go: UCT for Monte-Carlo Go. In: Twentieth Annual Conference on Neural Information Processing Systems (NIPS 2006) (2006)"},{"issue":"2","key":"6_CR9","doi-asserted-by":"crossref","first-page":"111","DOI":"10.3233\/ICG-2007-30211","volume":"30","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Wang, Y.: Mogo wins 19\u00d719 go tournament. ICGA Journal\u00a030(2), 111\u2013112 (2007)","journal-title":"ICGA Journal"},{"key":"6_CR10","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modifications of UCT with Patterns in Monte-Carlo Go. Technical Report 6062, INRIA (2006)"},{"issue":"4","key":"6_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artificial Intelligence\u00a06(4), 293\u2013326 (1975)","journal-title":"Artificial Intelligence"},{"key":"6_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/11871842_29","volume-title":"Machine Learning: ECML 2006","author":"L. Kocsis","year":"2006","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit Based Monte-Carlo Planning. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) ECML 2006. LNCS (LNAI), vol.\u00a04212, pp. 282\u2013293. Springer, Heidelberg (2006)"}],"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-540-87608-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:51:41Z","timestamp":1715313101000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}