| … | |
… | |
| 37 | *fx = -1; |
37 | *fx = -1; |
| 38 | *fy = -1; |
38 | *fy = -1; |
| 39 | |
39 | |
| 40 | /* if a starting point isn't given, pick one */ |
40 | /* if a starting point isn't given, pick one */ |
| 41 | if (mode < 1 || mode > 4) |
41 | if (mode < 1 || mode > 4) |
| 42 | M = rndm (4) + 1; |
42 | M = rmg_rndm (4) + 1; |
| 43 | else |
43 | else |
| 44 | M = mode; |
44 | M = mode; |
| 45 | |
45 | |
| 46 | /* four different search starting points and methods so that |
46 | /* four different search starting points and methods so that |
| 47 | we can do something different for symmetrical maps instead of |
47 | we can do something different for symmetrical maps instead of |
| 48 | the same damned thing every time. */ |
48 | the same damned thing every time. */ |
| 49 | switch (M) |
49 | switch (M) |
| 50 | { |
50 | { |
| 51 | case 1: |
51 | case 1: |
| 52 | { /* search from top left down/right */ |
52 | /* search from top left down/right */ |
| 53 | for (i = 1; i < RP->Xsize; i++) |
53 | for (i = 1; i < RP->Xsize; i++) |
| 54 | for (j = 1; j < RP->Ysize; j++) |
54 | for (j = 1; j < RP->Ysize; j++) |
| 55 | { |
55 | { |
| 56 | if (layout[i][j] == target) |
56 | if (layout[i][j] == target) |
| 57 | { |
57 | { |
| 58 | *fx = i; |
58 | *fx = i; |
| 59 | *fy = j; |
59 | *fy = j; |
| 60 | return; |
60 | return; |
| 61 | } |
61 | } |
| 62 | } |
62 | } |
| 63 | break; |
63 | break; |
| 64 | } |
64 | |
| 65 | case 2: |
65 | case 2: |
| 66 | { /* Search from top right down/left */ |
66 | /* Search from top right down/left */ |
| 67 | for (i = RP->Xsize - 2; i > 0; i--) |
67 | for (i = RP->Xsize - 2; i > 0; i--) |
| 68 | for (j = 1; j < RP->Ysize - 1; j++) |
68 | for (j = 1; j < RP->Ysize - 1; j++) |
| 69 | { |
69 | { |
| 70 | if (layout[i][j] == target) |
70 | if (layout[i][j] == target) |
| 71 | { |
71 | { |
| 72 | *fx = i; |
72 | *fx = i; |
| 73 | *fy = j; |
73 | *fy = j; |
| 74 | return; |
74 | return; |
| 75 | } |
75 | } |
| 76 | } |
76 | } |
| 77 | break; |
77 | break; |
| 78 | } |
78 | |
| 79 | case 3: |
79 | case 3: |
| 80 | { /* search from bottom-left up-right */ |
80 | /* search from bottom-left up-right */ |
| 81 | for (i = 1; i < RP->Xsize - 1; i++) |
81 | for (i = 1; i < RP->Xsize - 1; i++) |
| 82 | for (j = RP->Ysize - 2; j > 0; j--) |
82 | for (j = RP->Ysize - 2; j > 0; j--) |
| 83 | { |
83 | { |
| 84 | if (layout[i][j] == target) |
84 | if (layout[i][j] == target) |
| 85 | { |
85 | { |
| 86 | *fx = i; |
86 | *fx = i; |
| 87 | *fy = j; |
87 | *fy = j; |
| 88 | return; |
88 | return; |
| 89 | } |
89 | } |
| 90 | } |
90 | } |
| 91 | break; |
91 | break; |
| 92 | } |
92 | |
| 93 | case 4: |
93 | case 4: |
| 94 | { /* search from bottom-right up-left */ |
94 | /* search from bottom-right up-left */ |
| 95 | for (i = RP->Xsize - 2; i > 0; i--) |
95 | for (i = RP->Xsize - 2; i > 0; i--) |
| 96 | for (j = RP->Ysize - 2; j > 0; j--) |
96 | for (j = RP->Ysize - 2; j > 0; j--) |
| 97 | { |
97 | { |
| 98 | if (layout[i][j] == target) |
98 | if (layout[i][j] == target) |
| 99 | { |
99 | { |
| 100 | *fx = i; |
100 | *fx = i; |
| 101 | *fy = j; |
101 | *fy = j; |
| 102 | return; |
102 | return; |
| 103 | } |
103 | } |
| 104 | } |
104 | } |
| 105 | break; |
105 | break; |
| 106 | } |
106 | |
| 107 | } |
107 | } |
| 108 | } |
108 | } |
| 109 | |
109 | |
| 110 | /* orientation: 0 means random, |
110 | /* orientation: 0 means random, |
| 111 | 1 means descending dungeon |
111 | 1 means descending dungeon |
| … | |
… | |
| 121 | char styledirname[1024]; |
121 | char styledirname[1024]; |
| 122 | maptile *style_map_down = 0; /* harder maze */ |
122 | maptile *style_map_down = 0; /* harder maze */ |
| 123 | maptile *style_map_up = 0; /* easier maze */ |
123 | maptile *style_map_up = 0; /* easier maze */ |
| 124 | object *the_exit_down; /* harder maze */ |
124 | object *the_exit_down; /* harder maze */ |
| 125 | object *the_exit_up; /* easier maze */ |
125 | object *the_exit_up; /* easier maze */ |
| 126 | object *random_sign; /* magic mouth saying this is a random map. */ |
|
|
| 127 | int cx = -1, cy = -1; /* location of a map center */ |
126 | int cx = -1, cy = -1; /* location of a map center */ |
| 128 | int upx = -1, upy = -1; /* location of up exit */ |
127 | int upx = -1, upy = -1; /* location of up exit */ |
| 129 | int downx = -1, downy = -1; |
128 | int downx = -1, downy = -1; |
| 130 | int final_map_exit = 1; |
129 | int final_map_exit = 1; |
| 131 | |
130 | |
| 132 | if (RP->exit_on_final_map) |
131 | if (RP->exit_on_final_map) |
| 133 | if (strstr (RP->exit_on_final_map, "no")) |
132 | if (strstr (RP->exit_on_final_map, "no")) |
| 134 | final_map_exit = 0; |
133 | final_map_exit = 0; |
| 135 | |
134 | |
| 136 | if (!orientation) |
135 | if (!orientation) |
| 137 | orientation = rndm (6) + 1; |
136 | orientation = rmg_rndm (6) + 1; |
| 138 | |
137 | |
| 139 | switch (orientation) |
138 | switch (orientation) |
| 140 | { |
139 | { |
| 141 | case 1: |
140 | case 1: |
| 142 | { |
141 | { |
| … | |
… | |
| 163 | style_map_down = style_map_up; |
162 | style_map_down = style_map_up; |
| 164 | break; |
163 | break; |
| 165 | } |
164 | } |
| 166 | } |
165 | } |
| 167 | |
166 | |
| 168 | if (style_map_up == 0) |
167 | the_exit_up = style_map_up |
| 169 | the_exit_up = arch_to_object (archetype::find ("exit")); |
168 | ? style_map_up->pick_random_object (rmg_rndm)->clone () |
| 170 | |
169 | : archetype::get (shstr_exit); |
| 171 | else |
|
|
| 172 | { |
|
|
| 173 | object *tmp; |
|
|
| 174 | |
|
|
| 175 | tmp = style_map_up->pick_random_object (); |
|
|
| 176 | the_exit_up = arch_to_object (tmp->arch); |
|
|
| 177 | } |
|
|
| 178 | |
170 | |
| 179 | /* we need a down exit only if we're recursing. */ |
171 | /* we need a down exit only if we're recursing. */ |
| 180 | if (RP->dungeon_level < RP->dungeon_depth || RP->final_map[0] != 0) |
172 | if (RP->dungeon_level < RP->dungeon_depth || *RP->final_map) |
| 181 | if (style_map_down == 0) |
173 | the_exit_down = style_map_down |
| 182 | the_exit_down = arch_to_object (archetype::find ("exit")); |
|
|
| 183 | |
|
|
| 184 | else |
|
|
| 185 | { |
|
|
| 186 | object *tmp; |
|
|
| 187 | |
|
|
| 188 | tmp = style_map_down->pick_random_object (); |
174 | ? style_map_down->pick_random_object (rmg_rndm)->clone () |
| 189 | the_exit_down = arch_to_object (tmp->arch); |
175 | : archetype::get (shstr_exit); |
| 190 | } |
|
|
| 191 | else |
176 | else |
| 192 | the_exit_down = 0; |
177 | the_exit_down = 0; |
| 193 | |
178 | |
| 194 | /* set up the up exit */ |
179 | /* set up the up exit */ |
| 195 | the_exit_up->stats.hp = RP->origin_x; |
180 | the_exit_up->stats.hp = RP->origin_x; |
| … | |
… | |
| 239 | /* surround the exits with notices that this is a random map. */ |
224 | /* surround the exits with notices that this is a random map. */ |
| 240 | for (int j = 1; j < 9; j++) |
225 | for (int j = 1; j < 9; j++) |
| 241 | { |
226 | { |
| 242 | if (!wall_blocked (map, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j])) |
227 | if (!wall_blocked (map, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j])) |
| 243 | { |
228 | { |
| 244 | random_sign = get_archetype ("sign"); |
229 | object *random_sign = archetype::get (shstr_sign); |
| 245 | random_sign->x = the_exit_up->x + freearr_x[j]; |
230 | random_sign->msg = format ("This is a random map.\nLevel: %d\n", RP->dungeon_level - 1); |
| 246 | random_sign->y = the_exit_up->y + freearr_y[j]; |
231 | map->insert (random_sign, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j], 0, 0); |
| 247 | |
|
|
| 248 | char buf[8192]; |
|
|
| 249 | sprintf (buf, "This is a random map.\nLevel: %d\n", (RP->dungeon_level) - 1); |
|
|
| 250 | |
|
|
| 251 | random_sign->msg = buf; |
|
|
| 252 | insert_ob_in_map (random_sign, map, NULL, 0); |
|
|
| 253 | } |
232 | } |
| 254 | } |
233 | } |
| 255 | |
234 | |
| 256 | /* Block the exit so things don't get dumped on top of it. */ |
235 | /* Block the exit so things don't get dumped on top of it. */ |
| 257 | the_exit_up->move_block = MOVE_ALL; |
236 | the_exit_up->move_block = MOVE_ALL; |
| … | |
… | |
| 263 | map->enter_x = the_exit_up->x; |
242 | map->enter_x = the_exit_up->x; |
| 264 | map->enter_y = the_exit_up->y; |
243 | map->enter_y = the_exit_up->y; |
| 265 | |
244 | |
| 266 | /* first, look for a '>' character */ |
245 | /* first, look for a '>' character */ |
| 267 | find_in_layout (0, '>', &downx, &downy, maze, RP); |
246 | find_in_layout (0, '>', &downx, &downy, maze, RP); |
|
|
247 | |
| 268 | /* if no > is found use C */ |
248 | /* if no > is found use C */ |
| 269 | if (downx == -1) |
249 | if (downx == -1) |
| 270 | { |
250 | { |
| 271 | downx = cx; |
251 | downx = cx; |
| 272 | downy = cy; |
252 | downy = cy; |
