1 | /* |
1 | /* |
2 | * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
3 | * |
3 | * |
4 | * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team |
4 | * Copyright (©) 2005,2006,2007,2008,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2002,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2002 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Crossfire TRT 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 3 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, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <crossfire@schmorp.de> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* Specials in this file: |
25 | /* Specials in this file: |
25 | included maps */ |
26 | included maps */ |
26 | |
27 | |
… | |
… | |
37 | #define GLORY_HOLE 1 |
38 | #define GLORY_HOLE 1 |
38 | #define ORC_ZONE 2 |
39 | #define ORC_ZONE 2 |
39 | #define MINING_ZONE 3 |
40 | #define MINING_ZONE 3 |
40 | #define NR_OF_HOLE_TYPES 3 |
41 | #define NR_OF_HOLE_TYPES 3 |
41 | |
42 | |
42 | /* clear map completely of all objects: a rectangular area of xsize, ysize |
43 | /* clear map completely of all !floor objects: |
|
|
44 | * a rectangular area of xsize, ysize |
43 | is cleared with the top left corner at xstart, ystart */ |
45 | * is cleared with the top left corner at xstart, ystart |
44 | |
46 | */ |
45 | void |
47 | static void |
46 | nuke_map_region (maptile *map, int xstart, int ystart, int xsize, int ysize) |
48 | nuke_map_region (maptile *map, char **layout, int xstart, int ystart, int xsize, int ysize) |
47 | { |
49 | { |
48 | int i, j; |
|
|
49 | object *tmp; |
|
|
50 | |
|
|
51 | for (i = xstart; i < xstart + xsize; i++) |
50 | for (int i = xstart; i < xstart + xsize; i++) |
52 | for (j = ystart; j < ystart + ysize; j++) |
51 | for (int j = ystart; j < ystart + ysize; j++) |
53 | { |
52 | { |
54 | for (tmp = GET_MAP_OB (map, i, j); tmp != NULL; tmp = tmp->above) |
53 | layout[i][j] = 'S'; |
|
|
54 | |
|
|
55 | for (object *tmp = map->at (i, j).bot; tmp; ) |
|
|
56 | if (tmp->flag [FLAG_IS_FLOOR]) |
|
|
57 | tmp = tmp->above; |
55 | { |
58 | else |
56 | if (!QUERY_FLAG (tmp, FLAG_IS_FLOOR)) |
|
|
57 | { |
59 | { |
58 | if (tmp->head) |
60 | object *head = tmp->head_ (); |
59 | tmp = tmp->head; |
61 | tmp = tmp->above; |
60 | tmp->remove (); |
|
|
61 | tmp->destroy (); |
62 | head->destroy (); |
62 | tmp = GET_MAP_OB (map, i, j); |
|
|
63 | } |
63 | } |
64 | if (tmp == NULL) |
|
|
65 | break; |
|
|
66 | } |
|
|
67 | } |
64 | } |
68 | } |
65 | } |
69 | |
66 | |
70 | |
|
|
71 | |
|
|
72 | /* copy in_map into dest_map at point x,y */ |
67 | /* copy in_map into dest_map at point x,y */ |
73 | |
68 | static void |
74 | |
|
|
75 | void |
|
|
76 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
69 | include_map_in_map (maptile *dest_map, maptile *in_map, int x, int y) |
77 | { |
70 | { |
78 | int i, j; |
|
|
79 | object *tmp; |
|
|
80 | object *new_ob; |
|
|
81 | |
|
|
82 | /* First, splatter everything in the dest map at the location */ |
|
|
83 | nuke_map_region (dest_map, x, y, in_map->width, in_map->height); |
|
|
84 | |
|
|
85 | for (i = 0; i < in_map->width; i++) |
71 | for (int i = 0; i < in_map->width; i++) |
86 | for (j = 0; j < in_map->height; j++) |
72 | for (int j = 0; j < in_map->height; j++) |
87 | { |
|
|
88 | for (tmp = GET_MAP_OB (in_map, i, j); tmp != NULL; tmp = tmp->above) |
73 | for (object *tmp = GET_MAP_OB (in_map, i, j); tmp; tmp = tmp->above) |
89 | { |
74 | { |
90 | /* don't copy things with multiple squares: must be dealt with |
75 | /* don't copy tails: must be dealt with specially. */ |
91 | specially. */ |
|
|
92 | if (tmp->head != NULL) |
76 | if (!tmp->is_head ()) |
93 | continue; |
77 | continue; |
94 | new_ob = arch_to_object (tmp->arch); |
78 | |
95 | copy_object_with_inv (tmp, new_ob); |
79 | object *new_ob = tmp->deep_clone (); |
|
|
80 | |
96 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
81 | if (QUERY_FLAG (tmp, FLAG_IS_LINKED)) |
97 | add_button_link (new_ob, dest_map, tmp->path_attuned); |
82 | new_ob->add_link (dest_map, tmp->find_link ()->id); |
98 | new_ob->x = i + x; |
83 | |
99 | new_ob->y = j + y; |
84 | dest_map->insert (new_ob, x + i, y + j, 0, INS_NO_MERGE | INS_NO_WALK_ON); |
100 | insert_multisquare_ob_in_map (new_ob, dest_map); |
|
|
101 | } |
85 | } |
102 | } |
|
|
103 | } |
86 | } |
104 | |
87 | |
105 | int |
88 | static int |
106 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
89 | find_spot_for_submap (maptile *map, char **layout, int *ix, int *iy, int xsize, int ysize) |
107 | { |
90 | { |
108 | int tries; |
91 | int blocked, i, j; |
109 | int i = 0, j = 0; /* initialization may not be needed but prevents compiler warnings */ |
|
|
110 | int is_occupied = 0; |
|
|
111 | int l, m; |
|
|
112 | |
92 | |
113 | /* don't even try to place a submap into a map if the big map isn't |
93 | /* don't even try to place a submap into a map if the big map isn't |
114 | sufficiently large. */ |
94 | sufficiently large. */ |
115 | if (2 * xsize > map->width || 2 * ysize > map->height) |
95 | if (2 * xsize > map->width || 2 * ysize > map->height) |
116 | return 0; |
96 | return 0; |
117 | |
97 | |
118 | /* search a bit for a completely free spot. */ |
98 | /* search a bit for a completely free spot. */ |
119 | for (tries = 0; tries < 20; tries++) |
99 | for (int tries = 0; tries < 20; tries++) |
120 | { |
100 | { |
|
|
101 | blocked = 0; |
|
|
102 | |
121 | /* pick a random location in the layout */ |
103 | /* pick a random location in the layout */ |
122 | i = rndm (map->width - xsize - 2) + 1; |
104 | i = rmg_rndm (1, map->width - xsize - 2); |
123 | j = rndm (map->height - ysize - 2) + 1; |
105 | j = rmg_rndm (1, map->height - ysize - 2); |
124 | is_occupied = 0; |
106 | |
125 | for (l = i; l < i + xsize; l++) |
107 | for (int l = i; l < i + xsize; l++) |
126 | for (m = j; m < j + ysize; m++) |
108 | for (int m = j; m < j + ysize; m++) |
127 | is_occupied |= layout[l][m]; |
109 | { |
128 | if (!is_occupied) |
110 | blocked = 1; |
129 | break; |
111 | break; |
130 | } |
112 | } |
131 | |
113 | |
|
|
114 | if (!blocked) |
|
|
115 | break; |
|
|
116 | } |
132 | |
117 | |
133 | /* if we failed, relax the restrictions */ |
118 | /* if we failed, relax the restrictions */ |
134 | |
119 | if (blocked) |
135 | if (is_occupied) |
|
|
136 | { /* failure, try a relaxed placer. */ |
120 | { /* failure, try a relaxed placer. */ |
137 | /* pick a random location in the layout */ |
121 | /* pick a random location in the layout */ |
138 | for (tries = 0; tries < 10; tries++) |
122 | for (int tries = 0; tries < 10; tries++) |
139 | { |
123 | { |
140 | i = rndm (map->width - xsize - 2) + 1; |
124 | i = rmg_rndm (1, map->width - xsize - 2); |
141 | j = rndm (map->height - ysize - 2) + 1; |
125 | j = rmg_rndm (1, map->height - ysize - 2); |
|
|
126 | |
142 | is_occupied = 0; |
127 | blocked = 0; |
|
|
128 | |
143 | for (l = i; l < i + xsize; l++) |
129 | for (int l = i; l < i + xsize; l++) |
144 | for (m = j; m < j + ysize; m++) |
130 | for (int m = j; m < j + ysize; m++) |
145 | if (layout[l][m] == 'C' || layout[l][m] == '>' || layout[l][m] == '<') |
131 | if (layout[l][m] != '#' && layout[l][m] != 'D' && layout[l][m] != 0) |
|
|
132 | { |
146 | is_occupied |= 1; |
133 | blocked = 1; |
|
|
134 | break; |
|
|
135 | } |
147 | } |
136 | } |
148 | } |
137 | } |
149 | if (is_occupied) |
138 | |
|
|
139 | if (blocked) |
150 | return 0; |
140 | return 0; |
|
|
141 | |
151 | *ix = i; |
142 | *ix = i; |
152 | *iy = j; |
143 | *iy = j; |
|
|
144 | |
153 | return 1; |
145 | return 1; |
154 | } |
146 | } |
155 | |
147 | |
156 | |
148 | static void |
157 | void |
|
|
158 | place_fountain_with_specials (maptile *map) |
149 | place_fountain_with_specials (maptile *map) |
159 | { |
150 | { |
160 | int ix, iy, i = -1, tries = 0; |
151 | int ix, iy, i = -1, tries = 0; |
161 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
152 | maptile *fountain_style = find_style ("/styles/misc", "fountains", -1); |
162 | |
153 | |
… | |
… | |
164 | { |
155 | { |
165 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
156 | LOG (llevError, "unable to load stylemap /styles/misc fountains\n"); |
166 | return; |
157 | return; |
167 | } |
158 | } |
168 | |
159 | |
169 | object *fountain = get_archetype ("fountain"); |
160 | object *fountain = archetype::get (shstr_fountain); |
170 | object *potion = object::create (); |
161 | object *potion = fountain_style->pick_random_object (rmg_rndm)->clone (); |
171 | |
|
|
172 | fountain_style->pick_random_object ()->copy_to (potion); |
|
|
173 | |
162 | |
174 | while (i < 0 && tries < 10) |
163 | while (i < 0 && tries < 10) |
175 | { |
164 | { |
176 | ix = rndm (map->width - 2) + 1; |
165 | ix = rmg_rndm (map->width - 2) + 1; |
177 | iy = rndm (map->height - 2) + 1; |
166 | iy = rmg_rndm (map->height - 2) + 1; |
178 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
167 | i = find_free_spot (fountain, map, ix, iy, 1, SIZEOFFREE1 + 1); |
179 | tries++; |
168 | tries++; |
180 | } |
169 | } |
181 | |
170 | |
182 | if (i == -1) |
171 | if (i == -1) |
… | |
… | |
189 | ix += freearr_x[i]; |
178 | ix += freearr_x[i]; |
190 | iy += freearr_y[i]; |
179 | iy += freearr_y[i]; |
191 | potion->face = fountain->face; |
180 | potion->face = fountain->face; |
192 | SET_FLAG (potion, FLAG_NO_PICK); |
181 | SET_FLAG (potion, FLAG_NO_PICK); |
193 | SET_FLAG (potion, FLAG_IDENTIFIED); |
182 | SET_FLAG (potion, FLAG_IDENTIFIED); |
194 | potion->name = potion->name_pl = "fountain"; |
183 | potion->name = potion->name_pl = shstr_fountain; |
195 | potion->x = ix; |
184 | potion->x = ix; |
196 | potion->y = iy; |
185 | potion->y = iy; |
197 | potion->materialname = "adamantium"; |
186 | potion->material = name_to_material (shstr_adamantium); |
198 | fountain->x = ix; |
187 | fountain->x = ix; |
199 | fountain->y = iy; |
188 | fountain->y = iy; |
200 | insert_ob_in_map (fountain, map, NULL, 0); |
189 | insert_ob_in_map (fountain, map, NULL, 0); |
201 | insert_ob_in_map (potion, map, NULL, 0); |
190 | insert_ob_in_map (potion, map, NULL, 0); |
202 | } |
191 | } |
203 | |
192 | |
204 | void |
193 | static void |
205 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
194 | place_special_exit (maptile *map, int hole_type, random_map_params *RP) |
206 | { |
195 | { |
207 | int ix, iy, i = -1; |
196 | int ix, iy, i = -1; |
208 | char buf[16384]; |
197 | char buf[16384]; |
209 | const char *style, *decor, *mon; |
198 | const char *style, *decor, *mon; |
210 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
199 | maptile *exit_style = find_style ("/styles/misc", "obscure_exits", -1); |
211 | int g_xsize, g_ysize; |
200 | int g_xsize, g_ysize; |
212 | |
201 | |
213 | if (!exit_style) |
202 | if (!exit_style) |
214 | { |
203 | { |
215 | LOG (llevError, "unabel to load stylemap /styles/misc obscure_exits\n"); |
204 | LOG (llevError, "unable to load stylemap /styles/misc obscure_exits\n"); |
216 | return; |
205 | return; |
217 | } |
206 | } |
218 | |
|
|
219 | object *the_exit = object::create (); |
|
|
220 | |
207 | |
221 | if (!exit_style) |
208 | if (!exit_style) |
222 | return; |
209 | return; |
223 | |
210 | |
224 | exit_style->pick_random_object ()->copy_to (the_exit); |
211 | object *the_exit = exit_style->pick_random_object (rmg_rndm)->clone (); |
225 | |
212 | |
226 | while (i < 0) |
213 | // put an upper bound here, just in case |
|
|
214 | for (int repeat = 8192; --repeat; ) |
227 | { |
215 | { |
228 | ix = rndm (map->width - 2) + 1; |
216 | ix = rmg_rndm (1, map->width - 2); |
229 | iy = rndm (map->height - 2) + 1; |
217 | iy = rmg_rndm (1, map->height - 2); |
|
|
218 | |
230 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
219 | i = find_free_spot (the_exit, map, ix, iy, 1, SIZEOFFREE1 + 1); |
231 | } |
220 | if (i >= 0) |
232 | |
221 | { |
233 | ix += freearr_x[i]; |
222 | ix += freearr_x[i]; |
234 | iy += freearr_y[i]; |
223 | iy += freearr_y[i]; |
|
|
224 | break; |
|
|
225 | } |
|
|
226 | } |
|
|
227 | |
235 | the_exit->x = ix; |
228 | the_exit->x = ix; |
236 | the_exit->y = iy; |
229 | the_exit->y = iy; |
237 | |
230 | |
238 | if (!hole_type) |
231 | if (!hole_type) |
239 | hole_type = rndm (NR_OF_HOLE_TYPES) + 1; |
232 | hole_type = rmg_rndm (NR_OF_HOLE_TYPES) + 1; |
240 | |
233 | |
241 | switch (hole_type) |
234 | switch (hole_type) |
242 | { |
235 | { |
243 | case GLORY_HOLE: /* treasures */ |
236 | case GLORY_HOLE: /* treasures */ |
244 | { |
237 | { |
245 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
238 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
246 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
239 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
247 | style = "onion"; |
240 | style = "onion"; |
248 | decor = "wealth2"; |
241 | decor = "wealth2"; |
249 | mon = "none"; |
242 | mon = "none"; |
250 | break; |
243 | break; |
251 | } |
244 | } |
252 | |
245 | |
253 | case ORC_ZONE: /* hole with orcs in it. */ |
246 | case ORC_ZONE: /* hole with orcs in it. */ |
254 | { |
247 | { |
255 | g_xsize = rndm (3) + 4 + RP->difficulty / 4; |
248 | g_xsize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
256 | g_ysize = rndm (3) + 4 + RP->difficulty / 4; |
249 | g_ysize = rmg_rndm (3) + 4 + RP->difficulty / 4; |
257 | style = "onion"; |
250 | style = "onion"; |
258 | decor = "wealth2"; |
251 | decor = "wealth2"; |
259 | mon = "orc"; |
252 | mon = "orc"; |
260 | break; |
253 | break; |
261 | } |
254 | } |
262 | |
255 | |
263 | case MINING_ZONE: /* hole with orcs in it. */ |
256 | case MINING_ZONE: /* hole with orcs in it. */ |
264 | { |
257 | { |
265 | g_xsize = rndm (9) + 4 + RP->difficulty / 4; |
258 | g_xsize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
266 | g_ysize = rndm (9) + 4 + RP->difficulty / 4; |
259 | g_ysize = rmg_rndm (9) + 4 + RP->difficulty / 4; |
267 | style = "maze"; |
260 | style = "maze"; |
268 | decor = "minerals2"; |
261 | decor = "minerals2"; |
269 | mon = "none"; |
262 | mon = "none"; |
270 | break; |
263 | break; |
271 | } |
264 | } |
… | |
… | |
277 | } |
270 | } |
278 | |
271 | |
279 | /* Need to be at least this size, otherwise the load |
272 | /* Need to be at least this size, otherwise the load |
280 | * code will generate new size values which are too large. |
273 | * code will generate new size values which are too large. |
281 | */ |
274 | */ |
282 | if (g_xsize < MIN_RANDOM_MAP_SIZE) |
275 | if (g_xsize < MIN_RANDOM_MAP_SIZE) g_xsize = MIN_RANDOM_MAP_SIZE; |
283 | g_xsize = MIN_RANDOM_MAP_SIZE; |
276 | if (g_ysize < MIN_RANDOM_MAP_SIZE) g_ysize = MIN_RANDOM_MAP_SIZE; |
284 | if (g_ysize < MIN_RANDOM_MAP_SIZE) |
|
|
285 | g_ysize = MIN_RANDOM_MAP_SIZE; |
|
|
286 | |
277 | |
287 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
278 | write_parameters_to_string (buf, g_xsize, g_ysize, RP->wallstyle, RP->floorstyle, mon, |
288 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
279 | "none", style, decor, "none", RP->exitstyle, 0, 0, 0, |
289 | RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
280 | RMOPT_WALLS_ONLY, 0, 0, 1, RP->dungeon_level, RP->dungeon_level, |
290 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
281 | RP->difficulty, RP->difficulty, -1, 1, 0, 0, 0, 0, RP->difficulty_increase); |
291 | the_exit->slaying = "/!"; |
282 | the_exit->slaying = shstr_random_map_exit; |
292 | the_exit->msg = buf; |
283 | the_exit->msg = buf; |
293 | |
284 | |
294 | insert_ob_in_map (the_exit, map, NULL, 0); |
285 | insert_ob_in_map (the_exit, map, NULL, 0); |
295 | } |
286 | } |
296 | |
|
|
297 | |
287 | |
298 | void |
288 | void |
299 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
289 | place_specials_in_map (maptile *map, char **layout, random_map_params *RP) |
300 | { |
290 | { |
301 | maptile *special_map; |
291 | switch (rmg_rndm (NUM_OF_SPECIAL_TYPES)) |
302 | int ix, iy; /* map insertion locatons */ |
|
|
303 | int special_type; /* type of special to make */ |
|
|
304 | |
|
|
305 | special_type = rndm (NUM_OF_SPECIAL_TYPES); |
|
|
306 | |
|
|
307 | switch (special_type) |
|
|
308 | { |
292 | { |
309 | case SPECIAL_SUBMAP: |
293 | case SPECIAL_SUBMAP: |
|
|
294 | { |
310 | /* includes a special map into the random map being made. */ |
295 | /* includes a special map into the random map being made. */ |
311 | special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
296 | maptile *special_map = find_style ("/styles/specialmaps", 0, RP->difficulty); |
312 | |
297 | |
313 | if (!special_map) |
298 | if (!special_map) |
314 | return; |
299 | break; |
315 | |
300 | |
|
|
301 | int ix, iy; /* map insertion locatons */ |
|
|
302 | |
316 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
303 | if (find_spot_for_submap (map, layout, &ix, &iy, special_map->width, special_map->height)) |
|
|
304 | { |
|
|
305 | /* First, splatter everything in the dest map at the location */ |
|
|
306 | nuke_map_region (map, layout, ix, iy, special_map->width, special_map->height); |
317 | include_map_in_map (map, special_map, ix, iy); |
307 | include_map_in_map (map, special_map, ix, iy); |
|
|
308 | } |
|
|
309 | } |
318 | |
310 | |
319 | break; |
311 | break; |
320 | |
312 | |
321 | case SPECIAL_FOUNTAIN: |
313 | case SPECIAL_FOUNTAIN: |
322 | /* Make a special fountain: an unpickable potion disguised as |
314 | /* Make a special fountain: an unpickable potion disguised as |
… | |
… | |
327 | case SPECIAL_EXIT: |
319 | case SPECIAL_EXIT: |
328 | /* Make an exit to another random map, e.g. a gloryhole. */ |
320 | /* Make an exit to another random map, e.g. a gloryhole. */ |
329 | place_special_exit (map, 0, RP); |
321 | place_special_exit (map, 0, RP); |
330 | break; |
322 | break; |
331 | } |
323 | } |
332 | |
|
|
333 | } |
324 | } |
|
|
325 | |