{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T15:17:54Z","timestamp":1777130274239,"version":"3.51.4"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031865848","type":"print"},{"value":"9783031865855","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-86585-5_8","type":"book-chapter","created":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:22:24Z","timestamp":1743560544000},"page":"91-102","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Anytime Sequential Halving in\u00a0Monte-Carlo Tree Search"],"prefix":"10.1007","author":[{"given":"Dominic","family":"Sagers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark H. M.","family":"Winands","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis J. N. J.","family":"Soemers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,1]]},"reference":[{"key":"8_CR1","unstructured":"Audibert, J.Y., Bubeck, S.: Best arm identification in multi-armed bandits. In: Kalai, A.T., Mohri, M. (eds.) COLT 2010 - The 23rd Conference on Learning Theory, pp. 41\u201353 (2010)"},{"issue":"2\u20133","key":"8_CR2","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2\u20133), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"3","key":"8_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TCIAIG.2015.2443123","volume":"8","author":"H Baier","year":"2015","unstructured":"Baier, H., Winands, M.H.M.: Time management for Monte Carlo tree search. IEEE Trans. Comput. Intell. AI Games 8(3), 301\u2013314 (2015)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TCIAIG.2012.2186810","volume":"4","author":"C Browne","year":"2012","unstructured":"Browne, C., et al.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1\u201349 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"19","key":"8_CR5","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.1016\/j.tcs.2010.12.059","volume":"412","author":"S Bubeck","year":"2011","unstructured":"Bubeck, S., Munos, R., Stoltz, G.: Pure exploration in finitely-armed and continuous-armed bandits. Theor. Comput. Sci. 412(19), 1832\u20131852 (2011)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"8_CR6","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":"8_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). https:\/\/doi.org\/10.1007\/978-3-540-75538-8_7"},{"key":"8_CR8","unstructured":"Danihelka, I., Guez, A., Schrittwieser, J., Silver, D.: Policy improvement by planning with Gumbel. In: International Conference on Learning Representations (ICLR 2022) (2022)"},{"key":"8_CR9","doi-asserted-by":"publisher","unstructured":"Fabiano, N., Cazenave, T.: Sequential halving using scores. In: Browne, C., Kishimoto, A., Schaeffer, J. (eds.) Advances in Computer Games. ACG 2021. LNCS, vol. 13262, pp. 41\u201352. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-11488-5_4","DOI":"10.1007\/978-3-031-11488-5_4"},{"key":"8_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1613\/jair.4432","volume":"51","author":"Z Feldman","year":"2014","unstructured":"Feldman, Z., Domshlak, C.: Simple regret optimization in online planning for Markov decision processes. J. Artif. Intell. Res. 51, 165\u2013205 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Huang, S.C., Coulom, R., Lin, S.S.: Time management for Monte-Carlo tree search applied to the game of Go. In: Proceedings of the 2010 International Conference on Technologies and Applications of Artificial Intelligence, pp. 462\u2013466 (2010)","DOI":"10.1109\/TAAI.2010.78"},{"key":"8_CR12","unstructured":"Karnin, Z., Koren, T., Somekh, O.: Almost optimal exploration in multi-armed bandits. In: Proceedings of the 30th International Conference on Machine Learning PMLR, vol.\u00a028, pp. 1238\u20131246 (2013)"},{"key":"8_CR13","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":"8_CR14","doi-asserted-by":"crossref","unstructured":"Nguyen, K.P.N., Ramanujan, R.: Lookahead pathology in Monte-Carlo tree search. In: Proceedings of the International Conference Automated Planning and Scheduling, vol.\u00a034, pp. 414\u2013422 (2024)","DOI":"10.1609\/icaps.v34i1.31501"},{"key":"8_CR15","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-39402-2_2","volume-title":"Computer Games","author":"T Pepels","year":"2016","unstructured":"Pepels, T., Cazenave, T., Winands, M.H.M.: Sequential halving for partially observable games. In: Cazenave, T., Winands, M.H.M., Edelkamp, S., Schiffel, S., Thielscher, M., Togelius, J. (eds.) CGW\/GIGA -2015. CCIS, vol. 614, pp. 16\u201329. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39402-2_2"},{"key":"8_CR16","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-14923-3_1","volume-title":"Computer Games","author":"T Pepels","year":"2014","unstructured":"Pepels, T., Cazenave, T., Winands, M.H.M., Lanctot, M.: Minimizing\u00a0simple\u00a0and\u00a0cumulative\u00a0regret in\u00a0Monte-Carlo\u00a0tree\u00a0search. In: Cazenave, T., Winands, M.H.M., Bj\u00f6rnsson, Y. (eds.) CGW 2014. CCIS, vol. 504, pp. 1\u201315. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-14923-3_1"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Piette, \u00c9., Soemers, D.J.N.J., Stephenson, M., Sironi, C.F., Winands, M.H.M., Browne, C.: Ludii \u2013 the ludemic general game system. In: Giacomo, G.D., Catala, A., Dilkina, B., Milano, M., Barro, S., Bugar\u00edn, A., Lang, J. (eds.) Proc. 24th European Conference Artificial Intelligence. Frontiers in Artificial Intelligence and Applications, vol.\u00a0325, pp. 411\u2013418. IOS Press (2020)","DOI":"10.3233\/FAIA200120"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Soemers, D.J.N.J., et al.: Towards a characterisation of Monte-Carlo tree search performance in different games. In: Proceedings of the IEEE Conference Games, pp.\u00a01\u20134 (2024)","DOI":"10.1109\/CoG60054.2024.10645675"},{"key":"8_CR19","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1007\/s10462-022-10228-y","volume":"56","author":"M \u015awiechowski","year":"2022","unstructured":"\u015awiechowski, M., Godlewski, K., Sawicki, B., Ma\u0144dziuk, J.: Monte Carlo tree search: a review of recent modifications and applications. Artif. Intell. Rev. 56, 2497\u20132562 (2022)","journal-title":"Artif. Intell. Rev."},{"key":"8_CR20","unstructured":"Todd, G., Padula, A., Stephenson, M., Piette, \u00c9., Soemers, D.J.N.J., Togelius, J.: GAVEL: Generating games via evolution and language models (2024). https:\/\/arxiv.org\/abs\/2407.09388"}],"container-title":["Lecture Notes in Computer Science","Computers and Games"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-86585-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,2]],"date-time":"2025-04-02T02:22:36Z","timestamp":1743560556000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-86585-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031865848","9783031865855"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-86585-5_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"1 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"CG 2024","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computers and Games","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 November 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cg2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icga.org\/?page_id=3907","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}