Application of The A* Algorithm to Search for the Shortest Route in the Shoot'em Up Game Application

##plugins.themes.academic_pro.article.sidebar##

Published Aug 31, 2023
https://doi.org/10.24252/jagti.v3i2.65
Download
PDF
Statistic

Downloads

Download data is not yet available.
Vol. 3 No. 2 (2023): March - August

##plugins.themes.academic_pro.article.main##

Hasniati
STMIK KHARISMA Makassar
Syaiful Rahman
STMIK KHARISMA Makassar
Suyono
STMIK KHARISMA Makassar

Abstract

The purpose of this research is to implement A* algorithm for finding shortest path in a shooter game. To design the system, use case diagram will be used to explain the functional requirements of the system, and the activity diagram to describe the system workflow. While in the application development that can be used in a desktop with a Windows operating system, Unity will be used. The testing methods used in this study are the black box method to validate that the game can run as designed, beta testing and software quality testing to verify that the A* algorithm was implemented well. The results of this study  are 1) According to the results of black box testing, it can be concluded that all the buttons and features on the application manage to work as designed; 2) According to the result of endurance testing that have been done, it can be concluded that A* is very accurate and can find the shortest path in a short time, and the time used for the pathfinding is very dependant on the node count. 

##plugins.themes.academic_pro.article.details##

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

How to Cite
[1]
Hasniati, S. Rahman, and Suyono, “Application of The A* Algorithm to Search for the Shortest Route in the Shoot’em Up Game Application”, Jagti, vol. 3, no. 2, pp. 9-14, Aug. 2023.

References

  1. M. Ranjitha, N. Kazaka, dan J. Lincy, “Artificial Intelligence Algorithms and Techniques in the computation of PlayerAdaptive Games”, Journal of Physics: Conference Series, Vol. 1427, 012006, 2020.
  2. C. Xiao, dan S. Hao , “A*-based Pathfinding in Modern Computer Games”, International Journal of Computer Science and Network Security, VOL.11 No.1, 2011.
  3. Y. Sazaki, H. Satria and M. Syahroyni, "Comparison of A and dynamic pathfinding algorithm with dynamic pathfinding algorithm for NPC on car racing game," in 11th International Conference on Telecommunication Systems Services and Applications (TSSA), 2017.
  4. D. Kurniadi, A. Mulyani dan R. S. Maolani, "Implementation of Pathfinding Algorithm in Sundanese Land History Educational Game”, 2nd International Conference on Innovative and Creative Information Technology (ICITech), 2021.
  5. P. Sara Lutami, dkk, “A Review of Pathfinding in Game Development”, CEPAT Journal of Computer Engineering: Progress, Application and Technology, Vol. 1 No. 1, hal 46-55, 2022.
  6. P. Adhitama, U. Muhammad, dan P. Novianti, “Pengembangan Aplikasi Game Shoot'em Up Star Assault Dengan Game Maker Studio”, Prosiding Seminar Ilmu Komputer dan Teknologi Informasi, Vol. 2 No. 1, hal 321-324, 2017.
  7. Patel, A. https://www.redblobgames.com/ tanggal diakses 20 Februari 2017 [3] Perkins, Dorothy. 2013. Encyclopedia of China: The Essential Reference to China, Its History Culture. Routledge. New York.
  8. Suyanto. 2014. Artificial Intelligence. Diterbitkan oleh Informatika, Bandung
  9. Syukriyah, Y., Falahah., Solihin, H. 2016 Penerapan Algoritma A* (Star) Untuk Mencari Rute Tercepat Dengan Hambatan. Seminar Nasional Telekomunikasi dan Informatika (SELISIK 2016).
  10. Thompson, J., Berbank-Green, B., Cusworth, N. 2007 Game Design: Principles, Practice, and Techniques - The Ultimate Guide for the aspiring game designer.