{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:51:13Z","timestamp":1782222673005,"version":"3.54.5"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032025548","type":"print"},{"value":"9783032025555","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-032-02555-5_20","type":"book-chapter","created":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T05:29:54Z","timestamp":1755754194000},"page":"280-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for\u00a0Explainable AI in\u00a0Wargames to\u00a0Understand Strategies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0003-5538-9084","authenticated-orcid":false,"given":"Christoph","family":"L\u00fcrig","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fabian","family":"Fell","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,8,22]]},"reference":[{"issue":"3","key":"20_CR1","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0004-3702(83)80015-0","volume":"21","author":"BW Ballard","year":"1983","unstructured":"Ballard, B.W.: The *-minimax search procedure for trees containing chance nodes. Artif. Intell. 21(3), 327\u2013350 (1983). https:\/\/doi.org\/10.1016\/S0004-3702(83)80015-0","journal-title":"Artif. Intell."},{"issue":"4","key":"20_CR2","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0095693","volume":"9","author":"O Berger-Tal","year":"2014","unstructured":"Berger-Tal, O., Nathan, J., Meron, E., Saltz, D.: The exploration-exploitation dilemma: a multidisciplinary framework. PLoS ONE 9(4), e95693 (2014). https:\/\/doi.org\/10.1371\/journal.pone.0095693","journal-title":"PLoS ONE"},{"key":"20_CR3","unstructured":"Breuker, D.M., Uiterwijk, J.W.: Transposition tables in computer chess. University of Limburg, Department of Computer Science (2002)"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Buro, M.: The evolution of strong Othello programs. Entertainment Comput. Technol. Appl. 81\u201388 (2003)","DOI":"10.1007\/978-0-387-35660-0_10"},{"issue":"11","key":"20_CR5","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.artint.2010.04.017","volume":"174","author":"P Ciancarini","year":"2010","unstructured":"Ciancarini, P., Favini, G.P.: Monte Carlo tree search in Kriegspiel. Artif. Intell. 174(11), 670\u2013684 (2010)","journal-title":"Artif. Intell."},{"key":"20_CR6","unstructured":"Dann, C., Mansour, Y., Mohri, M., Sekhari, A., Sridharan, K.: Guarantees for epsilon-greedy reinforcement learning with function approximation. In: International Conference on Machine Learning, pp. 4666\u20134689. PMLR (2022)"},{"issue":"4","key":"20_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.17083\/ijsg.v7i4.372","volume":"7","author":"M Flanagan","year":"2020","unstructured":"Flanagan, M., Northey, A., Robinson, I.: Exploring tactical choices and game design outcomes in a simple wargame \u2018take that hill\u2019 by a systematic approach using experimental design. Int. J. Serious Games 7(4), 27\u201350 (2020)","journal-title":"Int. J. Serious Games"},{"key":"20_CR8","unstructured":"Fujimoto, S., Meger, D., Precup, D.: Off-policy deep reinforcement learning without exploration. In: International Conference on Machine Learning, pp. 2052\u20132062. PMLR (2019)"},{"key":"20_CR9","unstructured":"Guo, H., Liu, Z., Zhang, Y., Wang, Z.: Can large language models play games? a case study of a self-play approach. arXiv preprint arXiv:2403.05632 (2024)"},{"key":"20_CR10","doi-asserted-by":"crossref","unstructured":"Hastie, T., Tibshirani, R.: Generalized additive models; some applications. In: Generalized Linear Models: Proceedings of the GLIM 85 Conference held at Lancaster, UK, Sept. 16\u201319, 1985, pp. 66\u201381. Springer (1985)","DOI":"10.1007\/978-1-4615-7070-7_8"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"133653","DOI":"10.1109\/ACCESS.2019.2941229","volume":"7","author":"B Jang","year":"2019","unstructured":"Jang, B., Kim, M., Harerimana, G., Kim, J.W.: Q-learning algorithms: a comprehensive classification and applications. IEEE Access 7, 133653\u2013133667 (2019)","journal-title":"IEEE Access"},{"key":"20_CR12","doi-asserted-by":"publisher","unstructured":"Karamchandani, S., Gandhi, P., Pawar, O., Pawaskar, S.: A simple algorithm for designing an artificial intelligence based tic tac toe game. In: 2015 International Conference on Pervasive Computing (ICPC), pp.\u00a01\u20134 (2015).https:\/\/doi.org\/10.1109\/PERVASIVE.2015.7087182","DOI":"10.1109\/PERVASIVE.2015.7087182"},{"issue":"12","key":"20_CR13","doi-asserted-by":"publisher","first-page":"1577","DOI":"10.1109\/TSMC.2015.2417510","volume":"45","author":"D Liu","year":"2015","unstructured":"Liu, D., Wei, Q., Yan, P.: Generalized policy iteration adaptive dynamic programming for discrete-time nonlinear systems. IEEE Trans. Syst. Man Cybern. Syst. 45(12), 1577\u20131591 (2015)","journal-title":"IEEE Trans. Syst. Man Cybern. Syst."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/wics.14","volume":"1","author":"GC McDonald","year":"2009","unstructured":"McDonald, G.C.: Ridge regression. Wiley Interdisc. Rev. Comput. Stat. 1(1), 93\u2013100 (2009)","journal-title":"Wiley Interdisc. Rev. Comput. Stat."},{"key":"20_CR15","unstructured":"Microsoft: Microsoft ml (2025). https:\/\/dotnet.microsoft.com\/en-us\/apps\/ai\/ml-dotnet. Accessed 9 Feb 2025"},{"key":"20_CR16","volume-title":"Interpretable Machine Learning","author":"C Molnar","year":"2020","unstructured":"Molnar, C.: Interpretable Machine Learning. Lulu. com, Morrisville (2020)"},{"key":"20_CR17","doi-asserted-by":"publisher","unstructured":"Za\u00efane, O.R., Zilles, S. (eds.): AI 2013. LNCS (LNAI), vol. 7884. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38457-8","DOI":"10.1007\/978-3-642-38457-8"},{"key":"20_CR18","first-page":"1","volume":"2","author":"E Ostrom","year":"2008","unstructured":"Ostrom, E.: Tragedy of the commons. New Palgrave Dictionary Econ. 2, 1\u20134 (2008)","journal-title":"New Palgrave Dictionary Econ."},{"key":"20_CR19","unstructured":"Petal, A.: Hexagonal grids (2024). https:\/\/www.redblobgames.com\/grids\/hexagons\/. Accessed 9 Feb 2025"},{"key":"20_CR20","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: Model-agnostic interpretability of machine learning. arXiv preprint arXiv:1606.05386 (2016)"},{"key":"20_CR21","doi-asserted-by":"crossref","unstructured":"Russell, S.: Human-Compatible Artificial Intelligence (2022)","DOI":"10.1093\/oso\/9780198862536.003.0001"},{"key":"20_CR22","volume-title":"Artificial Intelligence: A Modern Approach","author":"SJ Russell","year":"2021","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence: A Modern Approach. Pearson, Hoboken (2021)"},{"key":"20_CR23","doi-asserted-by":"crossref","unstructured":"Shannon, C.E.: Xxii. programming a computer for playing chess. Lond. Edinb. Dublin Philo. Mag. J. Sci. 41(314), 256\u2013275 (1950)","DOI":"10.1080\/14786445008521796"},{"key":"20_CR24","unstructured":"Somers, J.: How the artificial-intelligence program AlphaZero mastered its games. New Yorker 3 (2018)"},{"key":"20_CR25","volume-title":"Game Theory and Strategy","author":"PD Straffin","year":"1993","unstructured":"Straffin, P.D.: Game Theory and Strategy, vol. 36. MAA, Indiranagar (1993)"},{"key":"20_CR26","unstructured":"Sundararajan, M., Najmi, A.: The many Shapley values for model explanation. In: International Conference on Machine Learning, pp. 9269\u20139278. PMLR (2020)"},{"key":"20_CR27","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2020","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2020)"},{"issue":"3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1145\/203330.203343","volume":"38","author":"G Tesauro","year":"1995","unstructured":"Tesauro, G., et al.: Temporal difference learning and td-gammon. Commun. ACM 38(3), 58\u201368 (1995)","journal-title":"Commun. ACM"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Frey, P.W.: An empirical technique for developing evaluation functions. ICCA 8(1) (1985)","DOI":"10.3233\/ICG-1985-8104"}],"container-title":["Lecture Notes in Computer Science","Entertainment Computing \u2013 ICEC 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02555-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T13:11:15Z","timestamp":1782220275000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02555-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032025548","9783032025555"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02555-5_20","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":"22 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Entertainment Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","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":"27 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwec2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icec2025.entcomp.org","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}