沿墙走是一种简单的解迷宫算法，您可能在小时候就学过了。
Wall-following is a simple maze algorithm you might have learned as a child.
在现有的几种解迷宫算法中，有两种常用算法使用固定数量的内存，而与迷宫的大小无关。
Of the several existing maze-solving algorithms, two commonly used ones consume a constant amount of memory regardless of the maze's size.
换句话说，有一个著名的走迷宫算法就是右手法则- 顺着右手边的墙走，直到出去（包括绕过绝路）。
A well-known algorithm, so to speak, for walking a maze, is the right hand rule -- follow the right hand wall until you are out (including around dead-ends).
在传统迷宫算法的基础上，结合电路布线的特点，提出了目标驱动的迷宫布线算法及优化的方法。
Based on the traditional maze algorithm and the features of routing of circuit, a target driven routing algorithm was presented.
提出了一种层次式布线资源FPGA连线开关的设计方法，采用迷宫算法，对连线开关的结构进行了分析。
A method to design connection switch for FPGA of the hierarchical interconnection resource is presented. Maze routing algorithm has been used to analyze the architecture of connection switch.
很容易看出，如果迷宫的边界上有一个入口和一个出口，那么这种算法总是有效的。
It's easy to see that this algorithm always works if the maze you're in has an entrance and an exit on its border.
在用这种算法解迷宫时，只需要把左手一直放在左边的墙上(或者把右手一直放在右边的墙上)，然后沿着墙走，直到走出迷宫。
All you do to solve a maze using this algorithm is keep your left hand on the left wall (or your right hand on the right wall) and just follow it along until you exit the maze.
提修斯的策略表现了一种逃离迷宫的算法，但并不是他可以用来解决问题的唯一算法。
Theseus's strategy represents an algorithm for escaping from a maze, but it is not the only algorithm he could have used to solve this problem.
Pledge算法比沿墙走算法复杂，能够解决更多的迷宫类型，因为它可以在孤岛之间跳跃。
The Pledge algorithm is more sophisticated than wall-following and solves a larger class of mazes because it can jump between islands.
通过分析具体问题，抓住栈结构与栈元素材料的桥梁作用，从而写出迷宫问题的算法。
This paper, by analysing some specific problems, grasps the bridge of both stack structure and stack element, and obtains the related algorithm of the maze problems.
用标记每个搜索位置离起始位置最近距离的方法，通过递归函数求解，提出了一个对复杂迷宫的简明求解算法。
An algorithm is presented for complex maze by marking shortest path between the start point and current exploring point with recursive backtracking.
本算法的优点是搜索的时间和空间，与迷宫空间的大小无关，仅与障碍的相对位置有关。
The advantage of this algorithm is that the searching time and space are not connected with the size of the maze space, but with the relative position between the obstacles only.
针对迷宫这类特殊的环境模型，提出了基于笛卡儿坐标系的新的路径规划算法。
Aiming at the especial circumstance model of maze, maze path_planning algorithm based on cartesian co-ordinates is raised.
通过递归算法实现！找到最优路径，完成迷宫出口的查找！ - maze algorithm ！
To find the optimal path to complete the maze exports to search!
通过递归算法实现！找到最优路径，完成迷宫出口的查找！ - maze algorithm ！
To find the optimal path to complete the maze exports to search!
应用推荐