Automatic Design of Balanced Board Games

@inproceedings{Marks2007AutomaticDO,
  title={Automatic Design of Balanced Board Games},
  author={Joe Marks and Vincent Hom},
  booktitle={Artificial Intelligence and Interactive Digital Entertainment Conference},
  year={2007}
}
  • J. MarksV. Hom
  • Published in
    Artificial Intelligence and…
     6 June 2007
  • Computer Science
AI techniques are already widely used in game software to provide computer-controlled opponents for human players. However, game design is a more-challenging problem than game play. Designers typically expend great effort to ensure that their games are balanced and challenging. Dynamic game-balancing techniques have been developed to modify a game-engine’s parameters in response to user play. In this paper we describe a first attempt at using AI techniques to design balanced board games like… 
View via Publisher
ojs.aaai.org
86 Citations
Highly Influential Citations
2
Background Citations
43
Methods Citations
15

Figures and Tables from this paper

86 Citations

Evaluating Competitive Game Balance with Restricted Play

This work argues for a formulation in which carefully restricted agents are played against standard agents, and develops this restricted-play balance framework, and evaluates its utility by building a tool capable of calculating measures of balance for a large family of games.

AI-based playtesting of contemporary board games

Four different game-playing agents that embody different playing styles are defined and used to analyze Ticket to Ride, showing which cities on the map are most desirable, and that the relative attractiveness of cities is remarkably consistent across numbers of players.

Improving Game Design through Responsive Configuration and Procedural Generation

This thesis investigates a method by which game configuration and creation might be automated in such a way that a numerical rating could be assigned to any given game feature, thereby allowing the enjoyability of a game feature to be gauged in a more objective way.

Recombinable Game Mechanics for Automated Design Support

An architecture based on the event calculus is proposed, a logical representation designed for reasoning about time in an elaboration-tolerant way, meaning that designs can be changed by adding or removing sets of axioms rather than modifying brittle hard-coded representations.

Evolvestone: An evolutionary generator of balanced digital collectible card games

Evolvestone is proposed, an evolutionary generator of balanced digital collectible card games (DCCG), inspired on Hearthstone that creates Hearthstone-like card games by exploring the space of parameters, building sets of new cards and applying different metrics to ensure game balance.

Chapter 6 Rules and mechanics

This chapter will discuss representations for game rules of different kinds, along with methods to generate them, and evaluation functions and constraints that help us judge complete games rather than just isolated content artefacts.

Winning Isn ’ t Everything : Training Agents to Playtest Modern Games

This paper presents an alternative context for developing AI that plays games, and proposes a learning and planning framework that is uniquely tuned to the environment and needs of modern game engines, developers and players.

General video game rule generation

The proposed framework builds on the GVGAI software and thus asks the rule generator for rules defined in the Video Game Description Language, and three different rule generators: a random, a constructive and a search- based generator.

Monte Carlo Tree Search player for Mai- Star and Balance Evaluation

It is found that the Mai-Star game is unbalanced for any one-versus-one match-up, and it is suggested that one of the geishas named Oboro has features that give her an advantage over otherGeishas for winning.

Block-based Approach to Observe Game Content Space in Endless-runner Game

In this research, procedural content generation (PCG) technique is proposed to categorize the difficulty of obstacles in Flappy Bird and combines search-based and learning-based PCG techniques.
...

References

SHOWING 1-10 OF 18 REFERENCES

DIFFICULTY SCALING OF GAME AI

It is concluded that dynamic scripting, using top culling, can enhance the entertainment value of games by scaling the difficulty level of the game AI to the playing skill of the human player.

METAGAME : A New Challenge for Games and Learning

The goals, research areas, and general concerns for the idea of Metagame are discussed, which is to write programs which take as input the rules of a set of new games within a pre-specified class, generated by a program which is publicly available.

General Game Playing: Overview of the AAAI Competition

An overview of the technical issues and logistics associated with this summer's competition, as well as the relevance of general game playing to the long range-goals of artificial intelligence, are overviewed.

AI for Dynamic Difficulty Adjustment in Games

This paper presents a probabilistic method (drawn predominantly from Inventory Theory) for representing and reasoning about uncertainty in games, and describes the implementation of these techniques, and discusses how the resulting system can be applied to create flexible interactive experiences that adjust on the fly.

Challenge-sensitive action selection: an application to game balancing

This work presents an innovative use of reinforcement learning techniques to build intelligent agents that adapt their behavior in order to provide dynamic game balancing and applies it to a real-time fighting game, obtaining good results.

Fundamentals of Game Design

This in-depth resource offers a first-hand look into the process of designing a game, from initial concept to final tuning, and comes with engaging end-of-chapter exercises, design worksheets, and case studies.

Online Coevolution for Action Games

This work presents four different methods to do online evolution of the agents: using game specific information; merging offline-evolved data with online evolution; using online data only; and using them together.

Heuristic Programming in Artificial Intelligence

The first Soviet Computer Olympiad 2nd Computer Olympiad reports Go intellect wins two gold medals databases in Awari an architecture for a sophisticated mechanical bridge player design and…

Dynamic Game Balancing: An Evaluation of User Satisfaction

An evaluation by human players of dynamic game balancing approaches indicates that adaptive approaches are more effective, and enumerates some issues encountered in evaluating users' satisfaction, in the context of games, and depicts some learned lessons.

Genetic programming - on the programming of computers by means of natural selection

  • J. Koza
  • Computer Science
    Complex adaptive systems
  • 1993
This book discusses the evolution of architecture, primitive functions, terminals, sufficiency, and closure, and the role of representation and the lens effect in genetic programming.