Setyadi, Bulan Rahmat (2018) Rancang Bangun Pembangkit Skenario Dinamis Pada Permainan Bangjo Puzzle Berbasis Android. Undergraduate thesis, Institut Teknologi Sepuluh Nopember.
Preview |
Text
5112100150-Undergraduate_Theses.pdf - Accepted Version Download (4MB) | Preview |
Abstract
Permainan adalah salah satu media hiburan yang cukup populer. Sifatnya yang praktis dan mudah digunakan menjadikan permainan banyak diminati oleh berbagai kalangan. Terdapat berbagai macam jenis permainan yang beredar di masyarakat. Salah satunya adalah permainan puzzle. Namun, seringkali skenario yang ada pada permainan puzzle bersifat statis. Skenario yang statis akan menyebabkan pengguna merasa cepat bosan karena telah menjumpai skenario yang sama berkali-kali.
Tugas akhir ini merancang dan membangun sebuah permainan puzzle dengan skenario yang dinamis. Pengguna diharuskan menyelesaikan skenario-skenario yang tersaji dalam tiga tingkat, yaitu easy, medium, dan hard. Metode yang digunakan dalam pengacakan skenario adalah Midpoint Displacement. Setelah itu, dilakukan penentuan jalur dengan menggunakan algoritma Brute Force. Pengujian yang dilakukan adalah pengujian pembangkitan puzzle dan pengujian penyelesaian skenario. Hasil pengujian menunjukkan bahwa pembangkitan puzzle dan penyelesaian skenario telah berhasil dilakukan. ====================================================================================================================
Game is one of the entertainment media that is quite popular. Many people choose game as because it’s practical and easy to use. There are various types of games that has been published. One of them is puzzle game. The problem is, often the scenario in puzzle game is static. A static scenario will cause users to feel bored quickly because they have encountered the same scenario many times.
This final project is design and development a puzzle game with dynamic scenarios. Users are required to complete the scenarios that represented in three levels, easy, medium, and hard. The method used in randomizing scenarios is Midpoint Displacement. After that, Brute Force algorithm will be used for determining the solution path. Testing of puzzle generation and testing of scenario completion will be conducted. The result show that puzzle generation and scenario completion have been applied successfully.
| Item Type: | Thesis (Undergraduate) |
|---|---|
| Additional Information: | RSIf 793.73 Set r-1 3100018075034 |
| Uncontrolled Keywords: | Algoritma Brute Force; Permainan Puzzle; Midpoint Displacement; Brute Force Algorithm; Puzzle Game; Midpoint Displacement |
| Subjects: | G Geography. Anthropology. Recreation > GV Recreation Leisure > GV1469.2 Computer games L Education > L Education (General) Q Science > QA Mathematics > QA76.585 Cloud computing. Mobile computing. |
| Divisions: | Faculty of Information Technology > Informatics Engineering > 55201-(S1) Undergraduate Thesis |
| Depositing User: | Bulan Rahmat Setyadi |
| Date Deposited: | 09 Apr 2018 02:10 |
| Last Modified: | 21 Sep 2020 05:21 |
| URI: | http://repository.its.ac.id/id/eprint/50660 |
Actions (login required)
 |
View Item |