{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T20:06:47Z","timestamp":1743106007504,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540876076"},{"type":"electronic","value":"9783540876083"}],"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_5","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"50-59","source":"Crossref","is-referenced-by-count":7,"title":["Multi-player Go"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0004-3702(01)00127-8","volume":"132","author":"B. Bouzy","year":"2001","unstructured":"Bouzy, B., Cazenave, T.: Computer Go: An AI-Oriented Survey. Artificial Intelligence\u00a0132(1), 39\u2013103 (2001)","journal-title":"Artificial Intelligence"},{"key":"5_CR2","unstructured":"Br\u00fcgmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)"},{"issue":"1","key":"5_CR3","doi-asserted-by":"crossref","first-page":"35","DOI":"10.3233\/ICG-2007-30104","volume":"30","author":"T. Cazenave","year":"2007","unstructured":"Cazenave, T.: Playing the right atari. ICGA Journal\u00a030(1), 35\u201342 (2007)","journal-title":"ICGA Journal"},{"key":"5_CR4","unstructured":"Cazenave, T., Jouandeau, N.: On the parallelization of UCT. In: Computer Games Workshop 2007, Amsterdam, The Netherlands, June 2007, pp. 93\u2013101 (2007)"},{"key":"5_CR5","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 back-up 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":"5_CR6","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: ICML, pp. 273\u2013280 (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"5_CR7","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with patterns in monte-carlo go. Technical Report 6062, INRIA (2006)"},{"key":"5_CR8","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)"},{"issue":"1","key":"5_CR9","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(91)90082-U","volume":"48","author":"R.E. Korf","year":"1991","unstructured":"Korf, R.E.: Multi-player alpha-beta pruning. Artif. Intell.\u00a048(1), 99\u2013111 (1991)","journal-title":"Artif. Intell."},{"key":"5_CR10","unstructured":"Loeb, D.E.: Stable winning coalitions. In: Games of No Chance, vol.\u00a029, pp. 451\u2013471 (1996)"},{"key":"5_CR11","unstructured":"Luckhart, C., Irani, K.B.: An algorithmic solution of n-person games. In: AAAI, pp. 158\u2013162 (1986)"},{"key":"5_CR12","unstructured":"Sturtevant, N.R.: Last-branch and speculative pruning algorithms for max\n                  n\n                . In: IJCAI, pp. 669\u2013678 (2003)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/11674399_20","volume-title":"Computers and Games","author":"N.R. Sturtevant","year":"2006","unstructured":"Sturtevant, N.R.: Current challenges in multi-player game search. In: van den Herik, H.J., Bj\u00f6rnsson, Y., Netanyahu, N.S. (eds.) CG 2004. LNCS, vol.\u00a03846, pp. 285\u2013300. Springer, Heidelberg (2006)"},{"key":"5_CR14","unstructured":"Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games. In: AAAI\/IAAI, pp. 201\u2013207 (2000)"}],"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_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:51:32Z","timestamp":1715313092000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}