{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T12:48:29Z","timestamp":1725886109229},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319579689"},{"type":"electronic","value":"9783319579696"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-57969-6_5","type":"book-chapter","created":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T10:04:26Z","timestamp":1493373866000},"page":"57-70","source":"Crossref","is-referenced-by-count":0,"title":["A Rollout-Based Search Algorithm Unifying MCTS and Alpha-Beta"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Baier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,29]]},"reference":[{"issue":"2\u20133","key":"5_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"5_CR2","unstructured":"Baier, H.: Monte-Carlo Tree Search Enhancements for One-Player and Two-Player Domains. Ph.D. thesis, Maastricht University, Maastricht, The Netherlands (2015)"},{"key":"5_CR3","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-14923-3_4","volume-title":"Computer Games","author":"H Baier","year":"2014","unstructured":"Baier, H., Winands, M.H.M.: Monte-Carlo tree search and minimax hybrids with heuristic evaluation functions. In: Cazenave, T., Winands, M.H.M., Bj\u00f6rnsson, Y. (eds.) CGW 2014. CCIS, vol. 504, pp. 45\u201363. Springer, Cham (2014). doi: 10.1007\/978-3-319-14923-3_4"},{"issue":"2","key":"5_CR4","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1109\/TCIAIG.2014.2366555","volume":"7","author":"H Baier","year":"2015","unstructured":"Baier, H., Winands, M.H.M.: MCTS-minimax hybrids. IEEE Trans. Comput. Intell. AI Games 7(2), 167\u2013179 (2015)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., Powley, E.J., Whitehouse, D., Lucas, S.M., Cowling, P.I., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"1","key":"5_CR6","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/TCIAIG.2014.2316314","volume":"7","author":"J Chen","year":"2015","unstructured":"Chen, J., Wu, I., Tseng, W., Lin, B., Chang, C.: Job-level alpha-beta search. IEEE Trans. Comput. Intell. AI Games 7(1), 28\u201338 (2015)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"5_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. 4630, pp. 72\u201383. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75538-8_7"},{"key":"5_CR8","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Game-tree properties and MCTS performance. In: IJCAI 2011 Workshop on General Intelligence in Game Playing Agents (GIGA 2011), pp. 23\u201330 (2011)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Huang, B.: Pruning game tree by rollouts. In: Bonet, B., Koenig, S. (eds.) Twenty-Ninth AAAI Conference on Artificial Intelligence, AAAI 2015, pp. 1165\u20131173. AAAI Press (2015)","DOI":"10.1609\/aaai.v29i1.9371"},{"issue":"4","key":"5_CR10","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science (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. 4212, pp. 282\u2013293. Springer, Heidelberg (2006). doi: 10.1007\/11871842_29"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"Lanctot, M., Winands, M.H.M., Pepels, T., Sturtevant, N.R.: Monte Carlo tree search with heuristic evaluations using implicit minimax backups. In: 2014 IEEE Conference on Computational Intelligence and Games, CIG 2014, pp. 341\u2013348. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932903"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/978-3-319-27992-3_2","volume-title":"Advances in Computer Games","author":"R Lorentz","year":"2015","unstructured":"Lorentz, R.: Early Playout Termination in MCTS. In: Plaat, A., van den Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 12\u201319. Springer, Cham (2015). doi: 10.1007\/978-3-319-27992-3_2"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-31866-5_7","volume-title":"Advances in Computer Games","author":"JPAM Nijssen","year":"2012","unstructured":"Nijssen, J.P.A.M., Winands, M.H.M.: Playout search for Monte-Carlo tree search in multi-player games. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 72\u201383. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-31866-5_7"},{"issue":"1","key":"5_CR15","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1016\/0004-3702(95)00126-3","volume":"87","author":"A Plaat","year":"1996","unstructured":"Plaat, A., Schaeffer, J., Pijls, W., de Bruin, A.: Best-first fixed-depth minimax algorithms. Artif. Intell. 87(1), 255\u2013293 (1996)","journal-title":"Artif. Intell."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Ramanujan, R., Sabharwal, A., Selman, B.: On adversarial search spaces and sampling-based planning. In: Brafman, R.I., Geffner, H., Hoffmann, J., Kautz, H.A. (eds.) 20th International Conference on Automated Planning and Scheduling, ICAPS 2010, pp. 242\u2013245. AAAI (2010)","DOI":"10.1609\/icaps.v20i1.13437"},{"key":"5_CR17","unstructured":"Ramanujan, R., Sabharwal, A., Selman, B.: Understanding sampling style adversarial search methods. In: Gr\u00fcnwald, P., Spirtes, P. (eds.) 26th Conference on Uncertainty in Artificial Intelligence, UAI 2010, pp. 474\u2013483 (2010)"},{"key":"5_CR18","doi-asserted-by":"crossref","unstructured":"Ramanujan, R., Selman, B.: Trade-offs in sampling-based adversarial planning. In: Bacchus, F., Domshlak, C., Edelkamp, S., Helmert, M. (eds.) 21st International Conference on Automated Planning and Scheduling, ICAPS 2011. AAAI (2011)","DOI":"10.1609\/icaps.v21i1.13472"},{"key":"5_CR19","unstructured":"Weinstein, A., Littman, M.L., Goschin, S.: Rollout-based game-tree search outprunes traditional alpha-beta. In: Deisenroth, M.P., Szepesv\u00e1ri, C., Peters, J. (eds.) JMLR Proceedings Tenth European Workshop on Reinforcement Learning, EWRL 2012, vol. 24, pp. 155\u2013167 (2012)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y.: Alpha-beta-based play-outs in Monte-Carlo tree search. In: Cho, S.B., Lucas, S.M., Hingston, P. (eds.) 2011 IEEE Conference on Computational Intelligence and Games, CIG 2011, pp. 110\u2013117. IEEE (2011)","DOI":"10.1109\/CIG.2011.6031996"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-540-87608-3_3","volume-title":"Computers and Games","author":"MHM Winands","year":"2008","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.-T.: Monte-Carlo tree search solver. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 25\u201336. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-87608-3_3"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57969-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T09:48:15Z","timestamp":1692784095000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57969-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319579689","9783319579696"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57969-6_5","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}