{"title":"基于人工智能的DC-GAN生成2D动作游戏的阶段评估研究","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":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"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\":null,\"pages\":null},\"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}","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}
Study on Stages Evaluation for 2D Action Game Generated by DC-GAN Based on Artificial Intelligence
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.