Jurnal ULTIMA Computing
Vol 10 No 2 (2018): Ultima Computing : Jurnal Sistem Komputer

Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin

D.J. Owen Hoetama (Universitas Multimedia Nusantara)
Farica Perdana Putri (Universitas Multimedia Nusantara)
P.M. Winarno (Universitas Multimedia Nusantara)



Article Info

Publish Date
19 Mar 2019

Abstract

Maze game is an interesting game and used to spend time. However, in the maze game, the level used forthis game still uses static levels. Static levels make the maze shape stay the same if we play the same level. Thus, players will quickly feel bored because it finds the same complexity. Maze generator is a static level problem solution on the maze game. This research uses Fisher-Yates Shuffle algorithm and Flood Fill algorithm to make maze generator. Fisher-Yates Shuffle algorithm is used for wall position randomization and Flood Fill algorithm to keep the maze results to remain resolved. The results of the application implementation yielded 30 mazes and were tested using the Hamming Distance algorithm, yielding that the result of the maze formed is always different. The average percentage rate difference produced 48% each time the maze was formed. The results of the maze that was formed performed perfect maze checking with the result of 83.33% percentage. Index Terms— Fisher-Yates Shuffle, Flood Fill, MazeGenerator, Hamming Distance

Copyrights © 2018






Journal Info

Abbrev

SK

Publisher

Subject

Computer Science & IT Control & Systems Engineering Engineering

Description

urnal ULTIMA Computing merupakan Jurnal Program Studi Sistem Komputer Universitas Multimedia Nusantara yang menyajikan artikel-artikel penelitian ilmiah dalam bidang Sistem Komputer serta isu-isu teoritis dan praktis yang terkini, mencakup komputasi, organisasi dan arsitektur komputer, programming, ...