Demonstrating the Feasibility of Automatic Game Balancing
Open accessThe DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
Game balancing is an important part of the (computer) game design process, in which designers adapt a game prototype so that the resulting gameplay is as entertaining as possible. In industry, the evaluation of a game is often based on costly playtests with human players. It suggests itself to automate this process using artificial players for the prediction of gameplay and outcome. In this paper, the feasibility of automatic balancing is investigated for the card game top trumps using simulation- and deck-based objectives. Additionally, the necessity of a multi-objective approach is asserted by assessing the only published (single-objective) method. We apply a multi-objective evolutionary algorithm to obtain decks that optimise objectives developed to express the fairness and the excitement of a game of top trumps, e.g. win rate and average number of tricks. The results are compared with decks from published top trumps games using the aforementioned objectives. The possibility to generate decks better or at least as good as decks from published top trumps decks in terms of these objectives is demonstrated. Our results indicate that automatic balancing with the presented approach is feasible even for more complex games such as real-time strategy games.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Controllable procedural map generation via multiobjective evolution
Togelius, J., Preuss, M., Beume, N., Wessing, S., Hagelbäck, J., Yannakakis, G. N., & Grappiolo, C. (2013) · Genetic Programming and Evolvable Machines · doi:10.1007/s10710-012-9174-5 · Cited by 48 · cited 1×
“with regards to playability [18], solvability [17], or diversity [15, 10].”
Background
Cited by
Simulation-Driven Balancing of Competitive Game Levels With Reinforcement Learning
Rupp, F., Eberhardinger, M., & Eckert, K. (2024) · IEEE Transactions on Games · doi:10.1109/tg.2024.3399536 · Cited by 11
“Volz et al. [16] balanced decks for a card game and, similar to this work, they evaluate the quality with a simulation-driven approach.”
GEEvo: Game Economy Generation and Balancing with Evolutionary Algorithms
Rupp, F., & Eckert, K. (2024) · 2024 IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec60901.2024.10612054 · Cited by 7
It might be balanced, but is it actually good? An Empirical Evaluation of Game Level Balancing
Rupp, F., Puddu, A., Becker-Asano, C., & Eckert, K. (2024) · 2024 IEEE Conference on Games (CoG) · doi:10.1109/cog60054.2024.10645642 · Cited by 4
Level the Level: Balancing Game Levels for Asymmetric Player Archetypes With Reinforcement Learning
Rupp, F., & Eckert, K. (2025) · Proceedings of the 20th International Conference on the Foundations of Digital Games · doi:10.1145/3723498.3723747 · Cited by 1
“Evolutionary algorithms have been used by Volz et al. [20] to balance and build decks for card games, by De Mesentier Silva [9] to balance the meta of a collectible card game, by Morosan et al. [10] for real-time strategy (RTS) games, and for game economies by Rupp et al. [15].”
Metadata
- Authors
- Volz, V., Rudolph, G., & Naujoks, B.
- Venue
- Proceedings of the Genetic and Evolutionary Computation Conference 2016
- Publisher
- ACM
- Published
- 2016-07-20
- Pages
- 269-276
- OpenAlex
- W2302255789
- Cited by
- 51
- References
- 1
- FWCI
- 3.45
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Demonstrating the Feasibility of Automatic Game Balancing. https://app.cochat.ai/papers/10.1145/2908812.2908913
- The paper
- Volz, V., Rudolph, G., & Naujoks, B. (2016). Demonstrating the Feasibility of Automatic Game Balancing. Proceedings of the Genetic and Evolutionary Computation Conference 2016. https://doi.org/10.1145/2908812.2908913
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.