Abstract
In the last few years, the Hearthstone AI international Competition has been gaining fame among the scientific community. Several different entries have been presented using varied approaches. One of the best, EVA, was based on a Greedy approach combined with an Evolutionary Algorithm. However, almost all the proposals were designed to work in a general way, i.e. for any of the possible heroes. This generalisation presents a flaw, since the exclusive cards per hero are not really exploited, nor their potential different behaviour profiles. This paper follows a similar philosophy to EVA, also hybridizing Greedy + Evolutionary algorithms, but having in mind three different, and extended among the community, archetypes or profiles: Aggro, Control and Midrange. Thus, three different behaviours have been optimized aiming to create a more specialized agent able to use an Artificial Intelligence engine depending on the hero to play with. To prove the value of the approach several experiments have been conducted, comparing the evolved agents with EVA in many different matches using three different heroes. The results show an improvement over EVA for the three profile-based agents, as well as an excellent performance when combined with a MonteCarlo Tree Search approach.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bäck, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, New York (1996)
Bhatt, A., Lee, S., de Mesentier Silva, F., Watson, C.W., Togelius, J., Hoover, A.K.: Exploring the hearthstone deck space. In: Dahlskog, S., et al. (eds.) Proceedings of the 13th International Conference on the Foundations of Digital Games, FDG 2018, Malmö, Sweden, 07–10 August 2018, pp. 18:1–18:10. ACM (2018)
Bursztein, E.: I am a legend: Hacking hearthstone using statistical learning methods. In: IEEE Conference on Computational Intelligence and Games, CIG 2016, Santorini, Greece, September 20–23, 2016, IEEE, pp. 1–8 (2016)
Chaslot, G.M.J.B., Winands, M.H.M., Uiterwijk, J.W.H.M., van den Herik, H.J., Bouzy, B.: Progressive strategies for Monte-Carlo tree search. New Math. Natural Comput. 4(3), 343–359 (2008)
Demilich1, MetaStone - A Hearthstone simulator (2015). https://github.com/demilich1/metastone. Accessed 25 Mar 2020
Dockhorn - Bot downloads. https://dockhorn.antares.uberspace.de/wordpress/bot-downloads. Accessed 25 Mar 2020
Esparcia-Alcázar, A.I., Moravec, J.: Fitness approximation for bot evolution in genetic programming. Soft Comput. 17(8), 1479–1487 (2013)
Fernández-Ares, A., García-Sánchez, P., Mora, A.M., Castillo, P.A., Merelo J.J.: There Can Be only One: Evolving RTS Bots via Joust Selection. In: Squillero G., Burelli P. (eds) EvoApplications 2016. LNCS, vol. 9597, pp. 541–557. Springer, Cham (2016). https://doi.org/https://doi.org/10.1007/978-3-319-31204-0_35
García-Sánchez, P., Tonda, A.P., Fernández-Leiva, A.J., Cotta, C.: Optimizing Hearthstone agents using an evolutionary algorithm. Knowl. Based Syst. vol. 188 (2020)
García-Sánchez, P., Tonda, A.P., García, A.M., Squillero, G., Merelo Guervós, J.J.: Automated playtesting in collectible card games using evolutionary algorithms: a case study in Hearthstone. Knowl.-Based Syst. 153, 133–146 (2018)
García-Sánchez, P., Tonda, A.P., Squillero, G., Mora, A.M., Merelo Guervós, J.J.: Evolutionary deckbuilding in Hearthstone. In: IEEE Conference on Computational Intelligence and Games, CIG 2016, Santorini, Greece, September 20–23, IEEE, pp. 1–8 (2016)
Góes, L.F.W., et al.: Honingstone: building creative combos with honing theory for a digital card game. IEEE Trans. Comput. Intell. AI Games 9(2), 204–209 (2017)
Goldberg, D.E.: Genetic Algorithms in search, optimization and machine learning. Addison Wesley (1989)
Grad, L.: Helping AI to play Hearthstone using neural networks. In: 2017 Federated Conference on Computer Science and Information
Gwiazda, T.D.: Genetic Algorithms Reference Vol.1 Crossover for single-objective numerical optimization problems, Tomasz Gwiazda Books, Lomianki (2006)
Haralick, R.M., Elliot, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14, 263–313 (1980)
HearthSim, SabberStone - Hearthstone simulator. https://hearthsim.info/sabberstone/. Accessed 25 Mar 2020
Hearthstone AI Competition. https://www.is.ovgu.de/Research/HearthstoneAI.html. Accessed 25 Mar 2020
Hearthstone, Gamepaedia - Advanced Rulebook. https://hearthstone.gamepedia.com/Advanced_rulebook. Accessed 25 Mar 2020
Herrera, F., Lozano, M., Verdegay, J.: Tackling real-coded genetic algorithms: operators and tools for behavioural analysis. Artif. Intell. Rev. 12, 265–319 (1998)
Kim, T.S., Na, J.C., Kim, K.J.: Optimization of an autonomous car controller using a self-adaptive evolutionary strategy. Int. J. Adv. Rob. Syst. 9(3), 73 (2012)
Mora, A.M., Fernández-Ares, A., Merelo, J.J., García-Sánchez, P., Fernandes, C.M.: Effect of noisy fitness in real-time strategy games player behaviour optimisation using evolutionary algorithms. J. Comput. Sci. Technol. 27(5), 1007–1023 (2012)
Neubauer, A.: A theoretical analysis of the non-uniform mutation operator for the modified genetic algorithm. In:: Proceedings of the IEEE International Conference on Evolutionary Computation. IEEE Press, Indianapolis, IN, USA (1997)
Santos, A., Santos, P.A., Melo, F.S.: Monte Carlo tree search experiments in hearthstone. In: IEEE Conference on Computational Intelligence and Games, CIG 2017, New York, NY, USA, 22–25 August 2017, pp. 272–279. IEEE (2017)
Swiechowski, M., Tajmajer, T., Janusz, A.: Improving Hearthstone AI by combining MCTS and supervised learning algorithms In: 2018 IEEE Conference on Computational Intelligence and Games, CIG 2018, Maastricht, the Netherlands, 14–17 August, pp. 1–8. IEEE (2018)
Thomas, L.C.: Games, Theory and Applications. Mineola New York: Dover Publications. p. 19 (2003)
Zhang, S., Buro, M.: Improving hearthstone AI by learning high-level rollout policies and bucketing chance node events. In: IEEE Conference on Computational Intelligence and Games, CIG 2017, New York, NY, USA, 22–25 August 2017, IEEE, pp. 309–316 (2017)
Acknowledgements
This work has been supported in part by projects B-TIC-402-UGR18 (FEDER and Junta de Andalucía), RTI2018–102002-A-I00 (Ministerio Español de Ciencia, Innovación y Universidades), and project TIN2017–85727-C4-{1–2}-P (Ministerio Español de Economía y Competitividad).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
García, A.R., García, A.M.M. (2021). A Profile-Based ‘GrEvolutionary’ Hearthstone Agent. In: Castillo, P.A., Jiménez Laredo, J.L. (eds) Applications of Evolutionary Computation. EvoApplications 2021. Lecture Notes in Computer Science(), vol 12694. Springer, Cham. https://doi.org/10.1007/978-3-030-72699-7_22
Download citation
DOI: https://doi.org/10.1007/978-3-030-72699-7_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-72698-0
Online ISBN: 978-3-030-72699-7
eBook Packages: Computer ScienceComputer Science (R0)