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