{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T16:07:46Z","timestamp":1746288466832},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129926"},{"type":"electronic","value":"9783642129933"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12993-3_4","type":"book-chapter","created":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T08:43:37Z","timestamp":1272962617000},"page":"33-44","source":"Crossref","is-referenced-by-count":21,"title":["Evaluation Function Based Monte-Carlo LOA"],"prefix":"10.1007","author":[{"given":"Mark H. M.","family":"Winands","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yngvi","family":"Bj\u00f6rnsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/34.44404","volume":"12","author":"B. Abramson","year":"1990","unstructured":"Abramson, B.: Expected-outcome: A general model of static evaluation. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a012(2), 182\u2013193 (1990)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"4_CR2","first-page":"231","volume-title":"Advances in Computer Games 10: Many Games, Many Challenges","author":"D. Billings","year":"2003","unstructured":"Billings, D., Bj\u00f6rnsson, Y.: Search and knowledge in Lines of Action. In: van den Herik, H.J., Iida, H., Heinz, E.A. (eds.) Advances in Computer Games 10: Many Games, Many Challenges, pp. 231\u2013248. Kluwer Academic Publishers, Boston (2003)"},{"key":"4_CR3","first-page":"159","volume-title":"Advances in Computer Games 10: Many Games, Many Challenges","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.) Advances in Computer Games 10: Many Games, Many Challenges, pp. 159\u2013174. Kluwer Academic Publishers, Boston (2003)"},{"key":"4_CR4","unstructured":"Br\u00fcgmann, B.: Monte Carlo Go. Technical report, Physics Department, Syracuse University (1993)"},{"issue":"3","key":"4_CR5","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"},{"key":"4_CR6","unstructured":"Cazenave, T., Jouandeau, N.: On the parallelization of UCT. 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), Universiteit Maastricht, Maastricht, The Netherlands, pp. 93\u2013101 (2007)"},{"issue":"3","key":"4_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":"4_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-540-87608-3_6","volume-title":"Computers and Games","author":"G.M.J.-B. Chaslot","year":"2008","unstructured":"Chaslot, G.M.J.-B., Winands, M.H.M., van den Herik, H.J.: Parallel monte-carlo tree search. In: van den Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol.\u00a05131, pp. 60\u201371. Springer, Heidelberg (2008)"},{"key":"4_CR9","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. (eds.) CG 2006. LNCS, vol.\u00a04630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"key":"4_CR10","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: Fox, D., Gomes, C.P. (eds.) Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, AAAI 2008, pp. 259\u2013264 (2008)"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1273496.1273531","volume-title":"Proceedings of the International Conference on Machine Learning (ICML)","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Ghahramani, Z. (ed.) Proceedings of the International Conference on Machine Learning (ICML), pp. 273\u2013280. ACM, New York (2007)"},{"key":"4_CR12","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_CR13","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":"R.J. 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.\u00a05131, pp. 13\u201324. Springer, Heidelberg (2008)"},{"key":"4_CR14","unstructured":"Sackson, S.: A Gamut of Games. Random House, New York (1969)"},{"issue":"3","key":"4_CR15","doi-asserted-by":"crossref","first-page":"132","DOI":"10.3233\/ICG-2002-25304","volume":"25","author":"Y. Tsuruoka","year":"2002","unstructured":"Tsuruoka, Y., Yokoyama, D., Chikayama, T.: Game-tree search algorithm based on realization probability. ICGA Journal\u00a025(3), 132\u2013144 (2002)","journal-title":"ICGA Journal"},{"key":"4_CR16","unstructured":"Winands, M.H.M.: Informed Search in Complex Games. PhD thesis, Universiteit Maastricht, Maastricht, The Netherlands (2004)"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1142\/S1793005708001070","volume":"4","author":"M.H.M. Winands","year":"2008","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y.: Enhanced realization probability search. New Mathematics and Natural Computation\u00a04(3), 329\u2013342 (2008)","journal-title":"New Mathematics and Natural Computation"},{"key":"4_CR18","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":"M.H.M. 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.\u00a05131, pp. 25\u201336. Springer, Heidelberg (2008)"},{"key":"4_CR19","unstructured":"Winands, M.H.M., van den Herik, H.J.: MIA: a world champion LOA program. In: The 11th Game Programming Workshop in Japan (GPW 2006), pp. 84\u201391 (2006)"},{"issue":"3","key":"4_CR20","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1142\/S1793005708001136","volume":"4","author":"P. Zhang","year":"2008","unstructured":"Zhang, P., Chen, K.-H.: Monte Carlo Go capturing tactic search. New Mathematics and Natural Computation\u00a04(3), 359\u2013367 (2008)","journal-title":"New Mathematics and Natural Computation"}],"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-12993-3_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,25]],"date-time":"2019-01-25T12:37:57Z","timestamp":1548419877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12993-3_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129926","9783642129933"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12993-3_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}