Back to results list
Show full item record
Please use this identifier to cite or link to this item:
|Title:||Adaptive dynamic game balancing based on data mining of sequential patterns||Authors:||Chiu, Suk-yi Kitty||Degree:||M.Phil.||Issue Date:||2008||Abstract:||It is the responsibility of a game or game level designer to provide players with a balanced game, one that offers a satisfying level of challenge. This can be done using traditional game programs and artificial intelligence (Al) techniques but it is becoming increasingly common for researchers are using dynamic game balancing, which uses reinforcement learning and focuses on the movement of non-player characters, especially in scripted games. However, this is not suitable for all game genres, such as those that use mazes or require dynamic terrains. In this paper we propose to adjust the level of difficulty of a game by using data mined for sequential patterns that can be used to analyze a player's behaviors. Our method first mines individual gameplay data and then transforms it into a set of sequential patterns. This approach is tested here on a maze game. We capture the behavior of several player's and the parameters of the game environment such as the number of dead ends achieved, hammers used on every level, how quickly players achieve the goal, the size of the maze, number of monsters hit, and the number of walls broken on each level. Feedback from participants in our experiments was very positive as they found the games designed using the proposed approach to be both more interesting and more balanced. This proposed approach differs from existing rule base game Al algorithms in three ways: (1) the game levels are based on the past experience of the player; (2) the approach is data-driven; (3) the game levels are unique and are not predefined, making them more adaptive, which contributes to making the game more interesting and balanced.||Subjects:||Hong Kong Polytechnic University -- Dissertations.
Computer games -- Design.
Computer games -- Programming.
|Pages:||viii, 123 leaves : ill. ; 30 cm.|
|Appears in Collections:||Thesis|
View full-text via https://theses.lib.polyu.edu.hk/handle/200/2402
Citations as of Jun 4, 2023
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.