Related papers: Fast Game Content Adaptation Through Bayesian-based Player Modelling

Fast Game Content Adaptation Through Bayesian-based Player Modelling

URL: http://arxiv.org/abs/2105.08484v1
Date: Tue, 18 May 2021 12:56:44 GMT
Title: Fast Game Content Adaptation Through Bayesian-based Player Modelling
Authors: Miguel Gonz\'alez-Duque, Rasmus Berg Palm and Sebastian Risi
Abstract summary: This paper explores a novel method to realize this goal in the context of dynamic difficulty adjustment (DDA) The aim is to constantly adapt the content of a game to the skill level of the player, keeping them engaged by avoiding states that are either too difficult or too easy. Current systems for DDA rely on expensive data mining, or on hand-crafted rules designed for particular domains, and usually adapts to keep players in the flow.
Score: 6.510061176722249
License: http://creativecommons.org/licenses/by/4.0/
Abstract: In games (as well as many user-facing systems), adapting content to user's preferences and experience is an important challenge. This paper explores a novel method to realize this goal in the context of dynamic difficulty adjustment (DDA). Here the aim is to constantly adapt the content of a game to the skill level of the player, keeping them engaged by avoiding states that are either too difficult or too easy. Current systems for DDA rely on expensive data mining, or on hand-crafted rules designed for particular domains, and usually adapts to keep players in the flow, leaving no room for the designer to present content that is purposefully easy or difficult. This paper presents a Bayesian Optimization-based system for DDA that is agnostic to the domain and that can target particular difficulties. We deploy this framework in two different domains: the puzzle game Sudoku, and a simple Roguelike game. By modifying the acquisition function's optimization, we are reliably able to present a puzzle with a bespoke difficulty for players with different skill levels in less than five iterations (for Sudoku) and fifteen iterations (for the simple Roguelike), significantly outperforming simpler heuristics for difficulty adjustment in said domains, with the added benefit of maintaining a model of the user. These results point towards a promising alternative for content adaption in a variety of different domains.

Related papers

Instruction-Driven Game Engine: A Poker Case Study [53.689520884467065]
The IDGE project aims to democratize game development by enabling a large language model to follow free-form game descriptions and generate game-play processes. We train the IDGE in a curriculum manner that progressively increases its exposure to complex scenarios. Our initial progress lies in developing an IDGE for Poker, which not only supports a wide range of poker variants but also allows for highly individualized new poker games through natural language inputs.
arXiv Detail & Related papers (2024-10-17T11:16:27Z)
CoDA: Instructive Chain-of-Domain Adaptation with Severity-Aware Visual Prompt Tuning [6.467495914193209]
Unsupervised Domain Adaptation (UDA) aims to adapt models from labeled source domains to unlabeled target domains. CoDA instructs models to distinguish, focus, and learn from discrepancies at scene and image levels. CoDA achieves SOTA performances on widely-used benchmarks under all adverse scenes.
arXiv Detail & Related papers (2024-03-26T04:09:08Z)
Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Desig [69.02688684221265]
This paper presents an evolutionary algorithm, empowered by expert-knowledge informeds, for solving logical puzzles in video games efficiently. We discuss multiple variations of hybrid genetic approaches for constraint satisfaction problems that allow us to find a diverse set of near-optimal solutions for puzzles.
arXiv Detail & Related papers (2023-02-17T18:15:33Z)
Personalized Game Difficulty Prediction Using Factorization Machines [0.9558392439655011]
We contribute a new approach for personalized difficulty estimation of game levels, borrowing methods from content recommendation. We are able to predict difficulty as the number of attempts a player requires to pass future game levels, based on observed attempt counts from earlier levels and levels played by others. Our results suggest that FMs are a promising tool enabling game designers to both optimize player experience and learn more about their players and the game.
arXiv Detail & Related papers (2022-09-06T08:03:46Z)
Modeling Content Creator Incentives on Algorithm-Curated Platforms [76.53541575455978]
We study how algorithmic choices affect the existence and character of (Nash) equilibria in exposure games. We propose tools for numerically finding equilibria in exposure games, and illustrate results of an audit on the MovieLens and LastFM datasets.
arXiv Detail & Related papers (2022-06-27T08:16:59Z)
DL-DDA -- Deep Learning based Dynamic Difficulty Adjustment with UX and Gameplay constraints [0.8594140167290096]
We propose a method that automatically optimize user experience while taking into consideration other players and macro constraints imposed by the game. We provide empirical results of an internal experiment that was done on $200,000$ and was found to outperform the corresponding manuals crafted by game design experts.
arXiv Detail & Related papers (2021-06-06T09:47:15Z)
Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
arXiv Detail & Related papers (2021-04-17T20:33:24Z)
Deep Policy Networks for NPC Behaviors that Adapt to Changing Design Parameters in Roguelike Games [137.86426963572214]
Turn-based strategy games like Roguelikes, for example, present unique challenges to Deep Reinforcement Learning (DRL) We propose two network architectures to better handle complex categorical state spaces and to mitigate the need for retraining forced by design decisions.
arXiv Detail & Related papers (2020-12-07T08:47:25Z)
Integrating Variable Reduction Strategy with Evolutionary Algorithm for Solving Nonlinear Equations Systems [78.08328822422382]
We propose to incorporate the variable reduction strategy (VRS) into Evolutionary algorithm (EA) to solve NESs. VRS makes full use of the systems of expressing a NES and uses some variables (i.e., core variable) to represent other variables (i.e., reduced variables) through the variable relationships existing in the equation systems. To test the effectiveness of VRS in dealing with NESs, this paper integrates VRS into two existing state-of-the-art EA methods.
arXiv Detail & Related papers (2020-07-13T09:58:31Z)
Exploring Dynamic Difficulty Adjustment in Videogames [0.0]
We will present Dynamic Difficulty Adjustment (DDA), a recently arising research topic. DDA aims to develop an automated difficulty selection mechanism that keeps the player engaged and properly challenged. We will present some recent research addressing this issue, as well as an overview of how to implement it.
arXiv Detail & Related papers (2020-07-06T15:05:20Z)
Finding Game Levels with the Right Difficulty in a Few Trials through Intelligent Trial-and-Error [16.297059109611798]
Methods for dynamic difficulty adjustment allow games to be tailored to particular players to maximize their engagement. Current methods often only modify a limited set of game features such as the difficulty of the opponents, or the availability of resources. This paper presents a method that can generate and search for complete levels with a specific target difficulty in only a few trials.
arXiv Detail & Related papers (2020-05-15T17:48:18Z)

This list is automatically generated from the titles and abstracts of the papers in this site.