Husein Nabil, S. M. Nasution, Ratna Astuti Nugrahaeni
{"title":"Comparison of Real Time Iterative Deepening Best First Search Algorithm and A* Algorithm on Maze Chase Game NPC","authors":"Husein Nabil, S. M. Nasution, Ratna Astuti Nugrahaeni","doi":"10.1109/ISRITI48646.2019.9034621","DOIUrl":null,"url":null,"abstract":"Maze Chase is a game that has a maze background. In this game there are players who have the task, which is to take all the points in the labyrinth. In the Maze Chase game there is also an NPC (Non-Playable Character) that aims to chase players so that players cannot take all the points in the labyrinth. Players can be considered to have won the game is that all the points in the labyrinth have been taken by the player. The author implements the A* and RIBS path search algorithms for NPCs so that NPCs can chase players. That way we get the travel time comparison to the players on each path search algorithm. After testing the average travel time to NPC players with the A* algorithm faster 0.116196% than NPC with the RIBS algorithm.","PeriodicalId":367363,"journal":{"name":"2019 International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 International Seminar on Research of Information Technology and Intelligent Systems (ISRITI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISRITI48646.2019.9034621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Maze Chase is a game that has a maze background. In this game there are players who have the task, which is to take all the points in the labyrinth. In the Maze Chase game there is also an NPC (Non-Playable Character) that aims to chase players so that players cannot take all the points in the labyrinth. Players can be considered to have won the game is that all the points in the labyrinth have been taken by the player. The author implements the A* and RIBS path search algorithms for NPCs so that NPCs can chase players. That way we get the travel time comparison to the players on each path search algorithm. After testing the average travel time to NPC players with the A* algorithm faster 0.116196% than NPC with the RIBS algorithm.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
