Gregorius Titis Indrajaya, Gregorius Titis
Unknown Affiliation

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Perbandingan Penerapan Algoritma A*, IDA*, Jump Point Search, dan PEA* P ada Permainan Pacman Delima, Rosa; Indrajaya, Gregorius Titis; Takaredase, Abednego Kristiawan; E.K.R., Ignatia Dhian; C, Antonius Rachmat
Jurnal Teknik Informatika dan Sistem Informasi Vol 2 No 3 (2016): JuTISI
Publisher : Maranatha University Press

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.28932/jutisi.v2i3.646

Abstract

Pathfinding is a way to find the shortest route between two points. There are several A* variant algorithms such as Iterative Deepening A* (IDA*) algorithm, Partial Expansion A* (PEA*), and Jump Point Search (JPS). In this research, the writer evaluates the performance of A*, IDA* algorithm, JPS, and PEA* algorithm. The algorithms are implemented in pacman game and the writer get the data by measuring visited nodes, and the route it takes.  Based  on the  analysis  of  algorithms  in  a  game,  it concluded that  the algorithms  have  the  same  path solution, but JPS algorithm has less visited nodes than A*, IDA*, and PEA*