UMN Knowledge Center

perbandingan algoritma floyd-warshall dan dijkstra pada permainan hunt the wumpus

Daniel, Ignatius (2012) perbandingan algoritma floyd-warshall dan dijkstra pada permainan hunt the wumpus. Bachelor Thesis thesis, Universitas Multimedia Nusantara.

[img]
Preview
Text
BAB III.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img] Text
BAB IV.pdf
Restricted to Registered users only
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (2MB)
[img]
Preview
Text
LAMPIRAN.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (2MB) | Preview
[img]
Preview
Text
HALAMAN AWAL.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img]
Preview
Text
DAFTAR PUSTAKA.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (907kB) | Preview
[img]
Preview
Text
BAB I.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (1MB) | Preview
[img]
Preview
Text
BAB V.pdf
Available under License Creative Commons Attribution Non-commercial Share Alike.

Download (828kB) | Preview
[img]
Preview
Text
BAB II.pdf
Available under License Creative Commons Attribution Non-commercial No Derivatives.

Download (2MB) | Preview

Abstract

Nowadays, mobility is a crucial factor in society. Along with the increases in mobility, obstacles influencing it are increasing as well. Therefore, technology to support mobility continues to develope, one of which is Global Positioning System (GPS). Nowadays, GPS already has decent features and comes with accurate and comprehensive information. The title of this thesis is “Comparison of Floyd-Warshall and Dijkstra’s Algorithm on Hunt The Wumpus Game “. The goal is to compare Floyd-Warshall’s algorithm and Dijkstra‘s algorithm on “Hunt The Wumpus” game to find out the shortest path. This thesis is expected to be used to enhance the capabilities of GPS technology in order to deliver the shortest path and fastest path features that can be run in real time. Research is carried out by designing and implementing program based on “Hunt The Wumpus” game to compare both algorithms. They are compared on the basis of four criterias which are completeness, optimality, time complexity, and space complexity.The experiments revealed that Dijkstra’s and Floyd-Warshall’s algorithms are both complete and optimal. Also known that Floyd-Warshall’s algorithm is superior in term of speed, but Dijkstra’s Algorithm is superior in term of space usage.

Item Type: Thesis (Bachelor Thesis)
Subjects: T Technology > T Technology (General) > T55 Industrial engineering. Management engineering > T58.5-58.64 Information technology
T Technology > T Technology (General) > T55 Industrial engineering. Management engineering > T58.5-58.64 Information technology > T58.59 Algorithm
Divisions: Fakultas Teknik Informatika > Program Studi Informatika
Depositing User: mr admin umn
Date Deposited: 31 Jan 2020 02:38
Last Modified: 31 Jan 2020 02:38
URI: http://kc.umn.ac.id/id/eprint/12109

Actions (login required)

View Item View Item