{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:21:36Z","timestamp":1743157296305,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319759302"},{"type":"electronic","value":"9783319759319"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75931-9_7","type":"book-chapter","created":{"date-parts":[[2018,2,14]],"date-time":"2018-02-14T04:27:50Z","timestamp":1518582470000},"page":"96-107","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Memorizing the Playout Policy"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eustache","family":"Diemert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,2,15]]},"reference":[{"issue":"1","key":"7_CR1","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"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Cazenave, T.: Nested Monte-Carlo search. In: Boutilier, C. (ed.) IJCAI, pp. 456\u2013461 (2009)","DOI":"10.1109\/IPDPS.2009.5161122"},{"key":"7_CR3","unstructured":"Cazenave, T.: Generalized rapid action value estimation. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, 25\u201331 July 2015, pp. 754\u2013760 (2015)"},{"key":"7_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-27992-3_3","volume-title":"Advances in Computer Games","author":"T Cazenave","year":"2015","unstructured":"Cazenave, T.: Playout policy adaptation for games. In: Plaat, A., van den Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 20\u201328. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27992-3_3"},{"issue":"1","key":"7_CR5","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"},{"key":"7_CR6","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.tcs.2016.06.024","volume":"644","author":"T Cazenave","year":"2016","unstructured":"Cazenave, T.: Playout policy adaptation with move features. Theor. Comput. Sci. 644, 43\u201352 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-642-34413-8_4","volume-title":"Learning and Intelligent Optimization","author":"T Cazenave","year":"2012","unstructured":"Cazenave, T., Teytaud, F.: Application of the nested rollout policy adaptation algorithm to the traveling salesman problem with time windows. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 42\u201354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_4"},{"key":"7_CR8","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. LNCS, vol. 6624, pp. 73\u201382. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20525-5_8"},{"key":"7_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.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"issue":"4","key":"7_CR10","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."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Gath, M., Cazenave, T., Teytaud, F.: Algorithm and knowledge engineering for the TSPTW problem. In: 2013 IEEE Symposium on Computational Intelligence in Scheduling (SCIS), pp. 44\u201351. IEEE (2013)","DOI":"10.1109\/SCIS.2013.6613251"},{"key":"7_CR12","series-title":"Lecture Notes in Logistics","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-319-21266-1_28","volume-title":"Commercial Transport","author":"S Edelkamp","year":"2016","unstructured":"Edelkamp, S., Gath, M., Greulich, C., Humann, M., Herzog, O., Lawo, M.: Monte-Carlo tree search for logistics. In: Clausen, U., Friedrich, H., Thaller, C., Geiger, C. (eds.) Commercial Transport. LNL, pp. 427\u2013440. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-21266-1_28"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/978-3-319-11206-0_28","volume-title":"KI 2014: Advances in Artificial Intelligence","author":"S Edelkamp","year":"2014","unstructured":"Edelkamp, S., Gath, M., Rohde, M.: Monte-Carlo tree search for 3D packing with object orientation. In: Lutz, C., Thielscher, M. (eds.) KI 2014. LNCS (LNAI), vol. 8736, pp. 285\u2013296. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11206-0_28"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Edelkamp, S., Greulich, C.: Solving physical traveling salesman problems with policy adaptation. In: 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932882"},{"key":"7_CR15","unstructured":"Edelkamp, S., Tang, Z.: Monte-carlo tree search for the multiple sequence alignment problem. In: Eighth Annual Symposium on Combinatorial Search (2015)"},{"issue":"4","key":"7_CR16","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"},{"key":"7_CR17","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: AAAI, pp. 259\u2013264 (2008)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Learning simulation control in general game-playing agents. In: AAAI, pp. 954\u2013959 (2010)","DOI":"10.1609\/aaai.v24i1.7651"},{"issue":"1","key":"7_CR19","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/s13218-010-0080-9","volume":"25","author":"H Finnsson","year":"2011","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Cadiaplayer: Search-control techniques. KI-K\u00fcnstliche Intelligenz 25(1), 9\u201316 (2011)","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"key":"7_CR20","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":"7_CR21","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":"7_CR22","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."},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-27992-3_1","volume-title":"Advances in Computer Games","author":"T Graf","year":"2015","unstructured":"Graf, T., Platzner, M.: Adaptive playouts in Monte-Carlo tree search with policy-gradient reinforcement learning. In: Plaat, A., van den Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 1\u201311. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-27992-3_1"},{"key":"7_CR24","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2016.06.029","volume":"644","author":"T Graf","year":"2016","unstructured":"Graf, T., Platzner, M.: Adaptive playouts for online learning of policies during Monte Carlo tree search. Theor. Comput. Sci. 644, 53\u201362 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"7_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-09165-5_6","volume-title":"Computers and Games","author":"S-C Huang","year":"2014","unstructured":"Huang, S.-C., Arneson, B., Hayward, R.B., M\u00fcller, M., Pawlewicz, J.: MoHex 2.0: a pattern-based MCTS hex player. In: van den Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 60\u201371. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09165-5_6"},{"key":"7_CR26","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). https:\/\/doi.org\/10.1007\/978-3-642-17928-0_8"},{"key":"7_CR27","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). https:\/\/doi.org\/10.1007\/11871842_29"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-319-09165-5_5","volume-title":"Computers 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, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09165-5_5"},{"issue":"1","key":"7_CR29","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":"7_CR30","doi-asserted-by":"crossref","unstructured":"Perez, D., Samothrakis, S., Lucas, S.: Knowledge-based fast evolutionary MCTS for general video game playing. In: 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138. IEEE (2014)","DOI":"10.1109\/CIG.2014.6932868"},{"key":"7_CR31","unstructured":"Pitrat, J.: Realization of a general game-playing program. In: IFIP Congress (2), pp. 1570\u20131574 (1968)"},{"key":"7_CR32","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. LNCS, vol. 6625, pp. 501\u2013510. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20520-0_51"},{"key":"7_CR33","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). https:\/\/doi.org\/10.1007\/978-3-642-17928-0_6"},{"key":"7_CR34","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, pp. 649\u2013654 (2011)"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Saffidine, A., Jouandeau, N., Cazenave, T.: Solving Breakthrough with race patterns and job-level proof number search. In: ACG, pp. 196\u2013207 (2011)","DOI":"10.1007\/978-3-642-31866-5_17"},{"issue":"7587","key":"7_CR36","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1038\/nature16961","volume":"529","author":"D Silver","year":"2016","unstructured":"Silver, D., Huang, A., Maddison, C.J., Guez, A., Sifre, L., van den Driessche, G., Schrittwieser, J., Antonoglou, I., Panneershelvam, V., Lanctot, M., Dieleman, S., Grewe, D., Nham, J., Kalchbrenner, N., Sutskever, I., Lillicrap, T., Leach, M., Kavukcuoglu, K., Graepel, T., Hassabis, D.: Mastering the game of go with deep neural networks and tree search. Nature 529(7587), 484\u2013489 (2016)","journal-title":"Nature"},{"issue":"4","key":"7_CR37","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":"7_CR38","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":"7_CR39","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-319-39402-2_11","volume-title":"Computer Games","author":"M Trutman","year":"2016","unstructured":"Trutman, M., Schiffel, S.: Creating action heuristics for general game playing agents. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW\/GIGA 2015. CCIS, vol. 614, pp. 149\u2013164. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39402-2_11"},{"key":"7_CR40","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-05428-5_8","volume-title":"Computer Games","author":"JWHM Uiterwijk","year":"2014","unstructured":"Uiterwijk, J.W.H.M.: Perfectly solving domineering boards. In: Cazenave, T., Winands, M.H.M., Iida, H. (eds.) CGW 2013. CCIS, vol. 408, pp. 97\u2013121. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05428-5_8"}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75931-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T23:59:56Z","timestamp":1693526396000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-75931-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319759302","9783319759319"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75931-9_7","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"15 February 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}