1 |
/* |
2 |
CrossFire, A Multiplayer game for X-windows |
3 |
|
4 |
Copyright (C) 1994 Mark Wedel |
5 |
Copyright (C) 1992 Frank Tore Johansen |
6 |
|
7 |
This program is free software; you can redistribute it and/or modify |
8 |
it under the terms of the GNU General Public License as published by |
9 |
the Free Software Foundation; either version 2 of the License, or |
10 |
(at your option) any later version. |
11 |
|
12 |
This program is distributed in the hope that it will be useful, |
13 |
but WITHOUT ANY WARRANTY; without even the implied warranty of |
14 |
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
15 |
GNU General Public License for more details. |
16 |
|
17 |
You should have received a copy of the GNU General Public License |
18 |
along with this program; if not, write to the Free Software |
19 |
Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. |
20 |
|
21 |
The author can be reached via e-mail to mark@pyramid.com |
22 |
*/ |
23 |
|
24 |
|
25 |
/* The onion room generator: |
26 |
Onion rooms are like this: |
27 |
|
28 |
char **map_gen_spiral(int xsize, int ysize, int option); |
29 |
|
30 |
|
31 |
*/ |
32 |
#include <global.h> |
33 |
#include <random_map.h> |
34 |
|
35 |
#define RANDOM_OPTIONS 0 /* Pick random options below */ |
36 |
#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */ |
37 |
#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */ |
38 |
#define FIT_SPIRAL 4 /* scale to a rectangular region, not square */ |
39 |
#define MAX_SPIRAL_OPT 8 /* this should be 2x the last real option */ |
40 |
#include <math.h> |
41 |
|
42 |
#ifndef MIN |
43 |
# define MIN(x,y) (((x)<(y))? (x):(y)) |
44 |
#endif |
45 |
#ifndef MAX |
46 |
# define MAX(x,y) (((x)<(y))? (y):(x)) |
47 |
#endif |
48 |
|
49 |
#define MINDIST 3 |
50 |
|
51 |
#define MAX_FINE .454545 |
52 |
|
53 |
extern int surround_check (char **maze, int i, int j, int xsize, int ysize); |
54 |
|
55 |
char ** |
56 |
map_gen_spiral (int xsize, int ysize, int option) |
57 |
{ |
58 |
int i, j; |
59 |
float parm = 0; |
60 |
float x = 0, y = 0; |
61 |
int ic, jc; |
62 |
float SizeX, SizeY; |
63 |
float xscale, yscale; |
64 |
|
65 |
/* allocate that array, set it up */ |
66 |
char **maze = (char **) calloc (sizeof (char *), xsize); |
67 |
|
68 |
for (i = 0; i < xsize; i++) |
69 |
{ |
70 |
maze[i] = (char *) calloc (sizeof (char), ysize); |
71 |
} |
72 |
|
73 |
/* slightly easier to fill and then cut */ |
74 |
for (i = 0; i < xsize; i++) |
75 |
for (j = 0; j < ysize; j++) |
76 |
maze[i][j] = '#'; |
77 |
|
78 |
ic = xsize / 2; |
79 |
jc = ysize / 2; |
80 |
SizeX = xsize / 2 - 2; |
81 |
SizeY = ysize / 2 - 2; |
82 |
|
83 |
/* select random options if necessary */ |
84 |
if (option == 0) |
85 |
{ |
86 |
option = RANDOM () % MAX_SPIRAL_OPT; |
87 |
} |
88 |
|
89 |
/* the order in which these are evaluated matters */ |
90 |
|
91 |
/* the following two are mutually exclusive. |
92 |
pick one if they're both set. */ |
93 |
if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL)) |
94 |
{ |
95 |
/* unset REGULAR_SPIRAL half the time */ |
96 |
if (RANDOM () % 2 && (option & REGULAR_SPIRAL)) |
97 |
option -= REGULAR_SPIRAL; |
98 |
else |
99 |
option -= FIT_SPIRAL; |
100 |
} |
101 |
|
102 |
xscale = yscale = MAX_FINE; /* fine spiral */ |
103 |
|
104 |
/* choose the spiral pitch */ |
105 |
if (!(option & FINE_SPIRAL)) |
106 |
{ |
107 |
float pitch = (RANDOM () % 5) / 10. + 10. / 22.; |
108 |
|
109 |
xscale = yscale = pitch; |
110 |
} |
111 |
|
112 |
if ((option & FIT_SPIRAL) && (xsize != ysize)) |
113 |
{ |
114 |
if (xsize > ysize) |
115 |
xscale *= (float) xsize / (float) ysize; |
116 |
else |
117 |
yscale *= (float) ysize / (float) xsize; |
118 |
} |
119 |
|
120 |
if (option & REGULAR_SPIRAL) |
121 |
{ |
122 |
float scale = MIN (xscale, yscale); |
123 |
|
124 |
xscale = yscale = scale; |
125 |
} |
126 |
|
127 |
/* cut out the spiral */ |
128 |
while ((fabs (x) < SizeX) && (fabs (y) < SizeY)) |
129 |
{ |
130 |
x = parm * cos (parm) * xscale; |
131 |
y = parm * sin (parm) * yscale; |
132 |
maze[(int) (ic + x)][(int) (jc + y)] = '\0'; |
133 |
parm += 0.01; |
134 |
}; |
135 |
|
136 |
maze[(int) (ic + x + 0.5)][(int) (jc + y + 0.5)] = '<'; |
137 |
|
138 |
|
139 |
/* cut out the center in a 2x2 and place the center and downexit */ |
140 |
maze[ic][jc + 1] = '>'; |
141 |
maze[ic][jc] = 'C'; |
142 |
|
143 |
|
144 |
return maze; |
145 |
} |
146 |
|
147 |
/* the following function connects disjoint spirals which may |
148 |
result from the symmetrization process. */ |
149 |
void |
150 |
connect_spirals (int xsize, int ysize, int sym, char **layout) |
151 |
{ |
152 |
|
153 |
int i, j, ic = xsize / 2, jc = ysize / 2; |
154 |
|
155 |
if (sym == SYMMETRY_X) |
156 |
{ |
157 |
layout[ic][jc] = 0; |
158 |
/* go left from map center */ |
159 |
for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--) |
160 |
layout[i][j] = 0; |
161 |
/* go right */ |
162 |
for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++) |
163 |
layout[i][j] = 0; |
164 |
} |
165 |
|
166 |
if (sym == SYMMETRY_Y) |
167 |
{ |
168 |
|
169 |
layout[ic][jc] = 0; |
170 |
/* go up */ |
171 |
for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--) |
172 |
layout[i][j] = 0; |
173 |
/* go down */ |
174 |
for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++) |
175 |
layout[i][j] = 0; |
176 |
} |
177 |
|
178 |
if (sym == SYMMETRY_XY) |
179 |
{ |
180 |
/* go left from map center */ |
181 |
layout[ic][jc / 2] = 0; |
182 |
layout[ic / 2][jc] = 0; |
183 |
layout[ic][jc / 2 + jc] = 0; |
184 |
layout[ic / 2 + ic][jc] = 0; |
185 |
for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--) |
186 |
{ |
187 |
layout[i][j + jc] = 0; |
188 |
layout[i][j] = 0; |
189 |
} |
190 |
/* go right */ |
191 |
for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++) |
192 |
{ |
193 |
layout[i][j + jc] = 0; |
194 |
layout[i][j] = 0; |
195 |
} |
196 |
/* go up */ |
197 |
for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--) |
198 |
{ |
199 |
layout[i][j] = 0; |
200 |
layout[i + ic][j] = 0; |
201 |
} |
202 |
/* go down */ |
203 |
for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++) |
204 |
{ |
205 |
layout[i][j] = 0; |
206 |
layout[i + ic][j] = 0; |
207 |
} |
208 |
|
209 |
} |
210 |
|
211 |
/* get rid of bad doors. */ |
212 |
for (i = 0; i < xsize; i++) |
213 |
for (j = 0; j < ysize; j++) |
214 |
{ |
215 |
if (layout[i][j] == 'D') |
216 |
{ /* remove bad door. */ |
217 |
int si = surround_check (layout, i, j, xsize, ysize); |
218 |
|
219 |
if (si != 3 && si != 12) |
220 |
{ |
221 |
layout[i][j] = 0; |
222 |
/* back up and recheck any nearby doors */ |
223 |
i = 0; |
224 |
j = 0; |
225 |
} |
226 |
} |
227 |
} |
228 |
|
229 |
|
230 |
|
231 |
} |