{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:23:01Z","timestamp":1743042181354,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319091648"},{"type":"electronic","value":"9783319091655"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09165-5_8","type":"book-chapter","created":{"date-parts":[[2014,7,11]],"date-time":"2014-07-11T13:56:50Z","timestamp":1405087010000},"page":"84-99","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Anomalies of Pure Monte-Carlo Search in Monte-Carlo Perfect Games"],"prefix":"10.1007","author":[{"given":"Ingo","family":"Alth\u00f6fer","sequence":"first","affiliation":[]},{"given":"Wesley Michael","family":"Turner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,12]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","first-page":"179","DOI":"10.3233\/ICG-2011-34402","volume":"34","author":"I Alth\u00f6fer","year":"2011","unstructured":"Alth\u00f6fer, I.: On games with random-turn order and Monte Carlo perfectness. ICGA J. 34, 179\u2013190 (2011)","journal-title":"ICGA J."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.3233\/ICG-2011-34105","volume":"34","author":"C Browne","year":"2011","unstructured":"Browne, C.: On the dangers of random playouts. ICGA J. 34, 25\u201326 (2011)","journal-title":"ICGA J."},{"key":"8_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-540-87608-3_2","volume-title":"Computers and Games","author":"RJ Lorentz","year":"2008","unstructured":"Lorentz, R.J.: Amazons discover Monte-Carlo. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 13\u201324. Springer, Heidelberg (2008)"},{"key":"8_CR4","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)"},{"key":"8_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","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)"},{"key":"8_CR6","unstructured":"Alth\u00f6fer, I.: On the laziness of Monte Carlo game tree search in non-tight positions. Technical report, Friedrich Schiller University of Jena (2009). http:\/\/www.althofer.de\/mc-laziness.pdf"},{"key":"8_CR7","unstructured":"Alth\u00f6fer, I.: Game self-play with pure Monte Carlo: the basin structure. Technical report, Friedrich Schiller University of Jena (2010). http:\/\/www.althofer.de\/monte-carlo-basins-althoefer.pdf"},{"key":"8_CR8","unstructured":"Fischer, T.: Exakte Analyse von Heuristiken f\u00fcr kombinatorische Spiele. Ph.D. thesis, Fakultaet f\u00fcr Mathematik und Informatik, FSU Jena (2011). http:\/\/www.althofer.de\/dissertation_thomas-fischer.pdf (in German language) Single step and double step races are covered in Chap.\u00a02 of the dissertation"},{"key":"8_CR9","unstructured":"Nau, D.: Quality of decision versus depth of search on game trees. Ph.D. thesis, Duke University (1979)"},{"key":"8_CR10","first-page":"103","volume-title":"Advances in Computer Chess","author":"D Beal","year":"1980","unstructured":"Beal, D.: An analysis of minimax. In: Clarke, M. (ed.) Advances in Computer Chess, vol. 2, pp. 103\u2013109. Edinburgh University Press, Edinburgh (1980)"},{"key":"8_CR11","first-page":"101","volume-title":"Advances in Computer Chess","author":"G Schr\u00fcfer","year":"1986","unstructured":"Schr\u00fcfer, G.: Presence and absence of pathology on game trees. In: Beal, D. (ed.) Advances in Computer Chess, vol. 4, pp. 101\u2013112. Elsevier, Amsterdam (1986)"},{"key":"8_CR12","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, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"key":"8_CR13","unstructured":"Kahn, J.: Personal communication with I. Alth\u00f6fer (2013)"},{"key":"8_CR14","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm? In: Shisha, O. (ed.) Proceedings of the Third Symposium on Inequalities, pp. 159\u2013175. Academic Press, New York-London (1972)"},{"key":"8_CR15","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Game-tree properties and MCTS performance. In: IJCAI\u201911 Workshop on General Intelligence in Game Playing Agents, pp. 23\u201330 (2011)"},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1080\/00029890.2007.11920428","volume":"114","author":"Y Peres","year":"2007","unstructured":"Peres, Y., Schramm, O., Sheffield, S., Wilson, D.B.: Random-turn hex and other selection games. Amer. Math. Mon. 114, 373\u2013387 (2007)","journal-title":"Amer. Math. Mon."},{"key":"8_CR17","unstructured":"Wilson, D.B.: Hexamania - a computer program for playing random-turn hex, random-turn tripod, and the harmonic explorer game (2005). http:\/\/dbwilson.com\/hex\/"},{"key":"8_CR18","unstructured":"Br\u00fcgmann, B.: Monte Carlo go (1993). Not published officially, but available at several places online including. http:\/\/www.althofer.de\/Bruegmann-MonteCarloGo.pdf"}],"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-319-09165-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T18:23:36Z","timestamp":1676399016000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09165-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091648","9783319091655"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09165-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"12 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}