Aji, Dimas Bayu (2024) Implementasi algoritma A* dalam menentukan rute terpendek menuju posisi player pada game Kalih D Maze. Sarjana thesis, UIN Sunan Gunung Djati Bandung.
|
Text (COVER)
1_Cover.pdf Download (29kB) | Preview |
|
|
Text (ABSTRAK)
2_Abstrak.pdf Download (253kB) | Preview |
|
|
Text (DAFTAR ISI)
3_Daftar Isi.pdf Download (247kB) | Preview |
|
|
Text (BAB I)
4_BAB 1.pdf Download (646kB) | Preview |
|
![[img]](https://digilib.uinsgd.ac.id/style/images/fileicons/text.png) |
Text (BAB II)
5_BAB 2.pdf Restricted to Registered users only Download (465kB) | Request a copy |
|
|
Text (BAB III)
6_BAB 3.pdf Restricted to Registered users only Download (931kB) | Request a copy |
|
|
Text (BAB IV)
7_BAB 4.pdf Restricted to Registered users only Download (488kB) | Request a copy |
|
|
Text (BAB V)
8_BAB 5.pdf Restricted to Registered users only Download (37kB) | Request a copy |
|
|
Text (DAFTAR PUSTAKA)
9_Daftar Pustaka.pdf Restricted to Registered users only Download (350kB) | Request a copy |
Abstract
In a previous study conducted by Adityo Wahyu Pratama, titled "Implementation of the A* Algorithm to Determine the Movement of NPCs (Non-Playable Characters) in the Hungry Pigs Game" [1], it was found that the A* algorithm was not effective in the arcade-style game Hungry Pigs. Therefore, the purpose of this research is to test the performance of the A* algorithm in the maze game genre. This research uses the Agile method in its development. The A* algorithm performs searches in large areas, such as games with maze-like types. This algorithm is applied to enemy characters to give ability for the enemies to chase the player character. Testing is done by calculating the algorithm's performance speed in finding the nearest route by taking the smallest value. From the test results, it can be concluded that the A* algorithm is very effective in finding routes in large areas in maze-type games because it can work optimally with an average speed obtained from the overall algorithm performance testing of 0.058424 seconds."
| Item Type: | Thesis (Sarjana) |
|---|---|
| Uncontrolled Keywords: | A-star; Game; Agile; Pathfinding Algorithm |
| Subjects: | Systems > Computer Modeling and Simulation Data Processing, Computer Science Numerical Analysis > Algorithms Applied Physics > Computer Engineering Indoor Games of Skill > Electronic Game |
| Divisions: | Fakultas Sains dan Teknologi > Program Studi Teknik Informatika |
| Depositing User: | Dimas Bayu Aji |
| Date Deposited: | 17 Sep 2024 01:38 |
| Last Modified: | 17 Sep 2024 01:38 |
| URI: | https://digilib.uinsgd.ac.id/id/eprint/97745 |
Actions (login required)
 |
View Item |
