{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:03:30Z","timestamp":1745467410133,"version":"3.40.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031900648","type":"print"},{"value":"9783031900655","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-90065-5_32","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:50Z","timestamp":1745377730000},"page":"525-540","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Injecting Combinatorial Optimization into MCTS: Application to\u00a0the\u00a0Board Game Boop"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4693-379X","authenticated-orcid":false,"given":"Florian","family":"Richoux","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"32_CR1","unstructured":"Antuori, V., H\u00e9brard, E., Huguet, M.J., Essodaigui, S., Nguyen, A.: Combining Monte Carlo tree search and depth first search methods for a car manufacturing workshop scheduling problem. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 14:1\u201314:16 (2021)"},{"key":"32_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, 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"1","key":"32_CR3","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\u201349 (2012)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1142\/S1793005708001094","volume":"04","author":"G Chaslot","year":"2008","unstructured":"Chaslot, G., Winands, M., Herik, H., Uiterwijk, J., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Math. Natural Comput. 04, 343\u2013357 (2008)","journal-title":"New Math. Natural Comput."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Codognet, P., Diaz, D.: Yet another local search method for constraint solving. In: SAGA, pp. 73\u201390. Springer (2001)","DOI":"10.1007\/3-540-45322-9_5"},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Coulom, R.: Efficient selectivity and backup operators in Monte-Carlo tree search. In: Proceedings of Computers and Games (CG), pp. 72\u201383 (2007)","DOI":"10.1007\/978-3-540-75538-8_7"},{"key":"32_CR7","unstructured":"Finnsson, H., Bj\u00f6rnsson, Y.: Simulation-based approach to general game playing. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI), pp. 259\u2013264 (2008)"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Goffinet, J., Ramanujan, R.: Monte-Carlo tree search for the maximum satisfiability problem. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 251\u2013267 (2016)","DOI":"10.1007\/978-3-319-44953-1_17"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TG.2018.2808198","volume":"11","author":"C Holmg\u00e5rd","year":"2019","unstructured":"Holmg\u00e5rd, C., Green, M.C., Liapis, A., Togelius, J.: Automated playtesting with procedural personas through MCTS with evolved heuristics. IEEE Trans. Games 11(4), 352\u2013362 (2019)","journal-title":"IEEE Trans. Games"},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Huang, S., Onta\u00f1\u00f3n, S.: A closer look at invalid action masking in policy gradient algorithms. In: The International FLAIRS Conference Proceedings, pp.\u00a01\u20136 (2022)","DOI":"10.32473\/flairs.v35i.130584"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Kocsis, L., Szepesv\u00e1ri, C.: Bandit based Monte-Carlo planning. In: Proceedings of the European Conference on Machine Learning (ECML), pp. 282\u2013293 (2006)","DOI":"10.1007\/11871842_29"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Lanctot, M., Winands, M.H.M., Pepels, T., Sturtevant, N.R.: Monte Carlo tree search with heuristic evaluations using implicit minimax backups. In: Proceedings of the 2014 IEEE Conference on Computational Intelligence and Games (CIG), pp.\u00a01\u20138 (2014)","DOI":"10.1109\/CIG.2014.6932903"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Loth, M., Sebag, M., Hamadi, Y., Schoenauer, M.: Bandit-based search for constraint programming. In: Proceedings of the International Conference on Principles and Practice of Constraint Programming (CP), pp. 464\u2013480 (2013)","DOI":"10.1007\/978-3-642-40627-0_36"},{"key":"32_CR14","doi-asserted-by":"crossref","unstructured":"Meseguer, P., Rossi, F., Schiex, T.: Soft constraints. In: The Handbook of Constraint Programming, pp. 279\u2013326. Elsevier, Amsterdam (2006)","DOI":"10.1016\/S1574-6526(06)80013-1"},{"issue":"3","key":"32_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1109\/TCIAIG.2013.2291577","volume":"6","author":"T Pepels","year":"2014","unstructured":"Pepels, T., Winands, M., Lanctot, M.: Real-time Monte Carlo tree search in MS pac-man. IEEE Trans. Comput. Intell. AI Games 6(3), 245\u2013257 (2014)","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"issue":"4","key":"32_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1109\/TCIAIG.2016.2573199","volume":"8","author":"F Richoux","year":"2016","unstructured":"Richoux, F., Uriarte, A., Baffier, J.F.: GHOST: a combinatorial optimization framework for real-time problems. IEEE Trans. Comput. Intell. AI Games 8(4), 377\u2013388 (2016). https:\/\/doi.org\/10.1109\/TCIAIG.2016.2573199","journal-title":"IEEE Trans. Comput. Intell. AI Games"},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 356\u2013361. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_23","DOI":"10.1007\/978-3-642-29828-8_23"},{"issue":"6419","key":"32_CR18","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver, D., Hubert, T., Schrittwieser, J., Antonoglou, I., Lai, M., Guez, A., Lanctot, M., Sifre, L., Kumaran, D., Graepel, T., Lillicrap, T., Simonyan, K., Hassabis, D.: A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Science 362(6419), 1140\u20131144 (2018)","journal-title":"Science"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Sironi, C.F., et al.: Self-adaptive MCTS for General Video Game Playing. In: Sim, K., Kaufmann, P. (eds.) EvoApplications 2018. LNCS, vol. 10784, pp. 358\u2013375. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-77538-8_25","DOI":"10.1007\/978-3-319-77538-8_25"},{"issue":"4","key":"32_CR20","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1109\/TG.2023.3282351","volume":"15","author":"L Xu","year":"2023","unstructured":"Xu, L., Dockhorn, A., Perez-Liebana, D.: Elastic Monte Carlo tree search. IEEE Trans. Games 15(4), 527\u2013537 (2023)","journal-title":"IEEE Trans. Games"},{"key":"32_CR21","doi-asserted-by":"publisher","first-page":"2497","DOI":"10.1007\/s10462-022-10228-y","volume":"56","author":"M \u015awiechowski","year":"2023","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 (2023)","journal-title":"Artif. Intell. Rev."}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90065-5_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:57Z","timestamp":1745377737000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90065-5_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031900648","9783031900655"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90065-5_32","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":"17 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}