{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:25:29Z","timestamp":1725474329688},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642318658"},{"type":"electronic","value":"9783642318665"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31866-5_6","type":"book-chapter","created":{"date-parts":[[2012,7,18]],"date-time":"2012-07-18T21:51:08Z","timestamp":1342648268000},"page":"60-71","source":"Crossref","is-referenced-by-count":5,"title":["Monte-Carlo Tree Search Enhancements for Havannah"],"prefix":"10.1007","author":[{"given":"Jan A.","family":"Stankiewicz","sequence":"first","affiliation":[]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[]},{"given":"Jos W. H. M.","family":"Uiterwijk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1109\/TCIAIG.2010.2067212","volume":"2","author":"B. Arneson","year":"2010","unstructured":"Arneson, B., Hayward, R.B., Henderson, P.: Monte Carlo Tree Search in Hex. IEEE Transactions on Computational Intelligence and AI in Games\u00a02(4), 251\u2013258 (2010)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"4","key":"6_CR2","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1109\/TCIAIG.2010.2100396","volume":"2","author":"H. Baier","year":"2010","unstructured":"Baier, H., Drake, P.D.: The Power of Forgetting: Improving the Last-Good-Reply Policy in Monte Carlo Go. IEEE Transactions on Computational Intelligence and AI in Games\u00a02(4), 303\u2013309 (2010)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"issue":"1","key":"6_CR3","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/TCIAIG.2009.2018702","volume":"1","author":"Y. Bj\u00f6rnsson","year":"2009","unstructured":"Bj\u00f6rnsson, Y., Finnsson, H.: CadiaPlayer: A Simulation-Based General Game Player. IEEE Transactions on Computational Intelligence and AI in Games\u00a01(1), 4\u201315 (2009)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"key":"6_CR4","unstructured":"Chaslot, G.M.J.-B.: Monte-Carlo Tree Search. PhD thesis, Maastricht University, Maastricht, The Netherlands (2010)"},{"issue":"3","key":"6_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., 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":"6_CR6","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":"4","key":"6_CR7","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/ICG-2009-32404","volume":"32","author":"P.D. Drake","year":"2009","unstructured":"Drake, P.D.: The Last-Good-Reply Policy for Monte-Carlo Go. ICGA Journal\u00a032(4), 221\u2013227 (2009)","journal-title":"ICGA Journal"},{"key":"6_CR8","unstructured":"Fossel, J.D.: Monte-Carlo Tree Search Applied to the Game of Havannah. Bachelor\u2019s thesis, Maastricht University, Maastricht, The Netherlands (2010)"},{"key":"6_CR9","first-page":"14","volume":"14","author":"C. Freeling","year":"2003","unstructured":"Freeling, C.: Introducing Havannah. Abstract Games\u00a014, 14\u201320 (2003)","journal-title":"Abstract Games"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/1273496.1273531","volume-title":"Proceedings of the 24th International Conference on Machine Learning, ICML 2007","author":"S. Gelly","year":"2007","unstructured":"Gelly, S., Silver, D.: Combining Online and Offline Knowledge in UCT. In: Ghahramani, Z. (ed.) Proceedings of the 24th International Conference on Machine Learning, ICML 2007, pp. 273\u2013280. ACM Press, New York (2007)"},{"key":"6_CR11","unstructured":"Joosten, B.: Creating a Havannah Playing Agent. Bachelor\u2019s thesis, Maastricht University, Maastricht, The Netherlands (2009)"},{"issue":"4","key":"6_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":"6_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":"6_CR14","first-page":"596","volume-title":"AI Game Programming Wisdom","author":"F.D. Laram\u00e9e","year":"2002","unstructured":"Laram\u00e9e, F.D.: Using N-Gram Statistical Models to Predict Player Behavior. In: Rabin, S. (ed.) AI Game Programming Wisdom, pp. 596\u2013601. Charles River Media, Hingham (2002)"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TCIAIG.2009.2018703","volume":"1","author":"C.-S. Lee","year":"2009","unstructured":"Lee, C.-S., Wang, M.-H., Chaslot, G.M.J.-B., Hoock, J.-B., Rimmel, A., Teytaud, O., Tsai, S.-R., Hsu, S.-C., Hong, T.-P.: The Computational Intelligence of MoGo Revealed in Taiwan\u2019s Computer Go Tournaments. IEEE Transactions on Computational Intelligence and AI in Games\u00a01(1), 73\u201389 (2009)","journal-title":"IEEE Transactions on Computational Intelligence and AI in Games"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/978-3-642-17928-0_10","volume-title":"Computers and Games","author":"R.J. Lorentz","year":"2011","unstructured":"Lorentz, R.J.: Improving Monte\u2013Carlo Tree Search in Havannah. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 105\u2013115. Springer, Heidelberg (2011)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/978-3-642-17928-0_22","volume-title":"Computers and Games","author":"J.(P.) A.M. Nijssen","year":"2011","unstructured":"Nijssen, J(P.) A.M., Winands, M.H.M.: Enhancements for Multi-Player Monte-Carlo Tree Search. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 238\u2013249. Springer, Heidelberg (2011)"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-642-12239-2_21","volume-title":"Applications of Evolutionary Computation","author":"A. Rimmel","year":"2010","unstructured":"Rimmel, A., Teytaud, F.: Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search. In: Di Chio, C., Cagnoni, S., Cotta, C., Ebner, M., Ek\u00e1rt, A., Esparcia-Alcazar, A.I., Goh, C.-K., Merelo, J.J., Neri, F., Preu\u00df, M., Togelius, J., Yannakakis, G.N. (eds.) EvoApplicatons 2010. LNCS, vol.\u00a06024, pp. 201\u2013210. Springer, Heidelberg (2010)"},{"key":"6_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-642-17928-0_6","volume-title":"Computers and Games","author":"A. Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Teytaud, O.: Biasing Monte-Carlo Simulations through RAVE Values. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol.\u00a06515, pp. 59\u201368. Springer, Heidelberg (2011)"},{"issue":"1","key":"6_CR20","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/j.1538-7305.1951.tb01366.x","volume":"30","author":"C.E. Shannon","year":"1951","unstructured":"Shannon, C.E.: Predication and Entropy of Printed English. The Bell System Technical Journal\u00a030(1), 50\u201364 (1951)","journal-title":"The Bell System Technical Journal"},{"key":"6_CR21","unstructured":"Stankiewicz, J.A.: Knowledge-based Monte-Carlo Tree Search in Havannah. Master\u2019s thesis, Maastricht University, Maastricht, The Netherlands (2011)"},{"key":"6_CR22","volume-title":"Reinforcement Learning: An Introduction","author":"R.S. Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-642-12993-3_7","volume-title":"Advances in Computer Games","author":"F. Teytaud","year":"2010","unstructured":"Teytaud, F., Teytaud, O.: Creating an Upper-Confidence-Tree Program for Havannah. In: van den Herik, H.J., Spronck, P. (eds.) ACG 2009. LNCS, vol.\u00a06048, pp. 65\u201374. Springer, Heidelberg (2010)"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Teytaud, F., Teytaud, O.: On the Huge Benefit of Decisive Moves in Monte-Carlo Tree Search Algorithms. In: Yannakakis, G.N., Togelius, J. (eds.) Proceedings of the 2010 IEEE Conference on Computational Intelligence and Games (CIG 2010), pp. 359\u2013364. IEEE Press (2010)","DOI":"10.1109\/ITW.2010.5593334"},{"key":"6_CR25","doi-asserted-by":"crossref","unstructured":"Winands, M.H.M., Bj\u00f6rnsson, Y.: \u03b1\u03b2-based Play-outs in Monte-Carlo Tree Search. In: 2011 IEEE Conference on Computational Intelligence and Games (CIG 2011), pp. 110\u2013117. IEEE Press (2011)","DOI":"10.1109\/CIG.2011.6031996"}],"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-31866-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T23:03:52Z","timestamp":1556924632000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31866-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642318658","9783642318665"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31866-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}