|
作者: snoopy
/* =============== Program Description =============== */
/* 程式名稱： maze.c */
/* 程式目的： 運用遞迴來解迷宮問題 */
/* Written By Kuo-Yu Huang. (WANT Studio.) */
/* =================================================== */
int Maze[8][7] = { /* 宣告5*4的迷宮，外圍不可走 */
1, 1, 1, 1, 1, 1, 1,
1, 0, 1, 0, 0, 0, 1,
1, 1, 0, 1, 1, 0, 1,
1, 1, 0, 1, 1, 0, 1,
1, 1, 1, 0, 1, 1, 1,
1, 0, 0, 1, 0, 1, 1,
1, 1, 1, 1, 0, 0, 1,
1, 1, 1, 1, 1, 1, 1};
/* --------------------------------------------------- */
/* 遞迴解迷宮問題 */
/* --------------------------------------------------- */
int Way(int LocX,int LocY)
{
if ( Maze[6][5] == 2 ) /* 遞迴結束條件 */
return 1;
else /* 遞迴執行部分 */
if ( Maze[LocY][LocX] == 0 )
{
Maze[LocY][LocX] = 2;
if ( Way(LocX,LocY-1) )
return 1;
else if ( Way(LocX+1,LocY-1) )
return 1;
else if ( Way(LocX+1,LocY) )
return 1;
else if ( Way(LocX+1,LocY+1) )
return 1;
else if ( Way(LocX,LocY+1) )
return 1;
else if ( Way(LocX-1,LocY+1) )
return 1;
else if ( Way(LocX-1,LocY) )
return 1;
else if ( Way(LocX-1,LocY-1) )
return 1;
else
{
Maze[LocY][LocX] = 3;
return 0;
}
}
else
return 0;
}
/* --------------------------------------------------- */
/* 主程式 */
/* --------------------------------------------------- */
void main ()
{
int i,j; /* 迴圈計數變數 */
printf("==Problem of Maze ==\n");
printf("The Maze source is (1,1).\n");
printf("The Maze Destination is (6,5).\n");
Way(1,1);
printf("The graph of Maze.\n");
printf(" 0 1 2 3 4 5 6 \n");
printf(" +---+---+---+---+---+---+---+\n");
for (i=0;i<8;i++)
{
printf(" %d |",i);
for (j=0;j<7;j++)
printf("-%d-|",Maze[i][j]);
printf("\n +---+---+---+---+---+---+---+\n");
}
}
|