Demonstrating the Feasibility of Automatic Game Balancing
Authors:
Open Access
- 20 July 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 269-276
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.Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Searching for good and diverse game levels2014
- Solving the balance problem of massively multiplayer online role-playing games using coevolutionary programmingApplied Soft Computing, 2014
- Recursive Monte Carlo search for imperfect information games2013
- Controllable procedural map generation via multiobjective evolutionGenetic Programming and Evolvable Machines, 2013
- Dynamic Difficulty Balancing for Cautious Players and Risk TakersInternational Journal of Computer Games Technology, 2012
- Statistical Methods for Convergence Detection of Multi-Objective Evolutionary AlgorithmsEvolutionary Computation, 2009
- Monte Carlo search applied to card selection in Magic: The Gathering2009
- SMS-EMOA: Multiobjective selection based on dominated hypervolumeEuropean Journal of Operational Research, 2007
- Exploring the Performance of Stochastic Multiobjective Optimisers with the Second-Order Attainment FunctionLecture Notes in Computer Science, 2005
- Evolutionary Multi-Criterion Optimization2005