Evolving the Hearthstone Meta
Authors:
- 1 August 2019
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Abstract
Balancing an ever growing strategic game of high complexity, such as Hearthstone is a complex task. The target of making strategies diverse and customizable results in a delicate intricate system. Tuning over 2000 cards to generate the desired outcome without disrupting the existing environment becomes a laborious challenge. In this paper, we discuss the impacts that changes to existing cards can have on strategy in Hearthstone. By analyzing the win rate on match-ups across different decks, being played by different strategies, we propose to compare their performance before and after changes are made to improve or worsen different cards. Then, using an evolutionary algorithm, we search for a combination of changes to the card attributes that cause the decks to approach equal, 50% win rates. We then expand our evolutionary algorithm to a multi-objective solution to search for this result, while making the minimum amount of changes, and as a consequence disruption, to the existing cards. Lastly, we propose and evaluate metrics to serve as heuristics with which to decide which cards to target with balance changes.Keywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Helping AI to Play Hearthstone using Neural NetworksAnnals of Computer Science and Information Systems, 2017
- Evaluation of Hearthstone Game States With Neural Networks and Sparse AutoencodingAnnals of Computer Science and Information Systems, 2017
- AI-based playtesting of contemporary board games2017
- Monte Carlo tree search experiments in hearthstone2017
- Improving hearthstone AI by learning high-level rollout policies and bucketing chance node events2017
- I am a legend: Hacking hearthstone using statistical learning methods2016
- Demonstrating the Feasibility of Automatic Game Balancing2016
- Hearthstone deck-construction with a utility system2016
- A Fast Elitist Non-dominated Sorting Genetic Algorithm for Multi-objective Optimization: NSGA-II2000
- Non-Cooperative GamesAnnals of Mathematics, 1951