Dynamic Difficulty Adjustment in Digital Games Using Genetic Algorithms

Matheus Weber, Pollyana Notargiacomo
{"title":"Dynamic Difficulty Adjustment in Digital Games Using Genetic Algorithms","authors":"Matheus Weber, Pollyana Notargiacomo","doi":"10.1109/SBGames51465.2020.00019","DOIUrl":null,"url":null,"abstract":"The difficulty of a game is intrinsically connected with the experience of immersion in it and with its success. One of the main reasons for a player to drop a game is that the game is either too easy or too hard for him/her. In practice, players become either bored or frustrated if playing a game that is not balanced for them. An approach to prevent this kind of behavior is to dynamically adjust the difficulty of a game so that the game adapts to the player's experience by evaluating the difficulty of a game and changing its environment to become easier or harder for the player. In this paper, we propose a real-time solution using a Genetic Algorithm which helps to provide the exact amount of challenge that a player needs to not be bored or frustrated thus balancing the difficulty of a game. We review several other papers that approached this problem, which characteristics an algorithm has to have to approach the problem, and how to balance this in a generic way. The main idea of this paper is to create an approach that can be modified and coupled to any kind of game by using a Genetic Algorithm.","PeriodicalId":335816,"journal":{"name":"2020 19th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)","volume":"178 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 19th Brazilian Symposium on Computer Games and Digital Entertainment (SBGames)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SBGames51465.2020.00019","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

The difficulty of a game is intrinsically connected with the experience of immersion in it and with its success. One of the main reasons for a player to drop a game is that the game is either too easy or too hard for him/her. In practice, players become either bored or frustrated if playing a game that is not balanced for them. An approach to prevent this kind of behavior is to dynamically adjust the difficulty of a game so that the game adapts to the player's experience by evaluating the difficulty of a game and changing its environment to become easier or harder for the player. In this paper, we propose a real-time solution using a Genetic Algorithm which helps to provide the exact amount of challenge that a player needs to not be bored or frustrated thus balancing the difficulty of a game. We review several other papers that approached this problem, which characteristics an algorithm has to have to approach the problem, and how to balance this in a generic way. The main idea of this paper is to create an approach that can be modified and coupled to any kind of game by using a Genetic Algorithm.
基于遗传算法的数字游戏动态难度调整
游戏的难度与沉浸体验及其成功有着内在的联系。玩家放弃游戏的一个主要原因是,游戏对他/她来说要么太简单,要么太难。实际上,如果玩家玩的游戏不平衡,他们就会感到无聊或沮丧。防止这种行为的一种方法是动态调整游戏的难度,这样游戏就可以通过评估游戏的难度来适应玩家的体验,并改变游戏环境,使其变得更容易或更困难。在本文中,我们提出了一种使用遗传算法的实时解决方案,这有助于提供玩家不会感到无聊或沮丧的挑战数量,从而平衡游戏的难度。我们回顾了其他几篇解决这个问题的论文,一个算法必须具备哪些特征来解决这个问题,以及如何以一种通用的方式平衡这一点。本文的主要思想是创造一种可以通过使用遗传算法修改并与任何类型的游戏相结合的方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信