{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T03:08:08Z","timestamp":1769915288443,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540876076","type":"print"},{"value":"9783540876083","type":"electronic"}],"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_1","type":"book-chapter","created":{"date-parts":[[2008,9,23]],"date-time":"2008-09-23T11:35:11Z","timestamp":1222169711000},"page":"1-12","source":"Crossref","is-referenced-by-count":56,"title":["Single-Player Monte-Carlo Tree Search"],"prefix":"10.1007","author":[{"given":"Maarten P. D.","family":"Schadd","sequence":"first","affiliation":[]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[]},{"given":"H. Jaap","family":"van den Herik","sequence":"additional","affiliation":[]},{"given":"Guillaume M. J. -B.","family":"Chaslot","sequence":"additional","affiliation":[]},{"given":"Jos W. H. M.","family":"Uiterwijk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","unstructured":"Biedl, T.C., Demaine, E.D., Demaine, M.L., Fleischer, R., Jacobsen, L., Munro, I.: The Complexity of Clickomania. In: Nowakowski, R.J. (ed.) More Games of No Chance, Proc. MSRI Workshop on Combinatorial Games, pp. 389\u2013404. MSRI Publ., Berkeley. Cambridge University Press, Cambridge (2002)"},{"key":"1_CR2","volume-title":"Personal Communication","author":"D. Billings","year":"2007","unstructured":"Billings, D.: Personal Communication. University of Alberta, Canada (2007)"},{"issue":"1","key":"1_CR3","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., Cazanave, T.: Computer Go: An AI-Oriented Survey. Artificial Intelligence\u00a0132(1), 39\u2013103 (2001)","journal-title":"Artificial Intelligence"},{"key":"1_CR4","first-page":"159","volume-title":"Proceedings of the 10th Advances in Computer Games Conference (ACG-10)","author":"B. Bouzy","year":"2003","unstructured":"Bouzy, B., Helmstetter, B.: Monte-Carlo Go Developments. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Proceedings of the 10th Advances in Computer Games Conference (ACG-10), The Netherlands, pp. 159\u2013174. Kluwer Academic, Dordrecht (2003)"},{"key":"1_CR5","unstructured":"Br\u00fcgmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)"},{"issue":"3","key":"1_CR6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.3233\/ICG-2007-30311","volume":"30","author":"T. Cazenave","year":"2007","unstructured":"Cazenave, T., Borsboom, J.: Golois Wins Phantom Go Tournament. ICGA Journal\u00a030(3), 165\u2013166 (2007)","journal-title":"ICGA Journal"},{"issue":"3","key":"1_CR7","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":"1_CR8","unstructured":"Chaslot, G.M.J.B., de Jong, S., Saito, J.-T., Uiterwijk, J.W.H.M.: Monte-Carlo Tree Search in Production Management Problems. In: Schobbens, P.Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 91\u201398 (2006)"},{"key":"1_CR9","unstructured":"Chaslot, G.M.J.B., Saito, J.-T., Bouzy, B., Uiterwijk, J.W.H.M., van den Herik, H.J.: Monte-Carlo Strategies for Computer Go. In: Schobbens, P.Y., Vanhoof, W., Schwanen, G. (eds.) Proceedings of the 18th BeNeLux Conference on Artificial Intelligence, Namur, Belgium, pp. 83\u201391 (2006)"},{"key":"1_CR10","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":"3","key":"1_CR11","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1111\/0824-7935.00065","volume":"14","author":"J.C. Culberson","year":"1998","unstructured":"Culberson, J.C., Schaeffer, J.: Pattern databases. Computational Intelligence\u00a014(3), 318\u2013334 (1998)","journal-title":"Computational Intelligence"},{"key":"1_CR12","unstructured":"Felner, A., Zahavi, U., Schaeffer, J., Holte, R.C.: Dual Lookups in Pattern Databases. In: IJCAI, Edinburgh, Scotland, pp. 103\u2013108 (2005)"},{"key":"1_CR13","unstructured":"Gomes, C.P., Selman, B., McAloon, K., Tretkoff, C.: Randomization in Backtrack Search: Exploiting Heavy-Tailed Profiles for Solving Hard Scheduling Problems. In: AIPS, Pittsburg, PA, pp. 208\u2013213 (1998)"},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1109\/TSSC.1968.300136","volume":"4","author":"P.E. Hart","year":"1968","unstructured":"Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernatics\u00a04(2), 100\u2013107 (1968)","journal-title":"IEEE Transactions on Systems Science and Cybernatics"},{"key":"1_CR15","unstructured":"Junghanns, A.: Pushing the Limits: New Developments in Single Agent Search. PhD thesis, University of Alberta, Alberta, Canada (1999)"},{"issue":"1","key":"1_CR16","doi-asserted-by":"crossref","first-page":"13","DOI":"10.3233\/ICG-2008-31103","volume":"31","author":"G. Kendall","year":"2008","unstructured":"Kendall, G., Parkes, A., Spoerer, K.: A Survey of NP-Complete Puzzles. ICGA Journal\u00a031(1), 13\u201334 (2008)","journal-title":"ICGA Journal"},{"key":"1_CR17","series-title":"Lecture Notes in Artificial Intelligence","first-page":"282","volume-title":"Proceedings of the EMCL 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":"1_CR18","unstructured":"Kocsis, L., Szepesv\u00e1ri, C., Willemson, J.: Improved Monte-Carlo Search (2006), \n                    http:\/\/zaphod.aml.sztaki.hu\/papers\/cg06-ext.pdf"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0004-3702(85)90084-0","volume":"27","author":"R.E. Korf","year":"1985","unstructured":"Korf, R.E.: Depth-first iterative deepening: An optimal admissable tree search. Artificial Intelligence\u00a027(1), 97\u2013109 (1985)","journal-title":"Artificial Intelligence"},{"key":"1_CR20","unstructured":"Moribe, K.: Chain shot! Gekkan ASCII, (November 1985) (in Japanese)"},{"key":"1_CR21","unstructured":"PDA Game Guide.com. Pocket PC Jawbreaker Game. The Ultimate Guide to PDA Games, Retrieved 7.1.2008 (2008), \n                    http:\/\/www.pdagameguide.com\/jawbreaker-game.html"},{"key":"1_CR22","first-page":"157","volume-title":"Proceedings of the Computer Games Workshop 2007 (CGW 2007)","author":"A. Sadikov","year":"2007","unstructured":"Sadikov, A., Bratko, I.: Solving 20 \u00d7 20 Puzzles. In: van den Herik, H.J., Uiterwijk, J.W.H.M., Winands, M.H.M., Schadd, M.P.D. (eds.) Proceedings of the Computer Games Workshop 2007 (CGW 2007), The Netherlands, pp. 157\u2013164. Universiteit Maastricht, Maastricht (2007)"},{"key":"1_CR23","first-page":"1068","volume-title":"Advances in Neural Information Processing Systems","author":"G. Tesauro","year":"1997","unstructured":"Tesauro, G., Galperin, G.R.: On-line policy improvement using Monte Carlo search. In: Mozer, M.C., Jordan, M.I., Petsche, T. (eds.) Advances in Neural Information Processing Systems, vol.\u00a09, pp. 1068\u20131074. MIT Press, Cambridge (1997)"},{"key":"1_CR24","unstructured":"University of Alberta GAMES Group. GAMES Group News (Archives) (2002), \n                    http:\/\/www.cs.ualberta.ca\/~games\/archives.html"},{"key":"1_CR25","first-page":"434","volume-title":"AAAI","author":"N.R. Vempaty","year":"1991","unstructured":"Vempaty, N.R., Kumar, V., Korf, R.E.: Depth-first versus best-first search. In: AAAI, Anaheim, California, USA, pp. 434\u2013440. MIT Press, Cambridge (1991)"}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T03:50:52Z","timestamp":1715313052000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87608-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540876076","9783540876083"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87608-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}