Asrianto, Dony (2022) Penerapan Algoritma A* Path Finding Pada Game Top Down Shooter “Shelter-Survival Mode” Berbasis Android Menggunakan Metode Incremental. Other thesis, Universitas Islam Riau.
![[img]](http://repository.uir.ac.id/style/images/fileicons/text.png) |
Text
183510370.pdf - Submitted Version Restricted to Repository staff only Download (3MB) | Request a copy |
Abstract
Path finding is a concept used in a game to move characters without hitting an obstacle, so that characters can move like human behavior in the real world. Selection of a bad path finding algorithm will cause the NPC in the game to look brainless (stupid). This will be a problem in making the game that causes the game to be unpleasant. For this reason, in making games, you must understand how to choose a path finding algorithm that is suitable for the game and how to apply it to a game. The A* (A star) algorithm is an effective solution to the path finding algorithm problem. The A* algorithm provides optimal output results, because the results are obtained through checking the feasibility of the costs required to reach a node from another node. To make this application using Unity 3D software. Based on the results of user testing, obtained a percentage of 86.4% with 25 respondents, so this application can run well on the user's device.
| Item Type: | Thesis (Other) | ||||||
|---|---|---|---|---|---|---|---|
| Contributors: |
|
||||||
| Subjects: | Q Science > QA Mathematics > QA76 Computer software T Technology > T Technology (General) |
||||||
| Divisions: | > Teknik Informatika | ||||||
| Depositing User: | Luthfi Pratama ST | ||||||
| Date Deposited: | 10 Apr 2023 02:27 | ||||||
| Last Modified: | 10 Apr 2023 02:27 | ||||||
| URI: | http://repository.uir.ac.id/id/eprint/21311 |
Actions (login required)
 |
View Item |
