在C迷宮中尋找最短路徑

Question

我想寫一段代碼來找到迷宮中最短的路徑。我寫了這個;

#include <stdio.h> 

void change (void); 
void print(void); 

int labirent[13][13] = { 
      {1,1,1,1,1,1,1,1,1,1,1,1,1}, 
      {1,2,0,1,0,0,0,0,0,0,0,0,1}, 
      {1,0,0,1,0,0,1,0,1,1,1,1,1}, 
      {1,0,0,1,0,0,1,0,0,0,0,0,1}, 
      {1,0,0,0,0,0,1,0,0,0,0,0,1}, 
      {1,0,0,0,0,1,1,1,1,0,0,0,1}, 
      {1,0,1,1,1,1,1,0,0,0,0,0,1}, 
      {1,0,0,0,0,1,0,0,0,1,1,1,1}, 
      {1,0,0,0,0,1,0,0,0,0,0,0,1}, 
      {1,1,1,1,0,1,0,0,1,1,0,0,1}, 
      {1,0,0,0,0,1,0,0,1,0,0,1,1}, 
      {1,0,0,0,0,0,0,0,1,0,0,3,1}, 
      {1,1,1,1,1,1,1,1,1,1,1,1,1} 
    };//defining labyrinth - walls are (1), starting point is (2), null points are (0), end point is (3) 

int i = 3; 
int a = 0; 

int x=1, y=1;//current positions 

int main(){ 

    change(); 

    print(); 

return 0; 
} 

void change(){ 


     if(labirent[x+1][y]==0){ 
      labirent[x+1][y]=i; 
      x = x + 1; 
      change(); 
     }else if(labirent[x][y+1]==0){ 
      labirent[x][y+1]=i; 
      y = y+1; 
      change(); 
     }else if(labirent[x-1][y]==0){ 
      labirent[x-1][y]=i; 
      x = x-1; 
      change(); 
     }else if(labirent[x][y-1]==0){ 
      labirent[x][y-1]=i; 
      y = y -1; 
      change(); 
     } 

} 
void print(){ 

    for(int i=0;i<13;i++){ 
      for(int j=0;j<13;j++){ 
       printf("%d ",labirent[i][j]); 
      } 
      printf("\n"); 
     } 

} 

它適用於此路徑，但我怎樣才能做出更一般的？我無法理解堆棧。如果你能告訴我方式，我可以使用它。

編輯：終點被添加。

謝謝。

Answer 1

考慮是有start和end點的解決方案是BFS運行（這是解決方案之一）

push s into queue with dist =0 
and mark s visited 
while(queue is not empty) 
{ 
    x = front(queue); 
    remove x from queue 
    foreach unvisited valid neighbor xn of x 
     mark xn as visited 
     push it in queue with dist d+1 where d is dist from source to x. 
} 

Answer 2

有一次，我不得不做同樣的事情，這次演習的目標是實現BackTracking算法：https://en.wikipedia.org/wiki/Backtracking