An Algorithm of Maze Problem Based on Search

Article Preview

Abstract:

In this paper, a abstarct model is build for maze. Integrated maze was divided into many fragments, graphic traversal algorithm was used to classify those fragments into different category. By searching in the category, the wrong way of the maze can be eliminate, and the real way can be find easily.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

792-795

Citation:

Online since:

December 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2013 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] Wen Ruchun, Xu Ying, Wang Zulin. Research and application of the improved ant colony algorithm in the maze path planning[J]. Jiangxi University of Technology, 2010, 31 (2) :26-28

Google Scholar

[2] Liu Xiang, Gong Daoxiong. The simulation of depth-first search algorithm and A * search algorithm in the maze search[J]. Manufacturing Automation, 2011,33 (6) :101-104

Google Scholar

[3] Chen Yonggang, Li Min, Fan Qinghui. Solve the maze with particle swarm optimization [J]. Henan University of Technology, 2010,31 (2) :51-53

Google Scholar

[4] Zhao Xuefeng, Zhang Guicang. Research on the maze problems based on cellular automata[J]. Northwest Normal University, 2006,42 (3) :29-31

Google Scholar

[5] De Jong K. Learning with Genetic Algorithms,An Overview. Machine Learning,1988,3(2,3):121-138.

Google Scholar

[6] Bruce Eckel. Thinking in Java [M]. Beijing: Mechanical Industry Press, 2007.

Google Scholar

[7] Mark Allen Weiss. Data structures and algorithm analysis: C language description [M]. Beijing: Mechanical Industry Press, 2004.

Google Scholar