ARIGHI, FAHRUR NABIL and Efendi, Rusdi (2018) PERBANDINGAN ALGORITMA GREEDY DAN A STAR UNTUK PENGEJARAN OLEH GHOST DALAM PERMAINAN PAC-MAN. Undergraduate thesis, Sriwijaya University.
![[thumbnail of RAMA_55201_09021381419092.pdf]](http://repository.unsri.ac.id/style/images/fileicons/text.png) |
Text
RAMA_55201_09021381419092.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (1MB) |
Preview |
Text
RAMA_55201_09021381419092_8826630017_01_front_ref.pdf - Accepted Version Available under License Creative Commons Public Domain Dedication. Download (700kB) | Preview |
|
Text
RAMA_55201_09021381419092_8826630017_02.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (563kB) |
|
Text
RAMA_55201_09021381419092_8826630017_03.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (391kB) |
|
Text
RAMA_55201_09021381419092_8826630017_04.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (604kB) |
|
Text
RAMA_55201_09021381419092_8826630017_05.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (432kB) |
|
Text
RAMA_55201_09021381419092_8826630017_06.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (181kB) |
|
Text
RAMA_55201_09021381419092_8826630017_07_ref.pdf - Accepted Version Restricted to Repository staff only Available under License Creative Commons Public Domain Dedication. Download (481kB) |
Abstract
Chasing pattern by NPC in a game oftenly can be predicted by player, therefore it needs strategy to chasing player in the game. Greedy algorithm is one of the most popular algorithm which used to solve path finding problem. And A* is an algorithm which used a heuristic function to find the path. This research comparing greedy and A* algorithm to determine chasing path by ghost. The test planned by two ways, there are with patterned and random test, in 10x in the patterned test greedy has better time in 7 of 10 test with mean time 0.122 seconds or 1.6% faster than A*. And in 10x in the random test greedy has better time in 9 of 10 test with mean time 3.39 seconds. The factor that influence in chasing time are the amount of intersection and the size of game area. Based on test result the conclusion is greedy algorithm is better than A* in time of chasing in Pac-Man game.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Subjects: | T Technology > T Technology (General) > T58.5-58.64 Information technology > T58.5 General works Management information systems Cf. HD30.213 Industrial management Cf. HF5549.5.C6+ Communication in personnel management Cf. TS158.6 Automatic data collection systems (Production control) |
| Depositing User: | Mr Halim Sobri |
| Date Deposited: | 20 Sep 2019 02:11 |
| Last Modified: | 20 Sep 2019 03:35 |
| URI: | http://repository.unsri.ac.id/id/eprint/8185 |
Actions (login required)
 |
View Item |