| dc.contributor.author | Agung, Muhammad Bangun | |
| dc.date.accessioned | 2026-01-30T06:11:07Z | |
| dc.date.available | 2026-01-30T06:11:07Z | |
| dc.date.issued | 2023 | |
| dc.identifier.uri | https://dspace.uc.ac.id/handle/123456789/9066 | |
| dc.description | Game is something that is commonly used in the society. Whether as a hobby, work/industry, or as a means of learning. In a game, it is not uncommon to find Non-Player Characters who can move by following a certain path without hitting any obstacles on their way. This is made possible by implementing the pathfinding algorithm in the game. The Floyd-Warshall algorithm is an algorithm used to find the shortest path based on the All-Pairs Shortest Path problem. This algorithm can find the shortest distance by finding the length (sum of weight) of the shortest path between all pairs of points. In designing this game, the Floyd-Warshall algorithm will be applied to find the shortest path of the Non-Player Character. The problem that needs to be analyzed is how to apply the Floyd-Warshall algorithm in adventure games to find the shortest path for a Non-Player Character. To analyze this problem, it is necessary to understand how the Floyd-Warshall algorithm works to determine the shortest path. Applying the Floyd-Warshall algorithm to adventure games can be done by creating a graph based on the grid map, determining the matrix value based on the graph, then determining the shortest path based on the matrix value and the last step is moving the Non-Player Character based on the specified shortest path value. Tests were carried out using white box and black box methods to determine the performance of the Floyd-Warshall algorithm in adventure games. From the test results it can be concluded that the Floyd-Warshall algorithm can be applied well in adventure games, but the level of complexity of obstacles makes it more difficult for the algorithm to find the shortest path to the player character | en_US |
| dc.description.abstract | Game merupakan salah satu hal yang banyak digunakan oleh masyarakat. Baik sebagai hobi, pekerjaan/industri, maupun sarana belajar. Di dalam sebuah game, tidak jarang ditemukan Non-Player Character yang dapat bergerak dengan mengikuti jalur tertentu tanpa mengenai halangan-halangan di jalur yang dilaluinya. Hal ini dimungkinkan dengan menerapkan algoritma pathfinding (pencarian jalur) dalam game tersebut. Algoritma Floyd-Warshall adalah algoritma yang digunakan untuk mencari jalur terpendek berdasarkan permasalahan All-Pairs Shortest Path. Algoritma ini dapat mencari jarak terpendek dengan menemukan panjangnya (jumlah bobot) dari jalur terpendek antara semua pasangan titik. Dalam perancangan game ini, algoritma FloydWarshall diterapkan untuk mencari jalur lintasan terpendek dari Non-Player Character. Masalah yang perlu dianalisis adalah bagaimana cara menerapkan algoritma Floyd-Warshall dalam game petualangan untuk mencari jalur terpendek Non-Player Character. Untuk menganalisis masalah tersebut, diperlukan pemahaman tentang cara kerja algoritma Floyd-Warshall untuk menentukan jalur terpendek. Menerapkan algoritma Floyd-Warshall pada game petualangan dapat dilakukan cara membuat graph berdasarkan grid map, menentukan nilai matriks berdasarkan graph, kemudian menentukan shortest path berdasarkan nilai matriks dan langkah terakhir menggerakkan Non-Player Character berdasarkan nilai shortest path yang telah ditentukan. Pengujian dilakukan dengan cara white box dan black box untuk mengetahui kinerja algoritma Floyd-Warshall dalam game petualangan. Dari hasil pengujian dapat disimpulkan bahwa algoritma Floyd-Warshall dapat diterapkan dengan baik dalam game petualangan, namun tingkat kerumitan halangan menyebabkan algoritma semakin sulit untuk mencari shortest path ke karakter pemain. | en_US |
| dc.language.iso | id | en_US |
| dc.publisher | UNIVERSITAS CIPUTRA SURABAYA | en_US |
| dc.subject | Algoritma Floyd-Warshall, game, game petualangan, jalur terpendek | en_US |
| dc.subject | Floyd-Warshall algorithm, game, adventure game, shortest path | en_US |
| dc.title | PENERAPAN ALGORITMA FLOYD WARSHALL UNTUK PENCARIAN SHORTEST PATH NONPLAYER CHARACTER DALAM GAME PETUALANGAN | en_US |
| dc.type | Thesis | en_US |
| dc.identifier.kodeprodi | 55201 | |
| dc.identifier.nim | 201417037 | |
| dc.identifier.dosenpembimbing | Caecilia Citra Lestari | |
