Skripsi
ANALISIS PERBANDINGAN ALGORITMA A* DAN JUMP POINT SEARCH DALAM PENCARIAN JALUR PADA GIM PETUALANGAN BERBASIS ROBLOX
Digital game development requires efficient pathfinding algorithms. This study compares A* and Jump Point Search (JPS) in a hill-climbing adventure game based on Roblox. The three-dimensional terrain was converted into a 181x209 uniform-cost two-dimensional grid with a cell size of 4 Roblox units. Both algorithms were implemented in Roblox Studio using Lua and the octile distance heuristic for eight-directional movement. Testing was conducted in four scenarios with 30 trials for each algorithm in each scenario, producing 240 data points. The evaluation metrics were execution time, path length, and explored nodes. The results show that JPS reduced execution time by 84.62% to 95.31% and explored nodes by 80.14% to 91.31% compared with A*, while producing identical path lengths. Therefore, JPS is more efficient for grid-based terrain pathfinding in Roblox adventure games.
No other version available