Application of Artificial Intelligence to the Development of Playing Ability in the Valorant Game

Adwita Fernanda; Abid Renata  Fadri Geovanni; Miftahul  Huda

doi:10.34306/itsdi.v4i1.566

Authors

Adwita Fernanda Muhammadiyah Yogyakarta University
Abid Renata Fadri Geovanni Muhammadiyah Yogyakarta University
Miftahul Huda Muhammadiyah Yogyakarta University

DOI:

https://doi.org/10.34306/itsdi.v4i1.566

Keywords:

Artificial Intelligence, Valorant Game, Algoritma Greedy, Heuristic Techniques

Abstract

From children to adults, everyone enjoys playing online games as a form of entertainment. Online games have a more popular market because they can meet other players worldwide connected to the internet. NPCs (players controlled by a computer system) are also available in online games as player substitutes or for skill practice. As a result, we have been interacting with artificial intelligence in the competition and our environment without realizing it. The game's AI (Artificial Intelligent) can offer an experience similar to playing with other players. Artificial intelligence may always influence online games, whether to replace opponents or choose the game's plot. First Person Shooter (FPS) game Valorant was made available for free on the Windows platform by Riot Games. With a CS: GO-like concept (Counter Strike Global Offensive). The amount of money you have available for each round must be calculated at the equipment purchasing phase to produce effective gaming equipment. The Greedy Algorithm is one of the algorithms that can be used to choose the equipment for the money/cred owned. This algorithm will select the most expensive item the player can buy each round so that the player's chances of winning that round increase.

Downloads

Download data is not yet available.

References

P. Cairns, C. Power, M. Barlet, G. Haynes, C. Kaufman, and J. Beeston, “Enabled players: The value of accessible digital games,” Games Cult., vol. 16, no. 2, pp. 262–282, 2021.

Y. Zhao, “Deep Learning of 3D High-Precision Model Digital Engraving of Next-Generation Games Based on Artificial Intelligence,” Adv. Multimed., vol. 2022, 2022.

V. Agarwal, M. C. Lohani, A. S. Bist, and D. Julianingsih, “Application of Voting Based Approach on Deep Learning Algorithm for Lung Disease Classification,” in 2022 International Conference on Science and Technology (ICOSTECH), 2022, pp. 1–7.

C. Zhang and Y. Lu, “Study on artificial intelligence: The state of the art and future prospects,” J. Ind. Inf. Integr., vol. 23, p. 100224, 2021.

J. C. F. Ho and R. Ng, “Perspective-taking of non-player characters in prosocial virtual reality games: Effects on closeness, empathy, and game immersion,” Behav. Inf. Technol., vol. 41, no. 6, pp. 1185–1198, 2022.

G. Maulani, N. Wiwin, V. Elmanda, and D. Julianingsih, “Conscious Fog and Electricity Computing Performance: Renewable Energy Case Study,” in 2022 International Conference on Science and Technology (ICOSTECH), 2022, pp. 1–7.

P. Karkallis, J. Blasco, G. Suarez-Tangil, and S. Pastrana, “Detecting video-game injectors exchanged in game cheating communities,” in European Symposium On Research In Computer Security, 2021, pp. 305–324.

W. Zhang, G. Muric, and E. Ferrara, “Individual and Collective Performance Deteriorate in a New Team: A Case Study of CS: GO Tournaments,” arXiv Prepr. arXiv2205.09693, 2022.

M. J. Scott et al., “Foundations for esports curricula in higher education,” in Proceedings of the 2021 Working Group Reports on Innovation and Technology in Computer Science Education, 2021, pp. 27–55.

E. Mao, “The effectiveness of event marketing in an attention economy: Findings from Twitch live-stream esports tournament events,” J. Media Econ., pp. 1–18, 2022.

A. Dehpanah, M. F. Ghori, J. Gemmell, and B. Mobasher, “Behavioral Player Rating in Competitive Online Shooter Games,” arXiv Prepr. arXiv2207.00528, 2022.

M. N. A. Khalid and H. Iida, “Objectivity and subjectivity in games: understanding engagement and addiction mechanism,” IEEE Access, vol. 9, pp. 65187–65205, 2021.

B. Rawat, A. S. Bist, N. Mehra, M. F. Fazri, and Y. A. Terah, “Study of Kumaon Language for Natural Language Processing in End-to-End Conversation Scenario,” IAIC Trans. Sustain. Digit. Innov., vol. 3, no. 2, pp. 143–149, 2022.

J. Zhu et al., “Player-AI interaction: What neural network games reveal about AI as play,” in Proceedings of the 2021 CHI Conference on Human Factors in Computing Systems, 2021, pp. 1–17.

S. Liu, X. Xu, and M. Claypool, “A Survey and Taxonomy of Latency Compensation Techniques for Network Computer Games,” ACM Comput. Surv., 2022.

J. Amutha, S. Sharma, and S. K. Sharma, “Strategies based on various aspects of clustering in wireless sensor networks using classical, optimization and machine learning techniques: Review, taxonomy, research findings, challenges and future directions,” Comput. Sci. Rev., vol. 40, p. 100376, 2021.

A. S. Anwar, B. Mardisentosa, and A. Williams, “The Role Of Technology In Education,” IAIC Trans. Sustain. Digit. Innov., vol. 3, no. 1, pp. 36–40, 2021.

J.-Q. Li et al., “A hybrid iterated greedy algorithm for a crane transportation flexible job shop problem,” IEEE Trans. Autom. Sci. Eng., 2021.

M. Toloueiashtian, M. Golsorkhtabaramiri, and S. Y. B. Rad, “An improved whale optimization algorithm solving the point coverage problem in wireless sensor networks,” Telecommun. Syst., vol. 79, no. 3, pp. 417–436, 2022.

A. Chug and S. Tarwani, “Identifying the Optimal Refactoring Dependencies Using Heuristic Search Algorithms to Maximize Maintainability,” Int. J. Softw. Eng. Knowl. Eng., vol. 31, no. 06, pp. 803–835, 2021.

Y.-Y. Huang, Q.-K. Pan, J.-P. Huang, P. N. Suganthan, and L. Gao, “An improved iterated greedy algorithm for the distributed assembly permutation flowshop scheduling problem,” Comput. Ind. Eng., vol. 152, p. 107021, 2021.

Z.-Y. Wang, Q.-K. Pan, L. Gao, and Y.-L. Wang, “An effective two-stage iterated greedy algorithm to minimize total tardiness for the distributed flowshop group scheduling problem,” Swarm Evol. Comput., vol. 74, p. 101143, 2022.

J. Mao, Q. Pan, Z. Miao, and L. Gao, “An effective multi-start iterated greedy algorithm to minimize makespan for the distributed permutation flowshop scheduling problem with preventive maintenance,” Expert Syst. Appl., vol. 169, p. 114495, 2021.