2017-11-25 62 views
3

时获取分割故障我尝试随机生成迷宫,但在程序编译如下C:生成随机迷宫

这里的时候,我得到一个分段错误的

void spread(int v, int x, int y, int *t,int w, int *count){ 
    //table of directions(Right,Down,Left,Up) 
    int d[4][2] = {{1,0},{0,1},{-1,0},{0,-1}}; 
    int i; 
    t[y * w + x] = v; 

    if(v == 0 && (x & 1) && (y & 1)) 
     (*count)++; /*increments at every box which has value as zero with x odd and y also*/ 

    //spread the value to all directions 
    for(i = 0; i < 4; i++){ 
     if(v < t[(y+d[i][1]) * w + x +d[i][0]]){ 
      spread(v,x + d[i][0],y+d[i][0],t,w,count); 
     } 
    } 
} 

int *init(int m, int n){ 
     //Initializing the maze 
     int *t = NULL, mp = 2 * m +1, np = 2 * n + 1; 
     int x,y,k,d; 
     int count = 1; 
     t = malloc(mp * np * sizeof *t); 
     assert(t); 
     for(y = k = 0; y < np ;++y){ 
      for(x = 0; x < mp; ++x){ 
       if((x & 1) && (y & 1)) 
        t[y * mp + x] = k++; 
       else 
        t[y * mp + x] = -1; 
      } 

     } 
     //Make a labyrinth randomly 
     while(count < (m * n)){ 
      srand(time(NULL)); 
      if(myRand(2)){ // Up/Down separator 
       do{ 
        x = myRand(m) * 2 + 1; 
        y = (myRand(n - 1) + 1) * 2; 

       }while(t[(y - 1) * mp + x] == t[(y + 1) * mp + x]); /*Don't select the ones which are equal*/ 

       d = t[(y - 1) * mp + x] - t[(y + 1) * mp + x]; 
       //d selects the lowest one 
       if(d > 0){ 
        t[y * mp +x] = t[(y + 1) * mp + x]; 
        spread(t[(y + 1) * mp +x],x,y-1,t,mp,&count); 
       } 

       else if(d < 0){ 
        t[y * mp +x] = t[(y - 1) * mp + x]; 
        spread(t[(y - 1) * mp +x],x,y+1,t,mp,&count); 
       } 
      } 
      else{ //Right/Left separator 
       do{   
        x = (myRand(m - 1) + 1) * 2; 
        y = myRand(n) * 2 + 1; 

       }while(t[y * mp + x - 1] == t[y * mp + x + 1]); 

       d = t[y * mp + x - 1] - t[y * mp + x + 1]; 

       if(d > 0){ 
        t[y * mp +x] = t[y * mp + x + 1]; 
        spread(t[y * mp + x + 1],x-1,y,t,mp,&count); 
       } 

       else if(d < 0){ 
        t[y * mp +x] = t[y * mp +x - 1]; 
        spread(t[y * mp + x - 1],x+1,y,t,mp,&count); 
       } 
      } 
     } 
     return t; 
} 

迷宫式的初始化代码(在这里是t)首先是值:对于墙壁为-1,对于节点v> 0 0对于节点

然后,为了在节点之间建立连接(这是为了具有迷宫),随机选择框该行或列必须是奇数才能选择代表的墙(上/下或左/右)

所以“d”取围墙周围的框之间的最小值(意思是墙上方框的值与框下方框的值之间的最小值墙上,左/右),同样的事情

功能传播:它传播的价值,各个方向(右,下,左,上)

下面是它的一个例子:

+ + + + + + + + + 
+ 0 + 1 + 2 + 3 + 
+ + + + + + + + + 
+ 4 + 5 + 6 + 7 + 
+ + + + + + + + + 
+ 8 + 9 + 10 + 11 + 
+ + + + + + + + + 

当传播一些价值给他人

+ + + + + + + + + 
+ 0 + 1 1 1 + 3 + 
+ + + + + + + + + 
+ 4 + 5 + 6 + 7 + 
+ + + + + + + + + 
+ 8 + 9 9 9 + 11 + 
+ + + + + + + + + 

我试图通过调试程序来解决这个问题,它为我的意思是显示什么上面了一下,但后来我得到这个

