Modeling Player Experience with the N-Tuple Bandit Evolutionary Algorithm

Authors

  • Kamolwan Kunanusont University of Essex
  • Simon Lucas Queen Mary University of London
  • Diego Pérez-Liébana Queen Mary University of London

DOI:

https://doi.org/10.1609/aiide.v14i1.13039

Keywords:

General Video Game Playing, Game Parameterization, Evolutionary Algorithms, Player Experience

Abstract

Automatic game design is an increasingly popular area of research that consists of devising systems that create content or complete games autonomously. The interest in such systems is two-fold: games can be highly stochastic environments that allow presenting this task as a complex optimization problem and automatic play-testing, becoming benchmarks to advance the state of the art on AI methods. In this paper, we propose a general approach that employs the N-Tuple Bandit Evolutionary Algorithm (NTBEA) to tune parameters of three different games of the General Video Game AI (GVGAI) framework. The objective is to adjust the game experience of the players so the distribution of score events through the game approximates certain pre-defined target curves. We report satisfactory results for different target score trends and games, paving the path for future research in the area of automatically tuning player experience.

Downloads

Published

2018-09-25

How to Cite

Kunanusont, K., Lucas, S., & Pérez-Liébana, D. (2018). Modeling Player Experience with the N-Tuple Bandit Evolutionary Algorithm. Proceedings of the AAAI Conference on Artificial Intelligence and Interactive Digital Entertainment, 14(1), 215-221. https://doi.org/10.1609/aiide.v14i1.13039