100求助一个路径算法（应该算比较简单吧，只是我数学太差）

[songjinxi123]

请问图中红色这种路径，算法怎么写？起点是最里面，终点是最外面。谢谢解答。

[wangnaisheng]

c#实现迷宫算法。

[骑着蜗牛去爬山]

http://379910987.blog.163.com/blog/static/33523797201365102453351/

[md5e]

http://bbs.csdn.net/topics/370037670 回塑之走迷宫 /// <summary> /// 走迷宫 /// </summary> protected void findPath() { //初使化地图 int[,] ary_map = new int[8, 12] { { 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1 }, { 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 1 }, { 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 1, 1 }, { 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1 }, { 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 1 }, { 0, 0, 0, 0, 1, 0, 1, 1, 1, 1, 0, 0 }, { 1, 0, 1, 1, 1, 0, 0, 0, 1, 1, 1, 1 }, { 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 0 } }; for (int i = 0; i < 8; i++) { for (int j = 0; j < 12; j++) { Response.Write(ary_map[i, j]); } Response.Write("<br/>"); } //开始询址 int s = 0;//记录第几步 int[] st = new int[8 * 12];//记录每步的方向y - 1(上),x + 1(左),y - 1(下),x - 1(右) int x = 0;//第几步的x int y = 0;//第几步的y while (s >= 0) { //判断方向 switch (st[s]) { case 0: y = y - 1;//向上走 break; case 1: x = x + 1;//向左走 break; case 2: y = y + 1;//向下走 break; case 3: x = x - 1;//向右走 break; } //如果碰壁就往回走 if (st[s] > 4 || x < 0 || y < 0 || x >= 12 || y >= 8 || ary_map[y, x] == 1 || ary_map[y, x] == -1) { Loop://判断方向，回退到上一步 switch (st[s]) { case 0: y = y + 1; break; case 1: x = x - 1; break; case 2: y = y - 1; break; case 3: x = x + 1; break; } //换一个方向 st[s] = st[s] + 1; //所有方向都走不通就返回上一步 if (st[s] > 3) { st[s] = 0; s = s - 1; if (s > 0) goto Loop; } } else { //将走过的路径设为-1 ary_map[y, x] = -1; //下一步 s = s + 1; if (x == 11 && y == 7) { break; } } } //询址结束 //输出路径 x = 0; y = 0; string txt=string.Empty; for (int i = 0; i < s; i++) { switch (st[i]) { case 0: y = y - 1; break; case 1: x = x + 1; break; case 2: y = y + 1; break; case 3: x = x - 1; break; } if (st[i] <= 0) { break; } else { txt = (txt == "" ? "" : txt + ",") + string.Format("(x:{0},y:{1})", x, y); } } Response.Write(string.Format("<p>路径为:(x:0,y:0),{0}</p>", txt)); }