Program received signal SIGSEGV, Segmentation fault. 
0x00000000004008e4 in spread (
    v=<error reading variable: Cannot access memory at address 0x7fffff7fefec>, x=<error reading variable: Cannot access memory at address 0x7fffff7fefe8>, 
    y=<error reading variable: Cannot access memory at address 0x7fffff7fefe4>, t=<error reading variable: Cannot access memory at address 0x7fffff7fefd8>, 
    w=<error reading variable: Cannot access memory at address 0x7fffff7fefe0>, count=<error reading variable: Cannot access memory at address 0x7fffff7fefd0>) 
    at Lab.c:34 
#1 0x0000000000400a1a in spread (v=8, x=4, y=6, t=0x603010, w=9, 
    count=0x7fffffffddd4) at Lab.c:48 
#2 0x0000000000400a1a in spread (v=8, x=4, y=6, t=0x603010, w=9, 
    count=0x7fffffffddd4) at Lab.c:48 
#3 0x0000000000400a1a in spread (v=8, x=4, y=6, t=0x603010, w=9, 
    count=0x7fffffffddd4) at Lab.c:48 
#4 0x0000000000400a1a in spread (v=8, x=4, y=6, t=0x603010, w=9, 
    count=0x7fffffffddd4) at Lab.c:48 
+0

可疑无限递归 – vicatcu

+0

什么保证'Y * w + x'是否在't'的范围内? – vicatcu

+0

x不能超过mp(y不能超过np)所以我认为y * w + x不能超过mp * np – Yasmine

回答

0
void spread(int v, int x, int y, int *t,int w, int *count){ 
    //table of directions(Right,Down,Left,Up) 
    int d[4][2] = {{1,0},{0,1},{-1,0},{0,-1}}; 
    int i; 
    t[y * w + x] = v; 

    if(v == 0 && (x & 1) && (y & 1)) 
     (*count)++; /*increments at every box which has value as zero with x odd and y also*/ 

    //spread the value to all directions 
    for(i = 0; i < 4; i++){ 
     if(v < t[(y+d[i][1]) * w + x +d[i][0]]){ 
      spread(v,x + d[i][0],y+d[i][1],t,w,count); 
     } 
    } 
} 

int *init(int m, int n){ 
     //Initializing the maze 
     int *t = NULL, mp = 2 * m +1, np = 2 * n + 1; 
     int x,y,k,d; 
     int count = 1; 
     t = malloc(mp * np * sizeof *t); 
     assert(t); 
     for(y = k = 0; y < np ;++y){ 
      for(x = 0; x < mp; ++x){ 
       if((x & 1) && (y & 1)) 
        t[y * mp + x] = k++; 
       else 
        t[y * mp + x] = -1; 
      } 

     } 
     //Make a labyrinth randomly 
     srand(time(NULL)); 
     while(count < (m * n)){ 

      if(myRand(2)){ // Up/Down separator 
       do{ 
        x = myRand(m) * 2 + 1; 
        y = (myRand(n - 1) + 1) * 2; 

       }while(t[(y - 1) * mp + x] == t[(y + 1) * mp + x]); /*Don't select the ones which are equal*/ 

       d = t[(y - 1) * mp + x] - t[(y + 1) * mp + x]; 
       //d selects the lowest one 
       if(d > 0){ 
        t[y * mp +x] = t[(y + 1) * mp + x]; 
        spread(t[(y + 1) * mp +x],x,y-1,t,mp,&count); 
       } 

       else if(d < 0){ 
        t[y * mp +x] = t[(y - 1) * mp + x]; 
        spread(t[(y - 1) * mp +x],x,y+1,t,mp,&count); 
       } 
      } 
      else{ //Right/Left separator 
       do{   
        x = (myRand(m - 1) + 1) * 2; 
        y = myRand(n) * 2 + 1; 

       }while(t[y * mp + x - 1] == t[y * mp + x + 1]); 

       d = t[y * mp + x - 1] - t[y * mp + x + 1]; 

       if(d > 0){ 
        t[y * mp +x] = t[y * mp + x + 1]; 
        spread(t[y * mp + x + 1],x-1,y,t,mp,&count); 
       } 

       else if(d < 0){ 
        t[y * mp +x] = t[y * mp +x - 1]; 
        spread(t[y * mp + x - 1],x+1,y,t,mp,&count); 
       } 
      } 
     } 
     return t; 
}