ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/square_spiral.C
(Generate patch)

Comparing deliantra/server/random_maps/square_spiral.C (file contents):
Revision 1.2 by root, Sun Sep 10 16:06:37 2006 UTC vs.
Revision 1.9 by root, Sat Jan 27 02:19:37 2007 UTC

1
2/* 1/*
3 * static char *rcsid_map_c = 2 * CrossFire, A Multiplayer game for X-windows
4 * "$Id: square_spiral.C,v 1.2 2006/09/10 16:06:37 root Exp $"; 3 *
4 * Copyright (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen
7 *
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 2 of the License, or
11 * (at your option) any later version.
12 *
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, write to the Free Software
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de>
5 */ 23 */
6
7/*
8 CrossFire, A Multiplayer game for X-windows
9
10 Copyright (C) 2001 Mark Wedel & Crossfire Development Team
11 Copyright (C) 1992 Frank Tore Johansen
12
13 This program is free software; you can redistribute it and/or modify
14 it under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 2 of the License, or
16 (at your option) any later version.
17
18 This program is distributed in the hope that it will be useful,
19 but WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
21 GNU General Public License for more details.
22
23 You should have received a copy of the GNU General Public License
24 along with this program; if not, write to the Free Software
25 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
26
27 The authors can be reached via e-mail at crossfire-devel@real-time.com
28*/
29 24
30 25
31/* peterm@langmuir.eecs.berkeley.edu: this function generates a random 26/* peterm@langmuir.eecs.berkeley.edu: this function generates a random
32snake-type layout. 27snake-type layout.
33 28
… …
64 it also starts from cx and cy. */ 59 it also starts from cx and cy. */
65 60
66void 61void
67find_top_left_corner (char **maze, int *cx, int *cy) 62find_top_left_corner (char **maze, int *cx, int *cy)
68{ 63{
64 --(*cy);
69 65
70 (*cy)--;
71 /* find the top wall. */ 66 /* find the top wall. */
72 while (maze[*cx][*cy] == 0) 67 while (maze[*cx][*cy] == 0)
73 (*cy)--; 68 --(*cy);
69
74 /* proceed right until a corner is detected */ 70 /* proceed right until a corner is detected */
75 while (maze[*cx][*cy + 1] == 0) 71 while (maze[*cx][*cy + 1] == 0)
76 (*cx)++; 72 ++(*cx);
77 73
78 /* cx and cy should now be the top-right corner of the onion layer */ 74 /* cx and cy should now be the top-right corner of the onion layer */
79} 75}
80 76
81 77
… …
85 int i, j; 81 int i, j;
86 int cx, cy; 82 int cx, cy;
87 int tx, ty; 83 int tx, ty;
88 84
89 /* generate and allocate a doorless, centered onion */ 85 /* generate and allocate a doorless, centered onion */
90 char **maze = map_gen_onion (xsize, ysize, OPT_CENTERED | OPT_NO_DOORS, 0); 86 char **maze = map_gen_onion (xsize, ysize, RMOPT_CENTERED | RMOPT_NO_DOORS, 0);
91 87
92 /* find the layout center. */ 88 /* find the layout center. */
93 cx = 0; 89 cx = 0;
94 cy = 0; 90 cy = 0;
95 for (i = 0; i < xsize; i++) 91 for (i = 0; i < xsize; i++)
96 for (j = 0; j < ysize; j++) 92 for (j = 0; j < ysize; j++)
97 {
98 if (maze[i][j] == 'C') 93 if (maze[i][j] == 'C')
99 { 94 {
100 cx = i; 95 cx = i;
101 cy = j; 96 cy = j;
102 } 97 }
103 } 98
104 tx = cx; 99 tx = cx;
105 ty = cy; 100 ty = cy;
106 while (1) 101 for (;;)
107 { 102 {
108 find_top_left_corner (maze, &tx, &ty); 103 find_top_left_corner (maze, &tx, &ty);
109 104
110 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2) 105 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2)
111 break; 106 break;
107
112 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */ 108 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */
113 109
114 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */ 110 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */
115 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */ 111 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */
116 112
… …
134 tx++; /* set up for next layer. */ 130 tx++; /* set up for next layer. */
135 } 131 }
136 132
137 /* place the exits. */ 133 /* place the exits. */
138 134
139 if (RANDOM () % 2) 135 if (rndm (2))
140 { 136 {
141 maze[cx][cy] = '>'; 137 maze[cx][cy] = '>';
142 maze[xsize - 2][1] = '<'; 138 maze[xsize - 2][1] = '<';
143 } 139 }
144 else 140 else
… …
147 maze[xsize - 2][1] = '>'; 143 maze[xsize - 2][1] = '>';
148 } 144 }
149 145
150 return maze; 146 return maze;
151} 147}
148

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines