Formation of Non-Perfect Maze Using Prim’s Algorithm

Maze is a place that has many paths with tortuous are misleading and full of dead ends can be viewed as grid graph. A non-perfect maze cycle. This research produces an algorithm form size m×n which two types bias. The first bias the composition percentage horizontal vertical partitions. second number cycles. created in this study was generated by modifying Prim’s use Fisher-Yates used random selection algorithm. begins calculation parameter values continues forming perfect maze. been designed complexity O(|E|^2), where E set edges Flash-based application development also carried out order to implement algorithms obtain produced two-dimensional visual image along its corresponding capable displaying up 20 solutions biased