Alexander Dagaev
ABSTRACT
The algorithms for generating and finding the shortest path in two-dimensional labyrinths and their characteristics are considered. The aim of the study is to determine the dependence of the working time of the shortest path search algorithms on the characteristics of mazes. This may allow these algorithms to be used to optimise routing processes in packet switching networks. All of the characteristics of the algorithms under consideration are described in detail. These search algorithms also allow for paralleling, so they can be used when creating games or any special applications. Such generation algorithms have been selected, the resulting mazes of which have different characteristics, thus making it possible to determine the required dependence. The peculiarity of applying the result of this research is that the fastest search algorithm can be selected for the generation algorithm or for specific characteristics of an already generated maze. The search algorithms can be improved to find paths in mazes in N-dimensional spaces. This search extension possibility can be widely used not only for working with mazes, but also with any other structure of a given coordinate system.
- Buck J. 2015. Mazes for Programmers: Code Your Own Twisty Little Passages. Pragmatic Bookshelf, Dallas, Texas - Raleigh, North CarolinaGoogle Scholar
- Pullen W. 2018. Think Labyrinth! (November 2018). Retrieved November 10, 2020 from http://www.astrolog.org/labyrnth.htmlGoogle Scholar
- David J. Aldous. 1990. A random walk construction of uniform spanning trees and uniform Iabelled trees. SIAM Journal of Discrete Mathematics, 3(4):450- 465, 1990. DOI: https://doi.org/10.1137/0403039Google ScholarDigital Library
- A. Broder. 1989. Generating random spanning trees. In Proceedings of the 30th Annual Symposium on Foundations of Computer Science, October 1989, 442- 447. https://doi.org/10.1109/SFCS.1989.63516Google ScholarDigital Library
- Buck J. 2011. Maze Generation: Aldous-Broder algorithm. (January 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/1/17/maze-generation-aldous-broder-algorithm.html.Google Scholar
- Buck J. 2010. Maze Generation: Recursive Backtracking. (December 2010). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2010/12/27/maze-generation-recursive-backtracking.Google Scholar
- Justin Haupt. 2019. Generating Random Mazes With Recursive Backtracking. (March 2019). Retrieved November 10, 2020 from https://medium.com/@jhaupt100/generating-random-mazes-with-recursive-backtracking-e9c8df1dcda5Google Scholar
- Sergio Silva, Diogo Duarte, Rolando Barradas, Salviano Soares, Antonio Valente and Manuel Reis. 2017. Arduino recursive backtracking implementation. In Proceedings of the 20th International Conference on Climbing and Walking Robots and the Support Technologies for Mobile Machines, October 2017, 169-178. https://doi.org/10.1142/9789813231047_0023.Google Scholar
- Buck J. 2011. Maze Generation: Growing Tree algorithm. (January 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/1/27/maze-generation-growing-tree-algorithm.Google Scholar
- Hendrawan Y. F. 2018. A Maze Game on Android Using Growing Tree Method. Journal of Physics Conference Series 953(1), 2018. DOI: 10.1088/1742-6596/953/1/012148Google Scholar
- Buck J. 2011. Maze Generation: Sidewinder algorithm. (February 2011). Retrieved November 10, 2020 from https://weblog.jamisbuck.org/2011/2/3/maze-generation-sidewinder-algorithm.htmlGoogle Scholar
- Amit Patel. 2020. Implementation of A*. (October 2020). Retrieved November 10, 2020 from https://www.redblobgames.com/pathfinding/a-star/implementation.htmlGoogle Scholar
- Steve Mussmann and Abi See. Graph Search Algorithms. Retrieved November 10, 2020 from http://cs.stanford.edu/people/abisee/gs.pdfGoogle Scholar
Index Terms
- Generation and Search for the Shortest Path in Two-dimensional Labyrinths as A Model for Optimizing Routing Processes in the Packet Switching Network
Recommendations
Application of Maintaining the Shortest Path Method in the Game Map Path-Finding
CASON '10: Proceedings of the 2010 International Conference on Computational Aspects of Social NetworksPath-Finding algorithms mainly solve the problem of how to find a path from the starting point to the target point. If there is no connected path, the game will enter the deadlock state. This paper focuses on analyzing the rule of picture matching, ...
Improved balancing heuristics for optimizing shortest path routing
Open Shortest Path First (OSPF) is the most commonly used intra-domain routing protocol. OSPF routes traffic flows along shortest paths and the traffic will be split evenly when several shortest paths are found to the destination. An integer value is ...
Design and Implement of the Complex Maze Shortest Path Simulation System Based on Improved Ant Colony Optimization Algorithm
IMCCC '14: Proceedings of the 2014 Fourth International Conference on Instrumentation and Measurement, Computer, Communication and ControlIn artificial intelligence field, dynamic optimization problem under uncertain environment has always been a main topic and been widely researched these years. How to find the optimal solution around the goals to be solved is the key problem. As a ...
Comments