{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T07:24:04Z","timestamp":1778570644550,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319149226","type":"print"},{"value":"9783319149233","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14923-3_4","type":"book-chapter","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T14:04:52Z","timestamp":1418479492000},"page":"45-63","source":"Crossref","is-referenced-by-count":10,"title":["Monte-Carlo Tree Search and Minimax Hybrids with Heuristic Evaluation Functions"],"prefix":"10.1007","author":[{"given":"Hendrik","family":"Baier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2-3","key":"4_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. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Baier, H., Winands, M.H.M.: Monte-Carlo Tree Search and Minimax Hybrids. In: 2013 IEEE Conference on Computational Intelligence and Games, CIG 2013, pp. 129\u2013136 (2013)","DOI":"10.1109\/CIG.2013.6633630"},{"issue":"4","key":"4_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":"1","key":"4_CR4","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 Transactions on Computational Intelligence and AI in Games\u00a04(1), 1\u201343 (2012)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"3","key":"4_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., van den Herik, H.J., Uiterwijk, J.W.H.M., 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":"4_CR6","unstructured":"Clune, J.E.: Heuristic Evaluation Functions for General Game Playing. Ph.D. thesis, University of California, Los Angeles, USA (2008)"},{"key":"4_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":"4_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":"4_CR9","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining Online and Offline Knowledge in UCT. In: Ghahramani, Z. (ed.) 24th International Conference on Machine Learning, ICML 2007. ACM International Conference Proceeding Series, vol.\u00a0227, pp. 273\u2013280 (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"4_CR10","unstructured":"Gelly, S., Wang, Y., Munos, R., Teytaud, O.: Modification of UCT with Patterns in Monte-Carlo Go. Tech. rep., HAL - CCSd - CNRS, France (2006)"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Computers and Games","year":"2008","unstructured":"van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.): CG 2008. LNCS, vol.\u00a05131. Springer, Heidelberg (2008)"},{"issue":"4","key":"4_CR12","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":"4_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":"4_CR14","doi-asserted-by":"crossref","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 (2014)","DOI":"10.1109\/CIG.2014.6932903"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Lorentz, R.J.: Amazons Discover Monte-Carlo. In: van den Herik (ed.) [11], pp. 13\u201324","DOI":"10.1007\/978-3-540-87608-3_2"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/978-3-319-09165-5_5","volume-title":"Computer and Games","author":"R. Lorentz","year":"2014","unstructured":"Lorentz, R., Horey, T.: Programming breakthrough. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol.\u00a08427, pp. 49\u201359. Springer, Heidelberg (2014)"},{"issue":"3","key":"4_CR17","doi-asserted-by":"crossref","first-page":"140","DOI":"10.3233\/ICG-2011-34303","volume":"34","author":"R.J. Lorentz","year":"2011","unstructured":"Lorentz, R.J.: Experiments with Monte-Carlo Tree Search in the Game of Havannah. ICGA Journal\u00a034(3), 140\u2013149 (2011)","journal-title":"ICGA Journal"},{"key":"4_CR18","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":"J.(P.) A.M. 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.\u00a07168, pp. 72\u201383. Springer, Heidelberg (2012)"},{"key":"4_CR19","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":"4_CR20","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":"4_CR21","unstructured":"Ramanujan, R., Sabharwal, A., Selman, B.: On the Behavior of UCT in Synthetic Search Spaces. In: ICAPS 2011 Workshop on Monte-Carlo Tree Search: Theory and Applications (2011)"},{"key":"4_CR22","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"},{"issue":"2","key":"4_CR23","doi-asserted-by":"crossref","first-page":"80","DOI":"10.3233\/ICG-2010-33203","volume":"33","author":"Y. Sato","year":"2010","unstructured":"Sato, Y., Takahashi, D., Grimbergen, R.: A Shogi Program Based on Monte-Carlo Tree Search. ICGA Journal\u00a033(2), 80\u201392 (2010)","journal-title":"ICGA Journal"},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Silver, D., Tesauro, G.: Monte-Carlo Simulation Balancing. In: Danyluk, A.P., Bottou, L., Littman, M.L. (eds.) 26th Annual International Conference on Machine Learning, ICML 2009. ACM International Conference Proceeding Series, vol.\u00a0382, pp. 945\u2013952. ACM (2009)","DOI":"10.1145\/1553374.1553495"},{"issue":"4","key":"4_CR25","doi-asserted-by":"crossref","first-page":"195","DOI":"10.3233\/ICG-2008-31402","volume":"31","author":"N.R. Sturtevant","year":"2008","unstructured":"Sturtevant, N.R.: An Analysis of UCT in Multi-Player Games. ICGA Journal\u00a031(4), 195\u2013208 (2008)","journal-title":"ICGA Journal"},{"issue":"4","key":"4_CR26","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"},{"key":"4_CR27","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":"4_CR28","doi-asserted-by":"crossref","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y., Saito, J.T.: Monte-Carlo Tree Search Solver. In: van den Herik, et al. (eds.) [11], pp. 25\u201336","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-14923-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,30]],"date-time":"2023-07-30T17:30:42Z","timestamp":1690738242000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14923-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319149226","9783319149233"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14923-3_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}