Non-perfect maze generation using Kruskal algorithm
| Autor: | MAHYUS IHSAN, DEDI SUHAIMI, MARWAN RAMLI, SYARIFAH MEURAH YUNI, IKHSAN MAULIDI |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2021 |
| Předmět: | |
| Zdroj: | Jurnal Natural, Vol 21, Iss 1 (2021) |
| Druh dokumentu: | article |
| ISSN: | 1411-8513 2541-4062 |
| DOI: | 10.24815/jn.v21i1.18840 |
| Popis: | A non-perfect maze is a maze that contains loop or cycle and has no isolated cell. A non-perfect maze is an alternative to obtain a maze that cannot be satisfied by perfect maze. This paper discusses non-perfect maze generation with two kind of biases, that is, horizontal and vertical wall bias and cycle bias. In this research, a maze is modeled as a graph in order to generate non-perfect maze using Kruskal algorithm modifications. The modified Kruskal algorithm used Fisher Yates algorithm to obtain a random edge sequence and disjoint set data structure to reduce process time of the algorithm. The modification mentioned above are adding edges randomly while taking account of the edge’s orientation, and by adding additional edges after spanning tree is formed. The algorithm designed in this research constructs an non-perfect maze with complexity of where and denote vertex and edge set of an grid graph, respectively. Several biased non-perfect mazes were shown in this research by varying its dimension, wall bias and cycle bias. |
| Databáze: | Directory of Open Access Journals |
| Externí odkaz: |
|