Perbandingan Penerapan Algoritma A*, IDA*, Jump Point Search, dan PEA* P ada Permainan Pacman

Isi Artikel Utama

Rosa Delima
Gregorius Titis Indrajaya
Abednego Kristiawan Takaredase
Ignatia Dhian E.K.R.
Antonius Rachmat C

Abstrak

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*

Unduhan

Data unduhan belum tersedia.

Rincian Artikel

Cara Mengutip
[1]
R. Delima, G. T. Indrajaya, A. K. Takaredase, I. D. E.K.R., dan A. R. C, “Perbandingan Penerapan Algoritma A*, IDA*, Jump Point Search, dan PEA* P ada Permainan Pacman”, JuTISI, vol. 2, no. 3, Des 2016.
Bagian
Articles
Biografi Penulis

Rosa Delima, Universitas Kristen Duta Wacana

Fakultas Teknologi Informasi