| … | |
… | |
| 218 | the_exit_up->x = upx; |
218 | the_exit_up->x = upx; |
| 219 | the_exit_up->y = upy; |
219 | the_exit_up->y = upy; |
| 220 | |
220 | |
| 221 | /* surround the exits with notices that this is a random map. */ |
221 | /* surround the exits with notices that this is a random map. */ |
| 222 | for (int j = 1; j < 9; j++) |
222 | for (int j = 1; j < 9; j++) |
| 223 | { |
|
|
| 224 | if (!wall_blocked (map, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j])) |
223 | if (!wall_blocked (map, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j])) |
| 225 | { |
224 | { |
| 226 | object *random_sign = archetype::get (shstr_sign); |
225 | object *random_sign = archetype::get (shstr_sign); |
| 227 | random_sign->msg = format ("This is a random map.\nLevel: %d\n", RP->dungeon_level - 1); |
226 | random_sign->msg = format ("This is a random map.\nLevel: %d of %d.\n", RP->dungeon_level - 1, RP->dungeon_depth); |
| 228 | map->insert (random_sign, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j], 0, 0); |
227 | map->insert (random_sign, the_exit_up->x + freearr_x[j], the_exit_up->y + freearr_y[j], 0, 0); |
| 229 | } |
228 | } |
| 230 | } |
|
|
| 231 | |
229 | |
| 232 | /* Block the exit so things don't get dumped on top of it. */ |
230 | /* Block the exit so things don't get dumped on top of it. */ |
| 233 | the_exit_up->move_block = MOVE_ALL; |
231 | the_exit_up->move_block = MOVE_ALL; |
| 234 | |
232 | |
| 235 | insert_ob_in_map (the_exit_up, map, NULL, 0); |
233 | insert_ob_in_map (the_exit_up, map, NULL, 0); |
