Faiz Hilmawan Masyfa, Herman Tolle, Tibyani Tibyani, Pitoyo Hartono
Players’ engagement intensity in computer games is influenced by the level of difficulty the game offers. Traditional game-level plots adopt linear increases that sometimes do not match the users’ skill growth, causing boredom and hampering the users’ further skill growth. In this study, a nonlinear level adjustment scenario was proposed based on the Fibonacci sequence that provides gradual increases in the early stages of the games but more drastic changes in later phases. Here, the game’s difficulty level was automatically decided by a machine learning method. To test the proposed method, comparisons between four level adjustments in computer games: traditional plots, self-selected plots, linear adaptive plots, and the proposed nonlinear adaptive plots were run. The experiment was carried out with 40 testers. The experiment results show that the best player’s peak level in the proposed nonlinear adjustment was twice as high as that of linear adjustment. Also, the number of stages required to reach the peak under the proposed scenario was half that of linear games. This high playing performance goes hand in hand with deep playing engagement. The results demonstrate the efficiency of the proposed level adjustment algorithm. © 2023, Serious Games Society. All rights reserved.
Faculty of Computer Science, Brawijaya University, Malang, Indonesia; Information Technology, Faculty of Computer Science, Brawijaya University, Malang, Indonesia; School of Engineering, Chukyo University, Nagoya, Japan
Research at a Glance
Register to unlock
Topics & SDG Alignment
Register to unlock
Collaboration
Register to unlock
Author Profile (Selected)
Register to unlock
References Overview
Register to unlock
Journal & Source
Register to unlock
Metadata & Integrity
Register to unlock