Hoetama, Owen and Putri, Farica Perdana and Winarno, P.M (2018) Algoritma Fisher-Yates Shuffle dan Flood Fill sebagai Maze Generator pada Game Labirin. Ultima Computing : Jurnal Sistem Komputer, 10 (2). ISSN 2355-3286
Full text not available from this repository.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.
| Item Type: | Article |
|---|---|
| Keywords: | Fisher-Yates Shuffle, Flood Fill, Maze Generator, Hamming Distance |
| Subjects: | 000 Computer Science, Information and General Works > 000 Computer Science, Knowledge and Systems > 004 Computer Science, Data Processing, Hardware |
| Divisions: | Faculty of Engineering & Informatics > Informatics |
| Depositing User: | Administrator UMN Library |
| Date Deposited: | 08 Oct 2021 07:58 |
| Last Modified: | 08 Oct 2021 07:58 |
| URI: | https://kc.umn.ac.id/id/eprint/18596 |
Actions (login required)
 |
View Item |
