{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,17]],"date-time":"2025-04-17T14:09:26Z","timestamp":1744898966991,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319279916"},{"type":"electronic","value":"9783319279923"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-27992-3_3","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T07:24:21Z","timestamp":1450941861000},"page":"20-28","source":"Crossref","is-referenced-by-count":7,"title":["Playout Policy Adaptation for Games"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"unstructured":"Boissac, F., Cazenave, T.: De nouvelles heuristiques de recherche appliqu\u00e9es \u00e0 la r\u00e9solution d\u2019Atarigo. In: Intelligence artificielle et jeux, pp. 127\u2013141. Hermes Science (2006)","key":"3_CR1"},{"issue":"1","key":"3_CR2","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., Whitehouse, D., Lucas, S., Cowling, P., Rohlfshagen, P., Tavener, S., Perez, D., Samothrakis, S., Colton, S.: A survey of Monte Carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201343 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456\u2013461 (2009)","key":"3_CR3","DOI":"10.1109\/IPDPS.2009.5161122"},{"issue":"1","key":"3_CR4","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TCIAIG.2014.2317737","volume":"7","author":"T Cazenave","year":"2015","unstructured":"Cazenave, T.: Sequential halving applied to trees. IEEE Trans. Comput. Intell. AI Games 7(1), 102\u2013105 (2015)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"unstructured":"Cazenave, T., Saffidine, A., Schofield, M., Thielscher, M.: Discounting and pruning for nested playouts in general game playing. GIGA at IJCAI (2015)","key":"3_CR5"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-20525-5_8","volume-title":"Applications of Evolutionary Computation","author":"C-W Chou","year":"2011","unstructured":"Chou, C.-W., Teytaud, O., Yen, S.-J.: Revisiting Monte-Carlo tree search on a normal form game: NoGo. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part I. LNCS, vol. 6624, pp. 73\u201382. Springer, Heidelberg (2011)"},{"key":"3_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. 4630, pp. 72\u201383. Springer, Heidelberg (2007)"},{"issue":"4","key":"3_CR8","doi-asserted-by":"crossref","first-page":"198","DOI":"10.3233\/ICG-2007-30403","volume":"30","author":"R Coulom","year":"2007","unstructured":"Coulom, R.: Computing elo ratings of move patterns in the game of go. ICGA J. 30(4), 198\u2013208 (2007)","journal-title":"ICGA J."},{"issue":"4","key":"3_CR9","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1109\/TCIAIG.2010.2083662","volume":"2","author":"M Enzenberger","year":"2010","unstructured":"Enzenberger, M., Muller, M., Arneson, B., Segal, R.: Fuego - an open-source framework for board games and go engine based on Monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 2(4), 259\u2013270 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI, pp. 259\u2013264 (2008)","key":"3_CR10"},{"doi-asserted-by":"crossref","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Learning simulation control in general game-playing agents. In: AAAI (2010)","key":"3_CR11","DOI":"10.1109\/CIG.2009.5286513"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1038\/scientificamerican0374-102","volume":"230","author":"M Gardner","year":"1974","unstructured":"Gardner, M.: Mathematical games. Sci. Am. 230, 106\u2013108 (1974)","journal-title":"Sci. Am."},{"issue":"11","key":"3_CR13","doi-asserted-by":"publisher","first-page":"1856","DOI":"10.1016\/j.artint.2011.03.007","volume":"175","author":"S Gelly","year":"2011","unstructured":"Gelly, S., Silver, D.: Monte-Carlo tree search and rapid action value estimation in computer go. Artif. Intell. 175(11), 1856\u20131875 (2011)","journal-title":"Artif. Intell."},{"issue":"2","key":"3_CR14","first-page":"62","volume":"26","author":"MR Genesereth","year":"2005","unstructured":"Genesereth, M.R., Love, N., Pell, B.: General game playing: overview of the AAAI competition. AI Mag. 26(2), 62\u201372 (2005)","journal-title":"AI Mag."},{"doi-asserted-by":"crossref","unstructured":"Huang, S., Arneson, B., Hayward, R.B., M\u00fcller, M., Pawlewicz, J.: Mohex 2.0: a pattern-based MCTS hex player. In: Computers and Games - 8th International Conference, CG 2013, Yokohama, Japan, 13\u201315 August 2013, Revised Selected Papers, pp. 60\u201371 (2013)","key":"3_CR15","DOI":"10.1007\/978-3-319-09165-5_6"},{"key":"3_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-17928-0_8","volume-title":"Computers and Games","author":"S-C Huang","year":"2011","unstructured":"Huang, S.-C., Coulom, R., Lin, S.-S.: Monte-Carlo simulation balancing in practice. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2010. LNCS, vol. 6515, pp. 81\u201392. Springer, Heidelberg (2011)"},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science (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. 4212, pp. 282\u2013293. Springer, Heidelberg (2006)"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TCIAIG.2009.2018703","volume":"1","author":"C Lee","year":"2009","unstructured":"Lee, C., Wang, M., Chaslot, G., Hoock, J., Rimmel, A., Teytaud, O., Tsai, S., Hsu, S., Hong, T.: The computational intelligence of MoGo revealed in taiwan\u2019s computer go tournaments. IEEE Trans. Comput. Intell. AI Games 1(1), 73\u201389 (2009)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"3_CR19","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. 8427, pp. 49\u201359. Springer, Heidelberg (2014)"},{"issue":"1","key":"3_CR20","first-page":"43","volume":"25","author":"J M\u00e9hat","year":"2011","unstructured":"M\u00e9hat, J., Cazenave, T.: A parallel general game player. KI 25(1), 43\u201347 (2011)","journal-title":"KI"},{"key":"3_CR21","first-page":"1570","volume":"2","author":"J Pitrat","year":"1968","unstructured":"Pitrat, J.: Realization of a general game-playing program. IFIP Congr. 2, 1570\u20131574 (1968)","journal-title":"IFIP Congr."},{"key":"3_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-20520-0_51","volume-title":"Applications of Evolutionary Computation","author":"A Rimmel","year":"2011","unstructured":"Rimmel, A., Teytaud, F., Cazenave, T.: Optimization of the nested Monte-Carlo algorithm on the traveling salesman problem with time windows. In: Di Chio, C., et al. (eds.) EvoApplications 2011, Part II. LNCS, vol. 6625, pp. 501\u2013510. Springer, Heidelberg (2011)"},{"key":"3_CR23","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. 6515, pp. 59\u201368. Springer, Heidelberg (2011)"},{"unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, pp. 649\u2013654 (2011)","key":"3_CR24"},{"key":"3_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/978-3-642-31866-5_17","volume-title":"Advances in Computer Games","author":"A Saffidine","year":"2012","unstructured":"Saffidine, A., Jouandeau, N., Cazenave, T.: Solving breakthrough with race patterns and job-level proof number search. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 196\u2013207. Springer, Heidelberg (2012)"},{"issue":"4","key":"3_CR26","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/TCIAIG.2013.2275163","volume":"6","author":"M Swiechowski","year":"2014","unstructured":"Swiechowski, M., Mandziuk, J.: Self-adaptation of playing strategies in general game playing. IEEE Trans. Comput. Intell. AI Games 6(4), 367\u2013381 (2014)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"2","key":"3_CR27","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1109\/TCIAIG.2012.2200252","volume":"4","author":"MJW Tak","year":"2012","unstructured":"Tak, M.J.W., Winands, M.H.M., Bj\u00f6rnsson, Y.: N-grams and the last-good-reply policy applied in general game playing. IEEE Trans. Comput. Intell. AI Games 4(2), 73\u201383 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"3_CR28","series-title":"Communications in Computer and Information Science","first-page":"97","volume-title":"Computer Games - Workshop on Computer Games","author":"JWHM Uiterwijk","year":"2013","unstructured":"Uiterwijk, J.W.H.M.: Perfectly solving domineering boards. In: Cazenave, T., Winands, M.H.M., Lida, H. (eds.) CGW 2013. Communications in Computer and Information Science, vol. 408, pp. 97\u2013121. Springer, Switzerland (2013)"}],"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-319-27992-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T00:35:21Z","timestamp":1559349321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}