{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:49:15Z","timestamp":1767340155114},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319579689"},{"type":"electronic","value":"9783319579696"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-57969-6_4","type":"book-chapter","created":{"date-parts":[[2017,4,28]],"date-time":"2017-04-28T10:04:26Z","timestamp":1493373866000},"page":"44-56","source":"Crossref","is-referenced-by-count":6,"title":["Nested Rollout Policy Adaptation with Selective Policies"],"prefix":"10.1007","author":[{"given":"Tristan","family":"Cazenave","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,4,29]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Baier, H., Winands, M.H.M.: Nested Monte-Carlo tree search for online planning in large MDPs. In: ECAI 2012\u201320th European Conference on Artificial Intelligence, pp. 109\u2013114. IOS press (2012)","DOI":"10.1109\/CIG.2012.6374160"},{"key":"4_CR2","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-05428-5_1","volume-title":"Computer Games","author":"B Bouzy","year":"2014","unstructured":"Bouzy, B.: Monte-Carlo fork search for cooperative path-finding. In: Cazenave, T., Winands, M.H.M., Iida, H. (eds.) CGW 2013. CCIS, vol. 408, pp. 1\u201315. Springer, Cham (2014). doi: 10.1007\/978-3-319-05428-5_1"},{"key":"4_CR3","unstructured":"Bouzy, B.: An abstract procedure to compute Weak Schur number lower bounds. Technical report 2, LIPADE, Universit\u00e9 Paris Descartes (2015)"},{"key":"4_CR4","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-319-39402-2_3","volume-title":"Computer Games","author":"B Bouzy","year":"2016","unstructured":"Bouzy, B.: An experimental investigation on the pancake problem. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW\/GIGA -2015. CCIS, vol. 614, pp. 30\u201343. Springer, Cham (2016). doi: 10.1007\/978-3-319-39402-2_3"},{"key":"4_CR5","unstructured":"Breuker, D.M.: Memory versus search in games. Ph.D. thesis, Universiteit Maastricht, Maastricht, The Netherlands (1998)"},{"issue":"1","key":"4_CR6","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":"4_CR7","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":"4_CR8","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":"4_CR9","unstructured":"Cazenave, T., Balbo, F., Pinson, S.: Monte-Carlo bus regulation. In: ITSC, pp. 340\u2013345. St. Louis (2009)"},{"key":"4_CR10","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). doi: 10.1007\/978-3-642-34413-8_4"},{"key":"4_CR11","unstructured":"Cazenave, T., Teytaud, F.: Beam nested rollout policy adaptation. In: Computer Games Workshop, CGW 2012, ECAI 2012, pp. 1\u201312 (2012)"},{"issue":"4","key":"4_CR12","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":"4_CR13","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: Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.J. (eds.) CG 2006. LNCS, vol. 4630, pp. 72\u201383. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-75538-8_7"},{"key":"4_CR14","doi-asserted-by":"publisher","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":"4_CR15","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). doi: 10.1007\/978-3-319-21266-1_28"},{"key":"4_CR16","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). doi: 10.1007\/978-3-319-11206-0_28"},{"key":"4_CR17","doi-asserted-by":"publisher","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":"4_CR18","unstructured":"Edelkamp, S., Tang, Z.: Monte-carlo tree search for the multiple sequence alignment problem. In: Eighth Annual Symposium on Combinatorial Search (2015)"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-37198-1_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S Eliahou","year":"2013","unstructured":"Eliahou, S., Fonlupt, C., Fromentin, J., Marion-Poty, V., Robilliard, D., Teytaud, F.: Investigating Monte-Carlo methods on the Weak Schur problem. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 191\u2013201. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-37198-1_17"},{"key":"4_CR20","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., Herik, J., Kosters, W. (eds.) ACG 2015. LNCS, vol. 9525, pp. 1\u201311. Springer, Cham (2015). doi: 10.1007\/978-3-319-27992-3_1"},{"key":"4_CR21","unstructured":"Hauer, B., Hayward, R., Kondrak, G.: Solving substitution ciphers with combined language models. In: COLING 2014, 25th International Conference on Computational Linguistics, Proceedings of the Conference: Technical Papers, August 23\u201329, 2014, Dublin, Ireland, pp. 2314\u20132325 (2014)"},{"key":"4_CR22","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, August 13\u201315, 2013, Revised Selected Papers, pp. 60\u201371 (2014)"},{"key":"4_CR23","unstructured":"Kinny, D.: A new approach to the snake-in-the-box problem. In: ECAI, vol. 242, pp. 462\u2013467 (2012)"},{"key":"4_CR24","unstructured":"Klein, S.: Attacking SameGame using Monte-Carlo tree search: using randomness as guidance in puzzles. Master\u2019s thesis, KTH Royal Institute of Technology, Stockholm, Sweden (2015)"},{"key":"4_CR25","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). doi: 10.1007\/11871842_29"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-662-45523-4_29","volume-title":"Applications of Evolutionary Computation","author":"SM Lucas","year":"2014","unstructured":"Lucas, S.M., Samothrakis, S., P\u00e9rez, D.: Fast evolutionary adaptation for Monte Carlo tree search. In: Esparcia-Alc\u00e1zar, A.I., Mora, A.M. (eds.) EvoApplications 2014. LNCS, vol. 8602, pp. 349\u2013360. Springer, Heidelberg (2014). doi: 10.1007\/978-3-662-45523-4_29"},{"key":"4_CR27","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: Chio, C., et al. (eds.) EvoApplications 2011. LNCS, vol. 6625, pp. 501\u2013510. Springer, Heidelberg (2011). doi: 10.1007\/978-3-642-20520-0_51"},{"key":"4_CR28","unstructured":"Rosin, C.D.: Nested rollout policy adaptation for Monte Carlo tree search. In: IJCAI, pp. 649\u2013654 (2011)"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.knosys.2011.08.008","volume":"34","author":"MPD Schadd","year":"2012","unstructured":"Schadd, M.P.D., Winands, M.H.M., Tak, M.J.W., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo tree search for SameGame. Knowl. Based Syst. 34, 3\u201311 (2012)","journal-title":"Knowl. Based Syst."},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87608-3_1","volume-title":"Computers and Games","author":"MPD Schadd","year":"2008","unstructured":"Schadd, M.P.D., Winands, M.H.M., Herik, H.J., Chaslot, G.M.J.-B., Uiterwijk, J.W.H.M.: Single-player Monte-Carlo tree search. In: Herik, H.J., Xu, X., Ma, Z., Winands, M.H.M. (eds.) CG 2008. LNCS, vol. 5131, pp. 1\u201312. Springer, Heidelberg (2008). doi: 10.1007\/978-3-540-87608-3_1"},{"issue":"2","key":"4_CR31","first-page":"69","volume":"13","author":"AL Zobrist","year":"1990","unstructured":"Zobrist, A.L.: A new hashing method with application for game playing. ICCA J. 13(2), 69\u201373 (1990)","journal-title":"ICCA J."}],"container-title":["Communications in Computer and Information Science","Computer Games"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-57969-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T08:33:57Z","timestamp":1569141237000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-57969-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319579689","9783319579696"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-57969-6_4","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}