Setyawan, Nicodemus Roy Mayta (2009) Seeking a Thief with BFS Algorithm. Other thesis, Fakultas Ilmu Komputer, UNIKA Soegijapranata.
|
Text (COVER)
05.02.0016 Nicodemus Roy Mayta S COVER.pdf Download (180kB) | Preview |
|
![[img]](http://repository.unika.ac.id/style/images/fileicons/text.png) |
Text (BAB I)
05.02.0016 Nicodemus Roy Mayta S BAB I.pdf Restricted to Registered users only Download (56kB) |
|
|
Text (BAB II available document only in library of Soegijapranata Catholic University)
05.02.0016 Nicodemus Roy Mayta S BAB II.pdf Restricted to Repository staff only Download (138kB) |
|
|
Text (BAB III available document only in library of Soegijapranata Catholic University)
05.02.0016 Nicodemus Roy Mayta S BAB III.pdf Restricted to Repository staff only Download (46kB) |
|
|
Text (BAB IV available document only in library of Soegijapranata Catholic University)
05.02.0016 Nicodemus Roy Mayta S BAB IV.pdf Restricted to Repository staff only Download (77kB) |
|
|
Text (BAB V available document only in library of Soegijapranata Catholic University)
05.02.0016 Nicodemus Roy Mayta S BAB V.pdf Restricted to Repository staff only Download (176kB) |
|
|
Text (BAB VI)
05.02.0016 Nicodemus Roy Mayta S BAB VI.pdf Restricted to Registered users only Download (39kB) |
|
|
Text (DAFTAR PUSTAKA)
05.02.0016 Nicodemus Roy Mayta S DAFTAR PUSTAKA.pdf Download (36kB) | Preview |
Abstract
Seeking a Thief is a simple game which everyone can play it. This game have two player, there are a police and a thief. This game have a purpose for police to find a way to capture a thief. The location of police, thief and wall is putted by user. If the police find a wall, he must look for the other way until he find the thief. Seeking a Thief is c~ted with Java Language Programming and use aUI for (Graphical User Interface) programming to the perfonnance. This project uses Array and tree as a data structure. This pro·eet use BFS (Breath First Search) as an algorithm to move a police to find a thief. With that case, the conclution are tree as a data structure ean solve the way for police to find a way to catch the thief and for BFS (Breath First Search) as an algorithm also can solve the problem too. So, you must try this game, lets check it out
| Item Type: | Thesis (Other) |
|---|---|
| Subjects: | 000 Computer Science, Information and General Works > 004 Data processing & computer science |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Mr Ign. Setya Dwiana |
| Date Deposited: | 27 Jan 2016 02:17 |
| Last Modified: | 27 Jan 2016 02:17 |
| URI: | http://repository.unika.ac.id/id/eprint/7470 |
| Keywords: | UNSPECIFIED |
Actions (login required)
 |
View Item |