Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Turan, Metin* | Pekyürek, Emircan
Affiliations: Department of Computer Engineering, İstanbul Commerce University, Istanbul, Turkey
Correspondence: [*] Corresponding author: Metin Turan, Department of Computer Engineering, İstanbul Commerce University, Istanbul, Turkey. Tel.: +90 5327623554; E-mail: [email protected].
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.
Keywords: Maze, labyrinth, game programming, algorithms
DOI: 10.3233/JCM-225918
Journal: Journal of Computational Methods in Sciences and Engineering, vol. 22, no. 3, pp. 801-810, 2022
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]