{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:42:40Z","timestamp":1725601360574},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642233968"},{"type":"electronic","value":"9783642233975"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23397-5_36","type":"book-chapter","created":{"date-parts":[[2011,8,18]],"date-time":"2011-08-18T07:40:06Z","timestamp":1313653206000},"page":"365-376","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Parallel Monte-Carlo Tree Search for HPC Systems"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Graf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ulf","family":"Lorenz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Platzner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lars","family":"Schaefers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","first-page":"235","volume-title":"Machine Learning","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-Time Analysis of the Multiarmed Bandit Problem. In: Machine Learning, vol.\u00a047, pp. 235\u2013256. Kluwer Academic, Dordrecht (2002)"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Bourki, A., Chaslot, G.M.J.-B., Coulm, M., Danjean, V., Doghmen, H., Hoock, J.-B., H\u00e9rault, T., Rimmel, A., Teytaud, F., Teytaud, O., Vayssi\u00e9re, P., Yu, Z.: Scalability and Parallelization of Monte-Carlo Tree Search. In: International Conference on Computers and Games, pp. 48\u201358 (2010)","DOI":"10.1007\/978-3-642-17928-0_5"},{"key":"36_CR3","doi-asserted-by":"crossref","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., Jaap van den Herik, H.: Parallel Monte-Carlo Tree Search. In: Conference on Computers and Games, pp. 60\u201371 (2008)","DOI":"10.1007\/978-3-540-87608-3_6"},{"key":"36_CR4","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)"},{"issue":"4","key":"36_CR5","doi-asserted-by":"crossref","first-page":"198","DOI":"10.3233\/ICG-2007-30403","volume":"30","author":"R. Coulom","year":"2007","unstructured":"Coulom, R.: Computing Elo Ratings of Move Patterns in the Game of Go. ICGA Journal\u00a030(4), 198\u2013208 (2007)","journal-title":"ICGA Journal"},{"key":"36_CR6","volume-title":"18th International Parallel and Distributed Processing Symposium","author":"C. Donninger","year":"2004","unstructured":"Donninger, C., Kure, A., Lorenz, U.: Parallel Brutus: The First Distributed, FPGA Accelerated Chess Program. In: 18th International Parallel and Distributed Processing Symposium. IEEE Computer Society, Los Alamitos (2004)"},{"key":"36_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-12993-3_2","volume-title":"Advances in Computer Games","author":"M. Enzenberger","year":"2010","unstructured":"Enzenberger, M., M\u00fcller, M.: A Lock-Free Multithreaded Monte-Carlo Tree Search Algorithm. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol.\u00a06048, pp. 14\u201320. Springer, Heidelberg (2010)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/3-540-55488-2_32","volume-title":"Data Structures and Efficient Algorithms","author":"R. Feldmann","year":"1992","unstructured":"Feldmann, R., Mysliwietz, P., Monien, B.: Distributed game tree search on a massively parallel system. In: Monien, B., Ottmann, T. (eds.) Data Structures and Efficient Algorithms. LNCS, vol.\u00a0594, pp. 270\u2013288. Springer, Heidelberg (1992)"},{"key":"36_CR9","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modifications of UCT with Patterns in Monte-Carlo Go. Technical Report 6062, INRIA (2006)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-540-85451-7_62","volume-title":"Euro-Par 2008 Parallel Processing","author":"K. Himstedt","year":"2008","unstructured":"Himstedt, K., Lorenz, U., M\u00f6ller, D.P.F.: A twofold distributed game-tree search approach using interconnected clusters. In: Luque, E., Margalef, T., Ben\u00edtez, D. (eds.) Euro-Par 2008. LNCS, vol.\u00a05168, pp. 587\u2013598. Springer, Heidelberg (2008)"},{"key":"36_CR11","doi-asserted-by":"crossref","unstructured":"Huang, S.-C., Coulom, R., Lin, S.-S.: Monte-Carlo Simulation Balancing in Practice. In: Conference on Computers and Games, pp. 81\u201392 (2010)","DOI":"10.1007\/978-3-642-17928-0_8"},{"key":"36_CR12","first-page":"293","volume-title":"Artificial Intelligence","author":"E. Donald Knuth","year":"1975","unstructured":"Donald Knuth, E., Moore, R.W.: An Analysis of Alpha-Beta Pruning. In: Artificial Intelligence, vol.\u00a06, pp. 293\u2013327. North-Holland Publishing Company, Amsterdam (1975)"},{"key":"36_CR13","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)"},{"key":"36_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1007\/3-540-45706-2_57","volume-title":"Euro-Par 2002. Parallel Processing","author":"U. Lorenz","year":"2002","unstructured":"Lorenz, U.: Parallel controlled conspiracy number search. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol.\u00a02400, pp. 420\u2013430. Springer, Heidelberg (2002)"},{"key":"36_CR15","unstructured":"Romein, J.W., Plaat, A., Bal, H.E., Schaeffer, J.: Transposition table driven work scheduling in distributed search. In: National Conference on Artificial Intelligence, pp. 725\u2013731 (1999)"},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"Segal, R.B.: On the Scalability of Parallel UCT. In: International Conference on Computer and Games, pp. 36\u201347 (2010)","DOI":"10.1007\/978-3-642-17928-0_4"},{"key":"36_CR17","unstructured":"Silver, D.: Reinforcement Learning and Simulation-Based Search in Computer Go. PhD thesis, University of Alberta (2009)"},{"key":"36_CR18","doi-asserted-by":"crossref","unstructured":"Silver, D., Tesauro, G.: Monte-Carlo Simulation Balancing. In: International Conference on Machine Learning, pp. 945\u2013952 (2009)","DOI":"10.1145\/1553374.1553495"}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2011 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23397-5_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:46:29Z","timestamp":1587343589000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23397-5_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642233968","9783642233975"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23397-5_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}