p-Index From 2020 - 2025
0.562
P-Index
This Author published in this journals
All Journal Jurnal Natural
Claim Missing Document
Check
Articles

Found 2 Documents
Search

Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (404.942 KB) | DOI: 10.24815/jn.v21i1.18840

Abstract

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.
Non-perfect maze generation using Kruskal algorithm MAHYUS IHSAN; DEDI SUHAIMI; MARWAN RAMLI; SYARIFAH MEURAH YUNI; IKHSAN MAULIDI
Jurnal Natural Volume 21 Number 1, February 2021
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | DOI: 10.24815/jn.v21i1.18840

Abstract

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.