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

ULTIMA Computing

View Publication Info
 
 
Field Value
 
Title Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin
Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin
 
Creator Hoetama, D.J. Owen
Putri, Farica Perdana
Winarno, P.M.
 
Description 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
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
 
Publisher Universitas Multimedia Nusantara
 
Date 2019-03-19
 
Type info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
 
Format application/pdf
 
Identifier http://ejournals.umn.ac.id/index.php/SK/article/view/1064
10.31937/sk.v10i2.1064
 
Source ULTIMA Computing; Vol 10 No 2 (2018): Ultima Computing : Jurnal Sistem Komputer; 59-64
Ultima Computing : Jurnal Sistem Komputer; Vol 10 No 2 (2018): Ultima Computing : Jurnal Sistem Komputer; 59-64
2549-4007
2355-3286
10.31937/sk.v10i2
 
Language eng
 
Relation http://ejournals.umn.ac.id/index.php/SK/article/view/1064/737
 
Rights Copyright (c) 2018 ULTIMA Computing
http://creativecommons.org/licenses/by-sa/4.0
 

Contact Us

The PKP Index is an initiative of the Public Knowledge Project.

For PKP Publishing Services please use the PKP|PS contact form.

For support with PKP software we encourage users to consult our wiki for documentation and search our support forums.

For any other correspondence feel free to contact us using the PKP contact form.

Find Us

Twitter

Copyright © 2015-2018 Simon Fraser University Library