Abstract
The challenging nature of the Fighting Game AI Challenge originates from the short instant of response time which is a typical requirement in real-time fighting games. Handling such real-time constraint requires either tremendous computing power or a clever algorithm design. The former is uncontrollable by the participants, as for the latter, the competition has received a variety of submissions, ranging from the naivest case analysis approach to those using highly advanced computing techniques such as Genetic Algorithms (GA), Reinforcement Learning (RL) or Monte Carlo Tree Search (MCTS), but none could provide a stable solution, especially in the LUD division, where the environment setting is unknown in advance. Our study presents our submission to this challenge in which we designed a winning solution in the LUD division which, for the first time, stably outperformed all players in all competition categories. Our results demonstrate that a proper blend of case analysis and advanced algorithms could result in an ultimate performance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chaslot, G., Bakkes, S., Szita, I., Spronck, P.: Monte-carlo tree search: a new framework for game AI. In: AIIDE. The AAAI Press (2008)
Nork, B., Lengert, G.D., Litschel, R.U., Ahmad, N., Lam, G.T., Logofătu, D.: Machine learning with the pong game: a case study. In: Pimenidis, E., Jayne, C. (eds.) EANN 2018. CCIS, vol. 893, pp. 106–117. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-98204-5_9
Campbell, M., Hoane, J., Hsu, F.: Deep blue. Artif. Intell. 134(1–2), 57–83 (2002)
Silver, D., et al.: Mastering the game of Go with deep neural networks and tree search. Nature 529(7587), 484–489 (2016)
Are processors pushing up against the limits of physics? https://arstechnica.com/science/2014/08/are-processors-pushing-up-against-the-limits-of-physics. Accessed 21 Feb 2019
Fighting Game AI Competition. http://www.ice.ci.ritsumei.ac.jp/~ftgaic/index-1.html. Accessed 21 Feb 2019
Fighting Game AI Competition. https://www.slideshare.net/ftgaic/2018-fighting-game-ai-competition?ref=http://www.ice.ci.ritsumei.ac.jp/~ftgaic/index-R.html. Accessed 21 Feb 2019
Kim, M.J., Ahn, C.W.: Hybrid fighting game AI using a genetic algorithm and Monte Carlo tree search. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2018, Kyoto, Japan (2018)
Zuin, G., Macedo, Y., Chaimowicz, L., Pappa, G.: Discovering combos in fighting games with evolutionary algorithms. In: GECCO 2016, Denver, CO, USA, pp. 277–284 (2016)
James, S., Konidaris, G., Rosman, B.: An analysis of monte carlo tree search. In: Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence (AAAI 2017) (2017)
Heineman, G., Pollice, G., Selkow, S.: Algorithms in a Nutshell. O’Reilly Media, Sebastopol (2016)
Jangid, M.: Kotlin – the unrivaled android programming language lineage. Imperial J. Interdisc. Res. 3, 256–259 (2017)
Silver, D., et al.: Mastering the game of Go without human knowledge. Nature 550, 354 (2017)
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Thuan, L.G., Logofătu, D., Badică, C. (2019). A Hybrid Approach for the Fighting Game AI Challenge: Balancing Case Analysis and Monte Carlo Tree Search for the Ultimate Performance in Unknown Environment. In: Macintyre, J., Iliadis, L., Maglogiannis, I., Jayne, C. (eds) Engineering Applications of Neural Networks. EANN 2019. Communications in Computer and Information Science, vol 1000. Springer, Cham. https://doi.org/10.1007/978-3-030-20257-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-030-20257-6_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-20256-9
Online ISBN: 978-3-030-20257-6
eBook Packages: Computer ScienceComputer Science (R0)