Eastsun请进,有事情麻烦你!

Eastsun

let me 找找,N久前滴了...
生成算法在偶的QQ空间上找到了:

2. Empty the path list of rooms.
3.    Set up the west walls for each room.
4.    Set up the south walls for each room.
5.    Set up the visitation status of each room.
6.    Set up a count of rooms that remain to be visited.
7.    Pick a starting location in the maze, at random.
8.    DO WHILE (more rooms to visit),
9.     Decrement the count of rooms to visit.
10.     Mark the current room as visited.
11.     Count the number of valid exits from this room.
12.     DO WHILE (no exits from this room),
13.       Pick an entry from the path list, at random.
14.       Remove that entry from the path list.
15.       Count the number of valid exits from this new room.
16.     LOOP
17.     IF (count of exits > 1) THEN
18.       Add this room to the path list.
19.     END IF
20.     Select one of the available exits, at random.
21.     Break the intervening wall in that selected direction.
22.     Move into the new room in that direction.
23.    LOOP  

复制代码

Eastsun

找到源程序了,不过不太确定是不是最终版,因该不会有问题:

2. /**
3. @迷宫生成程序
4. @Author :Eastsun
5. @Version:1.0
6. @Date  :6.7
7. */
8. #height 240
9. #width  320
10. #bigram
11. #define  VISIT  0x01        //该位为1表示还未访问
12. #define  VISIT1 0x20        //求解时用的
13. #define  NORTH  0x02        //该位为0表示无墙
14. #define  SOUTH  0x04
15. #define  WEST  0x08
16. #define  EAST  0x10
17. #define  MASK  0x15
18. #define  MWIDTH  160
19. #define  MHEIGHT 120
20. char  mazeMap[MHEIGHT+2][MWIDTH+2];
21. int  width,height;
22. void drawMaze(int x,int y,int dest,int type){
23.   int w,h;
24.   y++;
25.   for(h =1;h<=height;h++)
26.     for(w =1;w<=width;w++){
27.       if(mazeMap[h][w]&EAST) Line(x+w*dest,y+(h-1)*dest,x+w*dest,y+h*dest,type);
28.       if(mazeMap[h][w]&SOUTH)Line(x+(w-1)*dest,y+h*dest,x+w*dest,y+h*dest,type);
29.     }
30.    Line(x,y,x+width*dest,y,type);
31.    Line(x,y+height*dest,x+width*dest,y+height*dest,type);
32.    Line(x,y,x,y+height*dest,type);
33.    Line(x+width*dest,y,x+width*dest,y+height*dest,type);
34.    y--;
35.    Line(x+2*dest,y,x+5*dest,y,type);
36.    Line(x+3*dest+1,y,x+4*dest-1,y,type^1);
37.    y++;
38.    Line(x+3*dest+1,y,x+4*dest-1,y,type^1);
39.    Line(x+width*dest,y+(height-1)*dest+1,x+width*dest,y+height*dest-1,type^1);
40. }
41. void  init(int h,int w,long seed){
42.   int  n,unVisited,listSize,neighbor,px,py,r,process;
43.   char  pathList[MHEIGHT*MWIDTH][2];
44.   height =h;
45.   width  =w;
46.   memset(mazeMap,MASK,(MWIDTH+2)*(MHEIGHT+2));
47.   for(n=0;n<=width+1;n++){ mazeMap[0][n] =0; mazeMap[height+1][n] =0;}
48.   for(n=0;n<=height+1;n++){mazeMap[n][0] =0; mazeMap[n][width+1] =0; }
49.   
50.   if(seed)  srand(seed);
51.   else    srand((Getms()<<8)+rand());
52.   unVisited =height*width;
53.   listSize  =0;
54.   px =rand()%width+1; py =rand()%height+1;  //pick a starting location in maze,at random
55.   Box(30,27,112,44,1,0);
56.   Box(30,27,112,44,0,1);
57.   TextOut(35,30,"迷宫生成中..",0x41);
58.   process =0;
59.   while(unVisited-1){
60.     mazeMap[py][px] =mazeMap[py][px]^VISIT;
61.     unVisited --;
62.     if(unVisited%width==1){
63.       process ++;
64.       Box(30,27,112,44,1,0);
65.        Box(30,27,112,44,0,1);
66.        TextOut(35,30,"迷宫生成中..",0x41);
67.        Box(35,30,35+72*process/height,41,1,2);
68.      }
69.     while(!(neighbor=(mazeMap[py][px-1]&VISIT)+(mazeMap[py][px+1]&VISIT)+
70.            (mazeMap[py-1][px]&VISIT)+(mazeMap[py+1][px]&VISIT))){
71.       py =pathList[--listSize][0];
72.       px =pathList[listSize][1];
73.     }
74.     if(neighbor>1){
75.      pathList[listSize][0] =py;
76.      pathList[listSize][1] =px;
77.      listSize ++;
78.     }
79.     r =rand()%neighbor;
80.     n =0;
81.     if(mazeMap[py-1][px]&VISIT){
82.      if(n ==r){
83.        mazeMap[py-1][px] =mazeMap[py-1][px]^SOUTH;
84.        py--;
85.        continue;
86.      }
87.      else n++;
88.     }
89.     if(mazeMap[py+1][px]&VISIT){
90.      if(n ==r){
91.        mazeMap[py][px]  =mazeMap[py][px]^SOUTH;
92.        py++;
93.        continue;
94.      }
95.      else n++;
96.     }
97.     if((mazeMap[py][px-1]&VISIT)&&n ==r){
98.        mazeMap[py][px-1] =mazeMap[py][px-1]^EAST;
99.        px--;
100.     }
101.     else{
102.         mazeMap[py][px]  =mazeMap[py][px]^EAST;
103.         px++;
104.     }
105.   }//while  
106. }
107. void main(){
108.   char key,d;
109.   while(1){
110.     ClearScreen();
111.     TextOut(1,0,  "*******迷宫生成程序*******",1);
112.     TextOut(1,24, "    1  小型迷宫(39×19)  ",1);
113.     TextOut(1,40, "    2  大型迷宫(79×39)  ",1);
114.     TextOut(1,67, "********By Eastsun********",1);
115.     Refresh();
116.     key =getchar();
117.     if(key ==&#39;b&#39;){    init(59,79,0); d =4;}
118.     else if(key ==&#39;n&#39;){ init(119,159,0); d =2;}
119.     else if(key ==0x1b) break;
120.     else           continue;
121.     ClearScreen();
122.     Refresh();
123.      drawMaze(1,0,d,0x01);
124.      getchar();
125.   }
126. }
128.       
129.   

复制代码

JAY

我不是N久以前发过算法么...被无视了...

starwing

呵呵，Jay的算法太高深了，当时看不懂啊～现在好些了，不过既然有源代码，那么算法就……

purpler

引用第2楼Eastsun于2006-12-22 14:34发表的“”:
找到源程序了,不过不太确定是不是最终版,因该不会有问题:
[code]
/**
@迷宫生成程序
@Author :Eastsun
.......

非常感谢你!!!!~~~~~~~~~~~~~~~~~~~

purpler

引用第3楼yzk0370于2006-12-22 14:41发表的“”:
我不是N久以前发过算法么...被无视了...

实在抱歉,我搜索的时候没看到你以前发的,可否也贴出来!?

谢谢

purpler

引用第2楼Eastsun于2006-12-22 14:34发表的“”:
找到源程序了,不过不太确定是不是最终版,因该不会有问题:
[code]
/**
@迷宫生成程序
@Author :Eastsun
.......

程序可以运行!非常感谢

我想问一个问题:
就是保存在数组MAZE[][]中的数据都有什么数字(比如0,1,2...)
每个数字都代表什么?(几代表墙几代表可以行走几代表墙?墙还分方向吗?)

purpler

  在EM上找到一个你以前发的LAVA程序-<迷宫生成程序>
可以生成39*19/79*39那个,可不可以把源代码发给我
我想研究一下,可以吗?谢谢
我的E-mail:008club@163.com