Conference paper

Performance Analysis of Dijkstra and A∗ Algorithms for Determining the Shortest Path on the Sunset Map in Valorant

Anik Nur Handayani, Jevri Tri Ardiansah, Muhammad Luqman Al Ghaniyy, Muhammad Salmansyah Mousavi Akhyar

2025 9th International Conference on Electrical, Electronics and Information Engineering, ICEEIE 2025 · 2025

0Citations
4Authors

Summary

Summary Performance Analysis of Dijkstra and A∗ Algorithms for Determining the Shortest Path on the Sunset Map in Valorant
Key quote

The A* algorithm demonstrated significantly faster execution time in all test cases, making it more suitable for real-time efficiency in gameplay contexts.

Handayani et al., 2025

Details

Abstract

This study examines the performance of the Dijkstra and A∗ algorithms in uncovering the shortest path for strategic movement on the Sunset map in the game Valorant. Both algorithms were tested through five path-uncovering scenarios, each with 15 trials, using Euclidean range for node calculations. The outcomes show that both algorithms produce the same optimal path cost, proving the equivalence of their solutions. However, the A* algorithm demonstrated significantly faster execution time (better time complexity) in all test cases, while Dijkstra had slightly lower memory consumption (better space complexity). These uncoverings reveal a trade-off: A* is more suitable for real-time efficiency in gameplay contexts, while Dijkstra offers a slight memory advantage. Both algorithms meet the completeness standards for path uncovering in the tested Valorant environment. © 2025 IEEE.

Affiliations

State University of Malang, Malang, Indonesia; Universitas Negeri Malang, Malang, Indonesia

Institute of Electrical and Electronics Engineers Inc.