{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:52:38Z","timestamp":1743061958430,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"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_1","type":"book-chapter","created":{"date-parts":[[2015,12,24]],"date-time":"2015-12-24T12:24:21Z","timestamp":1450959861000},"page":"1-11","source":"Crossref","is-referenced-by-count":8,"title":["Adaptive Playouts in Monte-Carlo Tree Search with Policy-Gradient Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Tobias","family":"Graf","sequence":"first","affiliation":[]},{"given":"Marco","family":"Platzner","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,12,25]]},"reference":[{"key":"1_CR1","unstructured":"Baier, H.: Adaptive playout policies for Monte Carlo go. Master\u2019s thesis, Osnabrueck University, Germany (2010)"},{"issue":"4","key":"1_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.: The power of forgetting: improving the last-good-reply policy in Monte Carlo go. IEEE Trans. Comput. Intell. AI Games 2(4), 303\u2013309 (2010)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"1_CR3","unstructured":"Baudis, P.: Effect of LGRF on the playing strength agains gnugo. Website 15 June 2012. http:\/\/www.mail-archive.com\/computer-go@dvandva.org\/msg05060.html. Accessed 09 March 2015"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-642-31866-5_3","volume-title":"Advances in Computer Games","author":"P Baudi\u0161","year":"2012","unstructured":"Baudi\u0161, P., Gailly, J.: PACHI: state of the art open source go program. In: van den Herik, H.J., Plaat, A. (eds.) ACG 2011. LNCS, vol. 7168, pp. 24\u201338. Springer, Heidelberg (2012)"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","first-page":"430","volume-title":"Neural Networks, Tricks of the Trade, Reloaded","author":"L Bottou","year":"2012","unstructured":"Bottou, L.: Stochastic gradient tricks. In: Montavon, G., Orr, G.B., M\u00fcller, K.-R. (eds.) Neural Networks, Tricks of the Trade, Reloaded. Lecture Notes in Computer Science, vol. 7700, pp. 430\u2013445. Springer, Heidelberg (2012)"},{"issue":"1","key":"1_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"},{"issue":"3","key":"1_CR7","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"4","author":"G Chaslot","year":"2008","unstructured":"Chaslot, G., Winands, M., Uiterwijk, J., van den Herik, H., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Math. Nat. Comput. 4(3), 343\u2013357 (2008)","journal-title":"New Math. Nat. Comput."},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining online and offline knowledge in UCT. In: Proceedings of the 24th International Conference on Machine Learning, ICML 2007, pp. 273\u2013280, New York (2007)","DOI":"10.1145\/1273496.1273531"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Graf, T., Platzner, M.: Common fate graph patterns in Monte Carlo tree search for computer go. In: 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp. 1\u20138, August 2014","DOI":"10.1109\/CIG.2014.6932863"},{"key":"1_CR10","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":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/978-3-319-09165-5_4","volume-title":"Computer and Games","author":"S-C Huang","year":"2014","unstructured":"Huang, S.-C., M\u00fcller, M.: Investigating the limits of Monte-Carlo tree search methods in computer go. In: Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 39\u201348. Springer, Heidelberg (2014)"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/978-3-319-09165-5_3","volume-title":"Computer and Games","author":"K Ikeda","year":"2014","unstructured":"Ikeda, K., Viennot, S.: Efficiency of static knowledge bias in Monte-Carlo tree search. In: Herik, H.J., Iida, H., Plaat, A. (eds.) CG 2013. LNCS, vol. 8427, pp. 26\u201338. Springer, Heidelberg (2014)"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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 adaptationfor 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)"},{"key":"1_CR14","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, August 2014","DOI":"10.1109\/CIG.2014.6932868"},{"key":"1_CR15","unstructured":"Silver, D.: Reinforcement learning and simulation-based search in computer go. Ph.D. thesis, University of Alberta (2009)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Silver, D., Sutton, R.S., M\u00fcller, M.: Sample-based learning and search with permanent and transient memories. In: Proceedings of the 25th International Conference on Machine Learning, ICML 2008, pp. 968\u2013975 (2008)","DOI":"10.1145\/1390156.1390278"},{"key":"1_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-01551-9","volume-title":"Algorithms for Reinforcment Learning","author":"C Szepesvari","year":"2010","unstructured":"Szepesvari, C.: Algorithms for Reinforcment Learning. Morgan and Claypool, USA (2010)"},{"key":"1_CR18","first-page":"229","volume":"8","author":"RJ Williams","year":"1992","unstructured":"Williams, R.J.: Simple statistical gradient-following algorithms for connectionist reinforcement learning. Mach. Learn. 8, 229\u2013256 (1992)","journal-title":"Mach. Learn."}],"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_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T08:28:43Z","timestamp":1692174523000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-27992-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319279916","9783319279923"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-27992-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}