|
Hokkaido University Collection of Scholarly and Academic Papers >
Theses >
博士 （情報科学） >
Automatic generation of stage data for music games with an appropriate difficulty control method
|
Files in This Item:
|
|
|
Related Items in HUSCAP:
|
| Title: | Automatic generation of stage data for music games with an appropriate difficulty control method |
| Other Titles: | 音楽ゲームのステージデータの自動生成における適切な難易度調整手法について |
| Authors: | 有働, 篤人 Browse this author |
| Issue Date: | 23-Mar-2023 |
| Publisher: | Hokkaido University |
| Abstract: | The music game is one of the popular game styles where a player is typically requested to take specific actions at specific moments corresponding to the prominent acoustic epoch such as onsets in the music playing in the background. Stage data for such games record a sequence of actions (e.g., hitting a pad) the player has to take, and the timing of action is often represented by a moving target over- lapping a stationary object on the screen. Creating such data is a difficult task that requires skilled artists. It is also time-consuming because such games require multiple sequences with different difficulty levels.Multiple attempts at generating stage data using the machine learning approach have been made, including Donahue’s[1] Dance Dance Convolution (DDC), which generates stage data for the music game called Dance Dance Revolution (DDR) from the user input of audio data of a piece of music and a desired difficulty level. DDC uses two models, step placement and step selection, to generate stage data. Step placement model finds onsets by employing convolutional neural network (CNN) and long-short term memory (LSTM), which step selection deter- mines the type of action requirement (e.g., which button to press). It is found that when the desired difficulty level is lower, the generated stage data has significantly more action requirements (or targets) than the man-made counterpart.We propose a method for generating sparse stage data with specified difficulty levels with two different approaches: 1. quantifying difficulty by examining the movement of the player required by the game 2. collecting statistics from man– made stage data analyzed from musical knowledge.The difficulty of given stage data is mainly determined by the density of targets, but the complexity of the action also plays a role. Movement Cost (MC) is a value we propose which quantifies the difficulty of any stage data by calculating optimal action the player is required to make in order to play the game perfectly.By comparing the MC of the generated stage data and comparing it to the average of MC of the man-made ones, the two models can be modified to generate more or less targets or different type of targets.On the other hand, introducing musical knowledge such as rhythm representations enables us to collect statistics from man-made stage data. This is because rhythm representations can be used to classify the targets. In the method we pro- pose, the music is first divided into units called measures, then the measures are subdivided into certain number of sections. The onsets of the subdivisions are marked as significant points in the music, which is then used to classify the targets.Using this method, we can create a preferred number of targets per class for each difficulty level, which we can reference to refine the generated stage data so that they have the level of difficulty desired by the user. |
| Conffering University: | 北海道大学 |
| Degree Report Number: | 甲第15547号 |
| Degree Level: | 博士 |
| Degree Discipline: | 情報科学 |
| Examination Committee Members: | (主査) 教授 土橋 宜典, 教授 坂本 雄児, 教授 長谷山 美紀, 特任教授 荒木 健治 |
| Degree Affiliation: | 情報科学院(情報科学専攻) |
| Type: | theses (doctoral) |
| URI: | http://hdl.handle.net/2115/89478 |
| Appears in Collections: | 課程博士 (Doctorate by way of Advanced Course) > 情報科学院(Graduate School of Information Science and Technology)
学位論文 (Theses) > 博士 （情報科学）
|
|
