Author:
Turan Metin,Pekyürek Emircan
Abstract
A maze is a structure of passageways interconnected in a complex way, so that it presents at least one path to reach the designated end starting from a predefined location. A new approach is proposed in this algorithm. First of all a solution path is carved on the opposite edges of the board in order to meet maze definition. Later, walls are built up on the even lines (or odd lines) and some parts of these lines randomly break off. Finally passages are constructed randomly between broken even lines. This technique opens new era to produce different versions of it for maze construction. The algorithm is applied to a 100 × 100 board and evaluation compared with the well-known maze algorithms. Its prominent features are being more speedy (3.5 second) to construct and more complicated (10.32% dead ends) to solve.
Subject
Computational Mathematics,Computer Science Applications,General Engineering
Reference25 articles.
1. Pedersen H, Singh K. Organic labyrinths and mazes. In Proceedings of the 4th International Symposium on Non-Photorealistic Animation and Rendering, 2006 June 05-07, Annecy, France: Association for Computing Machinery: 2006. pp. 79-86.
2. Pech A, Masek M, Lam CP, Hingston P. Game level layout generation using evolved cellular automata. Connection Science. 2016 Feb 12; 28(1): 63-82.
3. Search-based procedural generation of maze-like levels;Ashlock;IEEE Transactions on Computational Intelligence and AI in Games,2011
4. Lee H-L, Lee C-F, Chen L-H. An improved method for hiding data in a maze. In Proceedings of Seventh International Conference on Machine Learning and Cybernetics; 2008 July 12–15, Kunming, China: IEEE, 2008. pp. 3161-3165.
5. Maze based data hiding using back tracker algorithm;Sukumar;International Journal of Engineering Research and Applications (IJERA),2012