{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:32Z","timestamp":1725474332110},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318658"},{"type":"electronic","value":"9783642318665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31866-5_7","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T21:51:08Z","timestamp":1342648268000},"page":"72-83","source":"Crossref","is-referenced-by-count":9,"title":["Playout Search for Monte-Carlo Tree Search in Multi-player Games"],"prefix":"10.1007","author":[{"given":"J. A. M.","family":"Nijssen","sequence":"first","affiliation":[]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","first-page":"466","volume-title":"Proceedings of the ACM Annual Conference","author":"S.G. Akl","year":"1977","unstructured":"Akl, S.G., Newborn, M.M.: The Principal Continuation and the Killer Heuristic. In: Proceedings of the ACM Annual Conference, pp. 466\u2013473. ACM, New York (1977)"},{"issue":"1","key":"7_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCIAIG.2009.2018702","volume":"1","author":"Y. Bj\u00f6rnsson","year":"2009","unstructured":"Bj\u00f6rnsson, Y., Finnsson, H.: CadiaPlayer: A simulation-based general game player. IEEE Transactions on Computational Intelligence and AI in Games\u00a01(1), 4\u201315 (2009)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"4","key":"7_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/j.ins.2004.04.010","volume":"175","author":"B. Bouzy","year":"2005","unstructured":"Bouzy, B.: Associating domain-dependent knowledge and Monte Carlo approaches within a go program. Information Sciences\u00a0175(4), 247\u2013257 (2005)","journal-title":"Information Sciences"},{"issue":"3","key":"7_CR4","first-page":"175","volume":"19","author":"D.M. Breuker","year":"1996","unstructured":"Breuker, D.M., Uiterwijk, J.W.H.H., van den Herik, H.J.: Replacement Schemes and Two-Level Tables. ICCA Journal\u00a019(3), 175\u2013180 (1996)","journal-title":"ICCA Journal"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-87608-3_5","volume-title":"Computers and Games","author":"T. Cazenave","year":"2008","unstructured":"Cazenave, T.: Multi-player Go. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 50\u201359. Springer, Heidelberg (2008)"},{"issue":"3","key":"7_CR6","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":"7_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":"7_CR8","doi-asserted-by":"crossref","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation Control in General Game Playing Agents. In: IJCAI 2009 Workshop on General Intelligence in Game Playing Agents, pp. 21\u201326 (2009)","DOI":"10.1109\/CIG.2009.5286513"},{"issue":"4","key":"7_CR9","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":"7_CR10","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":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-17928-0_10","volume-title":"Computers and Games","author":"R.J. Lorentz","year":"2011","unstructured":"Lorentz, R.J.: Improving Monte\u2013Carlo Tree Search in Havannah. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 105\u2013115. Springer, Heidelberg (2011)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/11922155_16","volume-title":"Advances in Computer Games","author":"U. Lorenz","year":"2006","unstructured":"Lorenz, U., Tscheuschner, T.: Player Modeling, Search Algorithms and Strategies in Multi-player Games. In: van den Herik, H.J., Hsu, S.-C., Hsu, T.-s., Donkers, H.H.L.M(J.) (eds.) ACG 11. LNCS, vol.\u00a04250, pp. 210\u2013224. Springer, Heidelberg (2006)"},{"key":"7_CR13","unstructured":"Luckhart, C., Irani, K.B.: An algorithmic solution of n-person games. In: Proceedings of the 5th National Conference on Artificial Intelligence (AAAI), vol.\u00a01, pp. 158\u2013162 (1986)"},{"issue":"1","key":"7_CR14","first-page":"3","volume":"9","author":"T.A. Marsland","year":"1986","unstructured":"Marsland, T.A.: A review of game-tree pruning. ICCA Journal\u00a09(1), 3\u201319 (1986)","journal-title":"ICCA Journal"},{"key":"7_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-17928-0_22","volume-title":"Computers and Games","author":"J.A.M. Nijssen","year":"2011","unstructured":"Nijssen, J.A.M., Winands, M.H.M.: Enhancements for Multi-Player Monte-Carlo Tree Search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 238\u2013249. Springer, Heidelberg (2011)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-17928-0_6","volume-title":"Computers and Games","author":"A. Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Teytaud, O.: Biasing Monte-Carlo Simulations through RAVE Values. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 59\u201368. Springer, Heidelberg (2011)"},{"key":"7_CR17","volume-title":"A Gamut of Games","author":"S. Sackson","year":"1969","unstructured":"Sackson, S.: A Gamut of Games. Random House, New York (1969)"},{"issue":"1","key":"7_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/TCIAIG.2011.2107323","volume":"3","author":"M.P.D. Schadd","year":"2011","unstructured":"Schadd, M.P.D., Winands, M.H.M.: Best Reply Search for Multiplayer Games. IEEE Transactions on Computational Intelligence and AI in Games\u00a03(1), 57\u201366 (2011)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-540-87608-3_4","volume-title":"Computers and Games","author":"N.R. Sturtevant","year":"2008","unstructured":"Sturtevant, N.R.: An Analysis of UCT in Multi-player Games. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 37\u201349. Springer, Heidelberg (2008)"},{"key":"7_CR20","unstructured":"Sturtevant, N.R., Korf, R.E.: On pruning techniques for multi-player games. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence, pp. 201\u2013207. AAAI Press \/ The MIT Press (2000)"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y.: \u03b1\u03b2-based Play-outs in Monte-Carlo Tree Search. In: 2011 IEEE Conference on Computational Intelligence and Games (CIG 2011), pp. 110\u2013117. IEEE Press (2011)","DOI":"10.1109\/CIG.2011.6031996"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/TCIAIG.2010.2061050","volume":"2","author":"M.H.M. Winands","year":"2010","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte Carlo Tree Search in Lines of Action. IEEE Transactions on Computational Intelligence and AI in Games\u00a02(4), 239\u2013250 (2010)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"}],"container-title":["Lecture Notes in Computer Science","Advances in Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31866-5_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:20:19Z","timestamp":1556925619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31866-5_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318658","9783642318665"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31866-5_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}