Article Per Year (5 Year)
p-Index From 2020 - 2025
0
P-Index
This Author published in this journals
All Journal Jurnal ULTIMA Computing
D.J. Owen Hoetama
Universitas Multimedia Nusantara
Computer Science & IT Control & Systems Engineering Engineering

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin D.J. Owen Hoetama; Farica Perdana Putri; P.M. Winarno
Ultima Computing : Jurnal Sistem Komputer Vol 10 No 2 (2018): Ultima Computing : Jurnal Sistem Komputer
Publisher : Faculty of Engineering and Informatics, Universitas Multimedia Nusantara

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (1592.456 KB) | DOI: 10.31937/sk.v10i2.1064

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
Co-Authors Farica Perdana Putri P. M. Winarno