Study on Stages Evaluation for 2D Action Game Generated by DC-GAN Based on Artificial Intelligence

Kotaro Nagahiro, Sho Ooi, Mutsuo Sano
{"title":"Study on Stages Evaluation for 2D Action Game Generated by DC-GAN Based on Artificial Intelligence","authors":"Kotaro Nagahiro, Sho Ooi, Mutsuo Sano","doi":"10.17706/ijcce.2021.10.2.28-36","DOIUrl":null,"url":null,"abstract":"Recently, research on generative adversarial networks (GANs) in deep learning has advanced rapidly. For instance, in the field of image recognition, using a GAN, the number of training data was increased. GAN have also been used to create new similar images using training images, which can help designers such as car designer, character designer, game designer and more. We have been researching a method to automatically generate a game stage based on a dot-picture using GAN. So far, we have been studying game stage generation using GAN. In this study, we consider an evaluation method for generated game stages. Specifically, we consider using the A * search algorithm to evaluate the playability of the generated game stage from the number of jumps and the clear time. As a result, the jumping count of an automatically player using the A * algorithm was 17 times for the original stage, 12 times for stage No.1, 16 times for stage No.2, and 18 times for stage No.3. Next, the clear time was 9 seconds for the original stage, 8 seconds for stage No.1, 10 seconds for stage No.2, and 11 seconds for stage No.3. In other words, we suggest stage No.1 is simpler than the original stage, and stage 2 and stage 3 are a little more difficult than the original stage.","PeriodicalId":23787,"journal":{"name":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","volume":"15 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"World Academy of Science, Engineering and Technology, International Journal of Electrical, Computer, Energetic, Electronic and Communication Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17706/ijcce.2021.10.2.28-36","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, research on generative adversarial networks (GANs) in deep learning has advanced rapidly. For instance, in the field of image recognition, using a GAN, the number of training data was increased. GAN have also been used to create new similar images using training images, which can help designers such as car designer, character designer, game designer and more. We have been researching a method to automatically generate a game stage based on a dot-picture using GAN. So far, we have been studying game stage generation using GAN. In this study, we consider an evaluation method for generated game stages. Specifically, we consider using the A * search algorithm to evaluate the playability of the generated game stage from the number of jumps and the clear time. As a result, the jumping count of an automatically player using the A * algorithm was 17 times for the original stage, 12 times for stage No.1, 16 times for stage No.2, and 18 times for stage No.3. Next, the clear time was 9 seconds for the original stage, 8 seconds for stage No.1, 10 seconds for stage No.2, and 11 seconds for stage No.3. In other words, we suggest stage No.1 is simpler than the original stage, and stage 2 and stage 3 are a little more difficult than the original stage.
基于人工智能的DC-GAN生成2D动作游戏的阶段评估研究
近年来,深度学习中生成对抗网络(GANs)的研究进展迅速。例如,在图像识别领域,使用GAN增加了训练数据的数量。GAN还被用于使用训练图像创建新的类似图像,这可以帮助设计师,如汽车设计师,角色设计师,游戏设计师等。我们一直在研究一种基于GAN的基于点图的自动生成游戏阶段的方法。到目前为止,我们一直在研究使用GAN生成游戏阶段。在本研究中,我们考虑了生成博弈阶段的评估方法。具体来说,我们考虑使用A *搜索算法从跳跃次数和清除时间来评估生成的游戏阶段的可玩性。因此,使用a *算法的自动选手在原阶段的跳跃次数为17次,在第1阶段为12次,在第2阶段为16次,在第3阶段为18次。接下来,原赛段的清净时间为9秒,第一赛段为8秒,第二赛段为10秒,第三赛段为11秒。换句话说,我们建议第1阶段比原阶段简单,第2阶段和第3阶段比原阶段困难一些。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信