Skripsi

PERBANDINGAN ALGORITMA A* DAN IDA* PADA PERMAINAN SNAKE GAME DALAM MENGHADAPI RINTANGAN

---

Penilaian

---

Snake Game is a game that was originally played on mobile phones many years ago, Snake Game continues to grow and captivate players with its simple game mechanics. In the context of game development, pathfinding is a key element to enable in-game characters to move through the game environment efficiently. Pathfinding algorithms such as A-Star(A*) and Iterative Deepening A-Star(IDA*) allow Snake to reach its destination point faster. A-Star(A*) utilizes the shortest cost estimation from the start point to the end point. While IDA* combines the concept of pathfinding with the "Iterative Deepening" technique, where the search is done iteratively by increasing the limit value of the function. This study aims to compare the performance of the two algorithms in dealing with obstacles. This research will compare the performance of the two algorithms against Snake in facing randomized obstacles. The evaluation results of this study found that the A-Star (A*) algorithm is superior in terms of time efficiency compared to Iterative Deepening A-Star (IDA*).

---

Availability

Inventory Code	Barcode	Call Number	Location	Status
2407000786	T138969	T1389692024	Central Library (Referens)	Available but not for loan - Not for Loan

Detail Information

Series Title

-

Call Number

T1389692024

Publisher

Inderalaya : Prodi Teknik Informatika, Fakultas Ilmu Komputer Universitas Sriwijaya., 2024

Collation

xv, 80 hlm.; Ilus.; 29 cm

Language

Indonesia

ISBN/ISSN

-

Classification

003.307

Content Type

Text

Media Type

unmediated

Carrier Type

-

Edition

-

Subject(s)

Model dan simulasi komputer
Prodi Teknik Informatika

Specific Detail Info

-

Statement of Responsibility

SEPTA

Other version/related

File Attachment

Comments

---

You must be logged in to post a comment