3 * @brief ダンジョンフロアの部屋生成処理 / make rooms. Used by generate.c when creating dungeons.
6 * Copyright (c) 1997 Ben Harrison, James E. Wilson, Robert A. Koeneke\n
7 * This software may be copied and distributed for educational, research,\n
8 * and not for profit purposes provided that this copyright and statement\n
9 * are included in all such copies. Other copyrights may also apply.\n
10 * 2014 Deskull rearranged comment for Doxygen. \n
12 * Room building routines.\n
18 * 4 -- large room with features\n
19 * 5 -- monster nests\n
21 * 7 -- simple vaults\n
22 * 8 -- greater vaults\n
23 * 9 -- fractal caves\n
24 * 10 -- random vaults\n
25 * 11 -- circular rooms\n
27 * 13 -- trapped monster pits\n
28 * 14 -- trapped room\n
30 * 16 -- underground arcade\n
32 * Some functions are used to determine if the given monster\n
33 * is appropriate for inclusion in a monster nest or monster pit or\n
36 * None of the pits/nests are allowed to include "unique" monsters.\n
47 *[from SAngband (originally from OAngband)]\n
49 * Table of values that control how many times each type of room will\n
50 * appear. Each type of room has its own row, and each column\n
51 * corresponds to dungeon levels 0, 10, 20, and so on. The final\n
52 * value is the minimum depth the room can appear at. -LM-\n
54 * Level 101 and below use the values for level 100.\n
56 * Rooms with lots of monsters or loot may not be generated if the\n
57 * object or monster lists are already nearly full. Rooms will not\n
58 * appear above their minimum depth. Tiny levels will not have space\n
59 * for all the rooms you ask for.\n
61 static room_info_type room_info_normal[ROOM_T_MAX] =
64 /* 0 10 20 30 40 50 60 70 80 90 100 min limit */
66 {{999,900,800,700,600,500,400,300,200,100, 0}, 0}, /*NORMAL */
67 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 1}, /*OVERLAP */
68 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 3}, /*CROSS */
69 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 3}, /*INNER_F */
70 {{ 0, 1, 1, 1, 2, 3, 5, 6, 8, 10, 13}, 10}, /*NEST */
71 {{ 0, 1, 1, 2, 3, 4, 6, 8, 10, 13, 16}, 10}, /*PIT */
72 {{ 0, 1, 1, 1, 2, 2, 3, 5, 6, 8, 10}, 10}, /*LESSER_V */
73 {{ 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 4}, 20}, /*GREATER_V*/
74 {{ 0,100,200,300,400,500,600,700,800,900,999}, 10}, /*FRACAVE */
75 {{ 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2}, 10}, /*RANDOM_V */
76 {{ 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40}, 3}, /*OVAL */
77 {{ 1, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60}, 10}, /*CRYPT */
78 {{ 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8}, 20}, /*TRAP_PIT */
79 {{ 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8}, 20}, /*TRAP */
80 {{ 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2}, 40}, /*GLASS */
81 {{ 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3}, 1}, /*ARCADE */
85 /*! 部屋の生成処理順 / Build rooms in descending order of difficulty. */
86 static byte room_build_order[ROOM_T_MAX] = {
106 * @brief 鍵のかかったドアを配置する
107 * @param y 配置したいフロアのY座標
108 * @param x 配置したいフロアのX座標
111 static void place_locked_door(int y, int x)
113 if (d_info[dungeon_type].flags1 & DF1_NO_DOORS)
115 place_floor_bold(y, x);
119 set_cave_feat(y, x, feat_locked_door_random((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR));
120 cave[y][x].info &= ~(CAVE_FLOOR);
121 delete_monster(y, x);
127 * @param y 配置したいフロアのY座標
128 * @param x 配置したいフロアのX座標
129 * @param type #DOOR_DEFAULT / #DOOR_DOOR / #DOOR_GLASS_DOOR / #DOOR_CURTAIN のいずれか
132 static void place_secret_door(int y, int x, int type)
134 if (d_info[dungeon_type].flags1 & DF1_NO_DOORS)
136 place_floor_bold(y, x);
140 cave_type *c_ptr = &cave[y][x];
142 if (type == DOOR_DEFAULT)
144 type = ((d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
145 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
146 ((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
149 /* Create secret door */
150 place_closed_door(y, x, type);
152 if (type != DOOR_CURTAIN)
154 /* Hide by inner wall because this is used in rooms only */
155 c_ptr->mimic = feat_wall_inner;
157 /* Floor type terrain cannot hide a door */
158 if (feat_supports_los(c_ptr->mimic) && !feat_supports_los(c_ptr->feat))
160 if (have_flag(f_info[c_ptr->mimic].flags, FF_MOVE) || have_flag(f_info[c_ptr->mimic].flags, FF_CAN_FLY))
162 c_ptr->feat = one_in_(2) ? c_ptr->mimic : floor_type[randint0(100)];
168 c_ptr->info &= ~(CAVE_FLOOR);
169 delete_monster(y, x);
174 * @brief 1マスだけの部屋を作成し、上下左右いずれか一つに隠しドアを配置する。
175 * @param y0 配置したい中心のY座標
176 * @param x0 配置したい中心のX座標
178 * This funtion makes a very small room centred at (x0, y0)
179 * This is used in crypts, and random elemental vaults.
181 * Note - this should be used only on allocated regions
182 * within another room.
184 static void build_small_room(int x0, int y0)
188 for (y = y0 - 1; y <= y0 + 1; y++)
190 place_inner_bold(y, x0 - 1);
191 place_inner_bold(y, x0 + 1);
194 for (x = x0 - 1; x <= x0 + 1; x++)
196 place_inner_bold(y0 - 1, x);
197 place_inner_bold(y0 + 1, x);
200 /* Place a secret door on one side */
203 case 0: place_secret_door(y0, x0 - 1, DOOR_DEFAULT); break;
204 case 1: place_secret_door(y0, x0 + 1, DOOR_DEFAULT); break;
205 case 2: place_secret_door(y0 - 1, x0, DOOR_DEFAULT); break;
206 case 3: place_secret_door(y0 + 1, x0, DOOR_DEFAULT); break;
209 /* Clear mimic type */
210 cave[y0][x0].mimic = 0;
212 /* Add inner open space */
213 place_floor_bold(y0, x0);
218 * 指定範囲に通路が通っていることを確認した上で床で埋める
219 * This function tunnels around a room if it will cut off part of a cave system.
226 static void check_room_boundary(int x1, int y1, int x2, int y2)
229 bool old_is_floor, new_is_floor;
235 old_is_floor = get_is_floor(x1 - 1, y1);
238 * Count the number of floor-wall boundaries around the room
239 * Note: diagonal squares are ignored since the player can move diagonally
240 * to bypass these if needed.
243 /* Above the top boundary */
244 for (x = x1; x <= x2; x++)
246 new_is_floor = get_is_floor(x, y1 - 1);
248 /* Increment counter if they are different */
249 if (new_is_floor != old_is_floor) count++;
251 old_is_floor = new_is_floor;
255 for (y = y1; y <= y2; y++)
257 new_is_floor = get_is_floor(x2 + 1, y);
259 /* increment counter if they are different */
260 if (new_is_floor != old_is_floor) count++;
262 old_is_floor = new_is_floor;
265 /* Bottom boundary */
266 for (x = x2; x >= x1; x--)
268 new_is_floor = get_is_floor(x, y2 + 1);
270 /* increment counter if they are different */
271 if (new_is_floor != old_is_floor) count++;
273 old_is_floor = new_is_floor;
277 for (y = y2; y >= y1; y--)
279 new_is_floor = get_is_floor(x1 - 1, y);
281 /* increment counter if they are different */
282 if (new_is_floor != old_is_floor) count++;
284 old_is_floor = new_is_floor;
287 /* If all the same, or only one connection exit. */
288 if (count <= 2) return;
291 /* Tunnel around the room so to prevent problems with caves */
292 for (y = y1; y <= y2; y++)
294 for (x = x1; x <= x2; x++)
304 * find_space()の予備処理として部屋の生成が可能かを判定する /
305 * Helper function for find_space(). Is this a good location?
306 * @param blocks_high 範囲の高さ
307 * @param blocks_wide 範囲の幅
308 * @param block_y 範囲の上端
309 * @param block_x 範囲の左端
312 static bool find_space_aux(int blocks_high, int blocks_wide, int block_y, int block_x)
314 int by1, bx1, by2, bx2, by, bx;
316 /* Itty-bitty rooms must shift about within their rectangle */
319 if ((blocks_wide == 2) && (block_x % 3) == 2)
323 /* Rooms with width divisible by 3 must be fitted to a rectangle. */
324 else if ((blocks_wide % 3) == 0)
326 /* Must be aligned to the left edge of a 11x33 rectangle. */
327 if ((block_x % 3) != 0)
332 * Big rooms that do not have a width divisible by 3 must be
333 * aligned towards the edge of the dungeon closest to them.
337 /* Shift towards left edge of dungeon. */
338 if (block_x + (blocks_wide / 2) <= dun->col_rooms / 2)
340 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
342 if ((block_x % 3) == 1)
346 /* Shift toward right edge of dungeon. */
349 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
351 if ((block_x % 3) == 1)
359 by2 = block_y + blocks_high;
360 bx2 = block_x + blocks_wide;
362 /* Never run off the screen */
363 if ((by1 < 0) || (by2 > dun->row_rooms)) return FALSE;
364 if ((bx1 < 0) || (bx2 > dun->col_rooms)) return FALSE;
366 /* Verify available space */
367 for (by = by1; by < by2; by++)
369 for (bx = bx1; bx < bx2; bx++)
371 if (dun->room_map[by][bx])
378 /* This location is okay */
384 * @brief 部屋生成が可能なスペースを確保する / Find a good spot for the next room. -LM-
385 * @param y 部屋の生成が可能な中心Y座標を返す参照ポインタ
386 * @param x 部屋の生成が可能な中心X座標を返す参照ポインタ
387 * @param height 確保したい領域の高さ
388 * @param width 確保したい領域の幅
389 * @return 所定の範囲が確保できた場合TRUEを返す
391 * Find and allocate a free space in the dungeon large enough to hold\n
392 * the room calling this function.\n
394 * We allocate space in 11x11 blocks, but want to make sure that rooms\n
395 * align neatly on the standard screen. Therefore, we make them use\n
396 * blocks in few 11x33 rectangles as possible.\n
398 * Be careful to include the edges of the room in height and width!\n
400 * Return TRUE and values for the center of the room if all went well.\n
401 * Otherwise, return FALSE.\n
403 static bool find_space(int *y, int *x, int height, int width)
405 int candidates, pick;
406 int by, bx, by1, bx1, by2, bx2;
407 int block_y = 0, block_x = 0;
410 /* Find out how many blocks we need. */
411 int blocks_high = 1 + ((height - 1) / BLOCK_HGT);
412 int blocks_wide = 1 + ((width - 1) / BLOCK_WID);
414 /* There are no way to allocate such huge space */
415 if (dun->row_rooms < blocks_high) return FALSE;
416 if (dun->col_rooms < blocks_wide) return FALSE;
421 /* Count the number of valid places */
422 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
424 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
426 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
428 /* Find a valid place */
441 if (!(d_info[dungeon_type].flags1 & DF1_NO_CAVE))
443 /* Choose a random one */
444 pick = randint1(candidates);
447 /* NO_CAVE dungeon (Castle) */
450 /* Always choose the center one */
451 pick = candidates/2 + 1;
454 /* Pick up the choosen location */
455 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
457 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
459 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
463 /* This one is picked? */
474 by2 = block_y + blocks_high;
475 bx2 = block_x + blocks_wide;
478 * It is *extremely* important that the following calculation
479 * be *exactly* correct to prevent memory errors
482 /* Acquire the location of the room */
483 (*y) = ((by1 + by2) * BLOCK_HGT) / 2;
484 (*x) = ((bx1 + bx2) * BLOCK_WID) / 2;
486 /* Save the room location */
487 if (dun->cent_n < CENT_MAX)
489 dun->cent[dun->cent_n].y = *y;
490 dun->cent[dun->cent_n].x = *x;
494 /* Reserve some blocks. */
495 for (by = by1; by < by2; by++)
497 for (bx = bx1; bx < bx2; bx++)
499 dun->room_map[by][bx] = TRUE;
505 * Hack- See if room will cut off a cavern.
507 * If so, fix by tunneling outside the room in such a
508 * way as to connect the caves.
510 check_room_boundary(*x - width / 2 - 1, *y - height / 2 - 1, *x + (width - 1) / 2 + 1, *y + (height - 1) / 2 + 1);
519 * @brief タイプ1の部屋…通常可変長方形の部屋を生成する / Type 1 -- normal rectangular rooms
522 static bool build_type1(void)
524 int y, x, y2, x2, yval, xval;
525 int y1, x1, xsize, ysize;
531 bool curtain = (d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
532 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 48 : 512);
534 /* Pick a room size */
543 /* Find and reserve some space in the dungeon. Get center of room. */
544 if (!find_space(&yval, &xval, ysize + 2, xsize + 2))
546 /* Limit to the minimum room size, and retry */
555 /* Find and reserve some space in the dungeon. Get center of room. */
556 if (!find_space(&yval, &xval, ysize + 2, xsize + 2)) return FALSE;
559 /* Choose lite or dark */
560 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
563 /* Get corner values */
564 y1 = yval - ysize / 2;
565 x1 = xval - xsize / 2;
566 y2 = yval + (ysize - 1) / 2;
567 x2 = xval + (xsize - 1) / 2;
570 /* Place a full floor under the room */
571 for (y = y1 - 1; y <= y2 + 1; y++)
573 for (x = x1 - 1; x <= x2 + 1; x++)
576 place_floor_grid(c_ptr);
577 c_ptr->info |= (CAVE_ROOM);
578 if (light) c_ptr->info |= (CAVE_GLOW);
582 /* Walls around the room */
583 for (y = y1 - 1; y <= y2 + 1; y++)
585 c_ptr = &cave[y][x1 - 1];
586 place_outer_grid(c_ptr);
587 c_ptr = &cave[y][x2 + 1];
588 place_outer_grid(c_ptr);
590 for (x = x1 - 1; x <= x2 + 1; x++)
592 c_ptr = &cave[y1 - 1][x];
593 place_outer_grid(c_ptr);
594 c_ptr = &cave[y2 + 1][x];
595 place_outer_grid(c_ptr);
599 /* Hack -- Occasional curtained room */
600 if (curtain && (y2 - y1 > 2) && (x2 - x1 > 2))
602 for (y = y1; y <= y2; y++)
604 c_ptr = &cave[y][x1];
605 c_ptr->feat = feat_door[DOOR_CURTAIN].closed;
606 c_ptr->info &= ~(CAVE_MASK);
607 c_ptr = &cave[y][x2];
608 c_ptr->feat = feat_door[DOOR_CURTAIN].closed;
609 c_ptr->info &= ~(CAVE_MASK);
611 for (x = x1; x <= x2; x++)
613 c_ptr = &cave[y1][x];
614 c_ptr->feat = feat_door[DOOR_CURTAIN].closed;
615 c_ptr->info &= ~(CAVE_MASK);
616 c_ptr = &cave[y2][x];
617 c_ptr->feat = feat_door[DOOR_CURTAIN].closed;
618 c_ptr->info &= ~(CAVE_MASK);
623 /* Hack -- Occasional pillar room */
626 for (y = y1; y <= y2; y += 2)
628 for (x = x1; x <= x2; x += 2)
631 place_inner_grid(c_ptr);
636 /* Hack -- Occasional room with four pillars */
637 else if (one_in_(20))
639 if ((y1 + 4 < y2) && (x1 + 4 < x2))
641 c_ptr = &cave[y1 + 1][x1 + 1];
642 place_inner_grid(c_ptr);
644 c_ptr = &cave[y1 + 1][x2 - 1];
645 place_inner_grid(c_ptr);
647 c_ptr = &cave[y2 - 1][x1 + 1];
648 place_inner_grid(c_ptr);
650 c_ptr = &cave[y2 - 1][x2 - 1];
651 place_inner_grid(c_ptr);
655 /* Hack -- Occasional ragged-edge room */
656 else if (one_in_(50))
658 for (y = y1 + 2; y <= y2 - 2; y += 2)
660 c_ptr = &cave[y][x1];
661 place_inner_grid(c_ptr);
662 c_ptr = &cave[y][x2];
663 place_inner_grid(c_ptr);
665 for (x = x1 + 2; x <= x2 - 2; x += 2)
667 c_ptr = &cave[y1][x];
668 place_inner_grid(c_ptr);
669 c_ptr = &cave[y2][x];
670 place_inner_grid(c_ptr);
673 /* Hack -- Occasional divided room */
674 else if (one_in_(50))
676 bool curtain2 = (d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
677 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 2 : 128);
679 if (randint1(100) < 50)
681 /* Horizontal wall */
682 for (x = x1; x <= x2; x++)
684 place_inner_bold(yval, x);
685 if (curtain2) cave[yval][x].feat = feat_door[DOOR_CURTAIN].closed;
688 /* Prevent edge of wall from being tunneled */
689 place_solid_bold(yval, x1 - 1);
690 place_solid_bold(yval, x2 + 1);
695 for (y = y1; y <= y2; y++)
697 place_inner_bold(y, xval);
698 if (curtain2) cave[y][xval].feat = feat_door[DOOR_CURTAIN].closed;
701 /* Prevent edge of wall from being tunneled */
702 place_solid_bold(y1 - 1, xval);
703 place_solid_bold(y2 + 1, xval);
706 place_random_door(yval, xval, TRUE);
707 if (curtain2) cave[yval][xval].feat = feat_door[DOOR_CURTAIN].closed;
714 * @brief タイプ2の部屋…二重長方形の部屋を生成する / Type 2 -- Overlapping rectangular rooms
717 static bool build_type2(void)
719 int y, x, xval, yval;
720 int y1a, x1a, y2a, x2a;
721 int y1b, x1b, y2b, x2b;
725 /* Find and reserve some space in the dungeon. Get center of room. */
726 if (!find_space(&yval, &xval, 11, 25)) return FALSE;
728 /* Choose lite or dark */
729 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
731 /* Determine extents of the first room */
732 y1a = yval - randint1(4);
733 y2a = yval + randint1(3);
734 x1a = xval - randint1(11);
735 x2a = xval + randint1(10);
737 /* Determine extents of the second room */
738 y1b = yval - randint1(3);
739 y2b = yval + randint1(4);
740 x1b = xval - randint1(10);
741 x2b = xval + randint1(11);
744 /* Place a full floor for room "a" */
745 for (y = y1a - 1; y <= y2a + 1; y++)
747 for (x = x1a - 1; x <= x2a + 1; x++)
750 place_floor_grid(c_ptr);
751 c_ptr->info |= (CAVE_ROOM);
752 if (light) c_ptr->info |= (CAVE_GLOW);
756 /* Place a full floor for room "b" */
757 for (y = y1b - 1; y <= y2b + 1; y++)
759 for (x = x1b - 1; x <= x2b + 1; x++)
762 place_floor_grid(c_ptr);
763 c_ptr->info |= (CAVE_ROOM);
764 if (light) c_ptr->info |= (CAVE_GLOW);
769 /* Place the walls around room "a" */
770 for (y = y1a - 1; y <= y2a + 1; y++)
772 c_ptr = &cave[y][x1a - 1];
773 place_outer_grid(c_ptr);
774 c_ptr = &cave[y][x2a + 1];
775 place_outer_grid(c_ptr);
777 for (x = x1a - 1; x <= x2a + 1; x++)
779 c_ptr = &cave[y1a - 1][x];
780 place_outer_grid(c_ptr);
781 c_ptr = &cave[y2a + 1][x];
782 place_outer_grid(c_ptr);
785 /* Place the walls around room "b" */
786 for (y = y1b - 1; y <= y2b + 1; y++)
788 c_ptr = &cave[y][x1b - 1];
789 place_outer_grid(c_ptr);
790 c_ptr = &cave[y][x2b + 1];
791 place_outer_grid(c_ptr);
793 for (x = x1b - 1; x <= x2b + 1; x++)
795 c_ptr = &cave[y1b - 1][x];
796 place_outer_grid(c_ptr);
797 c_ptr = &cave[y2b + 1][x];
798 place_outer_grid(c_ptr);
803 /* Replace the floor for room "a" */
804 for (y = y1a; y <= y2a; y++)
806 for (x = x1a; x <= x2a; x++)
809 place_floor_grid(c_ptr);
813 /* Replace the floor for room "b" */
814 for (y = y1b; y <= y2b; y++)
816 for (x = x1b; x <= x2b; x++)
819 place_floor_grid(c_ptr);
829 * @brief タイプ2の部屋…十字型の部屋を生成する / Type 3 -- Cross shaped rooms
832 * Builds a room at a row, column coordinate\n
834 * Room "a" runs north/south, and Room "b" runs east/east\n
835 * So the "central pillar" runs from x1a, y1b to x2a, y2b.\n
837 * Note that currently, the "center" is always 3x3, but I think that\n
838 * the code below will work (with "bounds checking") for 5x5, or even\n
839 * for unsymetric values like 4x3 or 5x3 or 3x4 or 3x5, or even larger.\n
841 static bool build_type3(void)
843 int y, x, dy, dx, wy, wx;
844 int y1a, x1a, y2a, x2a;
845 int y1b, x1b, y2b, x2b;
851 /* Find and reserve some space in the dungeon. Get center of room. */
852 if (!find_space(&yval, &xval, 11, 25)) return FALSE;
855 /* Choose lite or dark */
856 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
858 /* For now, always 3x3 */
861 /* Pick max vertical size (at most 4) */
862 dy = rand_range(3, 4);
864 /* Pick max horizontal size (at most 15) */
865 dx = rand_range(3, 11);
868 /* Determine extents of the north/south room */
874 /* Determine extents of the east/west room */
881 /* Place a full floor for room "a" */
882 for (y = y1a - 1; y <= y2a + 1; y++)
884 for (x = x1a - 1; x <= x2a + 1; x++)
887 place_floor_grid(c_ptr);
888 c_ptr->info |= (CAVE_ROOM);
889 if (light) c_ptr->info |= (CAVE_GLOW);
893 /* Place a full floor for room "b" */
894 for (y = y1b - 1; y <= y2b + 1; y++)
896 for (x = x1b - 1; x <= x2b + 1; x++)
899 place_floor_grid(c_ptr);
900 c_ptr->info |= (CAVE_ROOM);
901 if (light) c_ptr->info |= (CAVE_GLOW);
906 /* Place the walls around room "a" */
907 for (y = y1a - 1; y <= y2a + 1; y++)
909 c_ptr = &cave[y][x1a - 1];
910 place_outer_grid(c_ptr);
911 c_ptr = &cave[y][x2a + 1];
912 place_outer_grid(c_ptr);
914 for (x = x1a - 1; x <= x2a + 1; x++)
916 c_ptr = &cave[y1a - 1][x];
917 place_outer_grid(c_ptr);
918 c_ptr = &cave[y2a + 1][x];
919 place_outer_grid(c_ptr);
922 /* Place the walls around room "b" */
923 for (y = y1b - 1; y <= y2b + 1; y++)
925 c_ptr = &cave[y][x1b - 1];
926 place_outer_grid(c_ptr);
927 c_ptr = &cave[y][x2b + 1];
928 place_outer_grid(c_ptr);
930 for (x = x1b - 1; x <= x2b + 1; x++)
932 c_ptr = &cave[y1b - 1][x];
933 place_outer_grid(c_ptr);
934 c_ptr = &cave[y2b + 1][x];
935 place_outer_grid(c_ptr);
939 /* Replace the floor for room "a" */
940 for (y = y1a; y <= y2a; y++)
942 for (x = x1a; x <= x2a; x++)
945 place_floor_grid(c_ptr);
949 /* Replace the floor for room "b" */
950 for (y = y1b; y <= y2b; y++)
952 for (x = x1b; x <= x2b; x++)
955 place_floor_grid(c_ptr);
961 /* Special features (3/4) */
964 /* Large solid middle pillar */
967 for (y = y1b; y <= y2b; y++)
969 for (x = x1a; x <= x2a; x++)
972 place_inner_grid(c_ptr);
978 /* Inner treasure vault */
981 /* Build the vault */
982 for (y = y1b; y <= y2b; y++)
984 c_ptr = &cave[y][x1a];
985 place_inner_grid(c_ptr);
986 c_ptr = &cave[y][x2a];
987 place_inner_grid(c_ptr);
989 for (x = x1a; x <= x2a; x++)
991 c_ptr = &cave[y1b][x];
992 place_inner_grid(c_ptr);
993 c_ptr = &cave[y2b][x];
994 place_inner_grid(c_ptr);
997 /* Place a secret door on the inner room */
1000 case 0: place_secret_door(y1b, xval, DOOR_DEFAULT); break;
1001 case 1: place_secret_door(y2b, xval, DOOR_DEFAULT); break;
1002 case 2: place_secret_door(yval, x1a, DOOR_DEFAULT); break;
1003 case 3: place_secret_door(yval, x2a, DOOR_DEFAULT); break;
1006 /* Place a treasure in the vault */
1007 place_object(yval, xval, 0L);
1009 /* Let's guard the treasure well */
1010 vault_monsters(yval, xval, randint0(2) + 3);
1012 /* Traps naturally */
1013 vault_traps(yval, xval, 4, 4, randint0(3) + 2);
1018 /* Something else */
1021 /* Occasionally pinch the center shut */
1024 /* Pinch the east/west sides */
1025 for (y = y1b; y <= y2b; y++)
1027 if (y == yval) continue;
1028 c_ptr = &cave[y][x1a - 1];
1029 place_inner_grid(c_ptr);
1030 c_ptr = &cave[y][x2a + 1];
1031 place_inner_grid(c_ptr);
1034 /* Pinch the north/south sides */
1035 for (x = x1a; x <= x2a; x++)
1037 if (x == xval) continue;
1038 c_ptr = &cave[y1b - 1][x];
1039 place_inner_grid(c_ptr);
1040 c_ptr = &cave[y2b + 1][x];
1041 place_inner_grid(c_ptr);
1044 /* Sometimes shut using secret doors */
1047 int door_type = ((d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
1048 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
1049 ((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
1051 place_secret_door(yval, x1a - 1, door_type);
1052 place_secret_door(yval, x2a + 1, door_type);
1053 place_secret_door(y1b - 1, xval, door_type);
1054 place_secret_door(y2b + 1, xval, door_type);
1058 /* Occasionally put a "plus" in the center */
1059 else if (one_in_(3))
1061 c_ptr = &cave[yval][xval];
1062 place_inner_grid(c_ptr);
1063 c_ptr = &cave[y1b][xval];
1064 place_inner_grid(c_ptr);
1065 c_ptr = &cave[y2b][xval];
1066 place_inner_grid(c_ptr);
1067 c_ptr = &cave[yval][x1a];
1068 place_inner_grid(c_ptr);
1069 c_ptr = &cave[yval][x2a];
1070 place_inner_grid(c_ptr);
1073 /* Occasionally put a pillar in the center */
1074 else if (one_in_(3))
1076 c_ptr = &cave[yval][xval];
1077 place_inner_grid(c_ptr);
1089 * @brief タイプ4の部屋…固定サイズの二重構造部屋を生成する / Type 4 -- Large room with inner features
1092 * Possible sub-types:\n
1093 * 1 - Just an inner room with one door\n
1094 * 2 - An inner room within an inner room\n
1095 * 3 - An inner room with pillar(s)\n
1096 * 4 - Inner room has a maze\n
1097 * 5 - A set of four inner rooms\n
1099 static bool build_type4(void)
1102 int y2, x2, tmp, yval, xval;
1107 /* Find and reserve some space in the dungeon. Get center of room. */
1108 if (!find_space(&yval, &xval, 11, 25)) return FALSE;
1110 /* Choose lite or dark */
1111 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
1119 /* Place a full floor under the room */
1120 for (y = y1 - 1; y <= y2 + 1; y++)
1122 for (x = x1 - 1; x <= x2 + 1; x++)
1124 c_ptr = &cave[y][x];
1125 place_floor_grid(c_ptr);
1126 c_ptr->info |= (CAVE_ROOM);
1127 if (light) c_ptr->info |= (CAVE_GLOW);
1132 for (y = y1 - 1; y <= y2 + 1; y++)
1134 c_ptr = &cave[y][x1 - 1];
1135 place_outer_grid(c_ptr);
1136 c_ptr = &cave[y][x2 + 1];
1137 place_outer_grid(c_ptr);
1139 for (x = x1 - 1; x <= x2 + 1; x++)
1141 c_ptr = &cave[y1 - 1][x];
1142 place_outer_grid(c_ptr);
1143 c_ptr = &cave[y2 + 1][x];
1144 place_outer_grid(c_ptr);
1148 /* The inner room */
1154 /* The inner walls */
1155 for (y = y1 - 1; y <= y2 + 1; y++)
1157 c_ptr = &cave[y][x1 - 1];
1158 place_inner_grid(c_ptr);
1159 c_ptr = &cave[y][x2 + 1];
1160 place_inner_grid(c_ptr);
1162 for (x = x1 - 1; x <= x2 + 1; x++)
1164 c_ptr = &cave[y1 - 1][x];
1165 place_inner_grid(c_ptr);
1166 c_ptr = &cave[y2 + 1][x];
1167 place_inner_grid(c_ptr);
1171 /* Inner room variations */
1172 switch (randint1(5))
1174 /* Just an inner room with a monster */
1177 /* Place a secret door */
1178 switch (randint1(4))
1180 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
1181 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
1182 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
1183 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
1186 /* Place a monster in the room */
1187 vault_monsters(yval, xval, 1);
1192 /* Treasure Vault (with a door) */
1195 /* Place a secret door */
1196 switch (randint1(4))
1198 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
1199 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
1200 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
1201 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
1204 /* Place another inner room */
1205 for (y = yval - 1; y <= yval + 1; y++)
1207 for (x = xval - 1; x <= xval + 1; x++)
1209 if ((x == xval) && (y == yval)) continue;
1210 c_ptr = &cave[y][x];
1211 place_inner_grid(c_ptr);
1215 /* Place a locked door on the inner room */
1216 switch (randint1(4))
1218 case 1: place_locked_door(yval - 1, xval); break;
1219 case 2: place_locked_door(yval + 1, xval); break;
1220 case 3: place_locked_door(yval, xval - 1); break;
1221 case 4: place_locked_door(yval, xval + 1); break;
1224 /* Monsters to guard the "treasure" */
1225 vault_monsters(yval, xval, randint1(3) + 2);
1228 if (randint0(100) < 80)
1230 place_object(yval, xval, 0L);
1236 place_random_stairs(yval, xval);
1239 /* Traps to protect the treasure */
1240 vault_traps(yval, xval, 4, 10, 2 + randint1(3));
1245 /* Inner pillar(s). */
1248 /* Place a secret door */
1249 switch (randint1(4))
1251 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
1252 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
1253 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
1254 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
1257 /* Large Inner Pillar */
1258 for (y = yval - 1; y <= yval + 1; y++)
1260 for (x = xval - 1; x <= xval + 1; x++)
1262 c_ptr = &cave[y][x];
1263 place_inner_grid(c_ptr);
1267 /* Occasionally, two more Large Inner Pillars */
1271 for (y = yval - 1; y <= yval + 1; y++)
1273 for (x = xval - 5 - tmp; x <= xval - 3 - tmp; x++)
1275 c_ptr = &cave[y][x];
1276 place_inner_grid(c_ptr);
1278 for (x = xval + 3 + tmp; x <= xval + 5 + tmp; x++)
1280 c_ptr = &cave[y][x];
1281 place_inner_grid(c_ptr);
1286 /* Occasionally, some Inner rooms */
1289 int door_type = ((d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
1290 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
1291 ((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
1293 /* Long horizontal walls */
1294 for (x = xval - 5; x <= xval + 5; x++)
1296 c_ptr = &cave[yval - 1][x];
1297 place_inner_grid(c_ptr);
1298 c_ptr = &cave[yval + 1][x];
1299 place_inner_grid(c_ptr);
1302 /* Close off the left/right edges */
1303 c_ptr = &cave[yval][xval - 5];
1304 place_inner_grid(c_ptr);
1305 c_ptr = &cave[yval][xval + 5];
1306 place_inner_grid(c_ptr);
1308 /* Secret doors (random top/bottom) */
1309 place_secret_door(yval - 3 + (randint1(2) * 2), xval - 3, door_type);
1310 place_secret_door(yval - 3 + (randint1(2) * 2), xval + 3, door_type);
1313 vault_monsters(yval, xval - 2, randint1(2));
1314 vault_monsters(yval, xval + 2, randint1(2));
1317 if (one_in_(3)) place_object(yval, xval - 2, 0L);
1318 if (one_in_(3)) place_object(yval, xval + 2, 0L);
1327 /* Place a secret door */
1328 switch (randint1(4))
1330 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
1331 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
1332 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
1333 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
1336 /* Maze (really a checkerboard) */
1337 for (y = y1; y <= y2; y++)
1339 for (x = x1; x <= x2; x++)
1343 c_ptr = &cave[y][x];
1344 place_inner_grid(c_ptr);
1349 /* Monsters just love mazes. */
1350 vault_monsters(yval, xval - 5, randint1(3));
1351 vault_monsters(yval, xval + 5, randint1(3));
1353 /* Traps make them entertaining. */
1354 vault_traps(yval, xval - 3, 2, 8, randint1(3));
1355 vault_traps(yval, xval + 3, 2, 8, randint1(3));
1357 /* Mazes should have some treasure too. */
1358 vault_objects(yval, xval, 3);
1363 /* Four small rooms. */
1366 int door_type = ((d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
1367 one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
1368 ((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
1371 for (y = y1; y <= y2; y++)
1373 c_ptr = &cave[y][xval];
1374 place_inner_grid(c_ptr);
1376 for (x = x1; x <= x2; x++)
1378 c_ptr = &cave[yval][x];
1379 place_inner_grid(c_ptr);
1382 /* Doors into the rooms */
1383 if (randint0(100) < 50)
1385 int i = randint1(10);
1386 place_secret_door(y1 - 1, xval - i, door_type);
1387 place_secret_door(y1 - 1, xval + i, door_type);
1388 place_secret_door(y2 + 1, xval - i, door_type);
1389 place_secret_door(y2 + 1, xval + i, door_type);
1393 int i = randint1(3);
1394 place_secret_door(yval + i, x1 - 1, door_type);
1395 place_secret_door(yval - i, x1 - 1, door_type);
1396 place_secret_door(yval + i, x2 + 1, door_type);
1397 place_secret_door(yval - i, x2 + 1, door_type);
1400 /* Treasure, centered at the center of the cross */
1401 vault_objects(yval, xval, 2 + randint1(2));
1403 /* Gotta have some monsters. */
1404 vault_monsters(yval + 1, xval - 4, randint1(4));
1405 vault_monsters(yval + 1, xval + 4, randint1(4));
1406 vault_monsters(yval - 1, xval - 4, randint1(4));
1407 vault_monsters(yval - 1, xval + 4, randint1(4));
1419 * vaultに配置可能なモンスターの条件を指定するマクロ / Monster validation macro
1421 * Line 1 -- forbid town monsters
1422 * Line 2 -- forbid uniques
1423 * Line 3 -- forbid aquatic monsters
1425 #define vault_monster_okay(I) \
1426 (mon_hook_dungeon(I) && \
1427 !(r_info[I].flags1 & RF1_UNIQUE) && \
1428 !(r_info[I].flags7 & RF7_UNIQUE2) && \
1429 !(r_info[I].flagsr & RFR_RES_ALL) && \
1430 !(r_info[I].flags7 & RF7_AQUATIC))
1433 /*! 通常pit生成時のモンスターの構成条件ID / Race index for "monster pit (clone)" */
1434 static int vault_aux_race;
1436 /*! 単一シンボルpit生成時の指定シンボル / Race index for "monster pit (symbol clone)" */
1437 static char vault_aux_char;
1439 /*! ブレス属性に基づくドラゴンpit生成時条件マスク / Breath mask for "monster pit (dragon)" */
1440 static u32b vault_aux_dragon_mask4;
1444 * @brief モンスターがVault生成の最低必要条件を満たしているかを返す /
1445 * Helper monster selection function
1446 * @param r_idx 確認したいモンスター種族ID
1447 * @return Vault生成の最低必要条件を満たしているならTRUEを返す。
1449 static bool vault_aux_simple(int r_idx)
1452 return (vault_monster_okay(r_idx));
1457 * @brief モンスターがゼリーnestの生成必要条件を満たしているかを返す /
1458 * Helper function for "monster nest (jelly)"
1459 * @param r_idx 確認したいモンスター種族ID
1460 * @return 生成必要条件を満たしているならTRUEを返す。
1462 static bool vault_aux_jelly(int r_idx)
1464 monster_race *r_ptr = &r_info[r_idx];
1466 /* Validate the monster */
1467 if (!vault_monster_okay(r_idx)) return (FALSE);
1469 if ((r_ptr->flags2 & RF2_KILL_BODY) && !(r_ptr->flags1 & RF1_NEVER_BLOW)) return (FALSE);
1471 /* Also decline evil jellies (like death molds and shoggoths) */
1472 if (r_ptr->flags3 & (RF3_EVIL)) return (FALSE);
1474 /* Require icky thing, jelly, mold, or mushroom */
1475 if (!my_strchr("ijm,", r_ptr->d_char)) return (FALSE);
1482 * @brief モンスターが動物nestの生成必要条件を満たしているかを返す /
1483 * Helper function for "monster nest (animal)"
1484 * @param r_idx 確認したいモンスター種族ID
1485 * @return 生成必要条件を満たしているならTRUEを返す。
1487 static bool vault_aux_animal(int r_idx)
1489 monster_race *r_ptr = &r_info[r_idx];
1491 /* Validate the monster */
1492 if (!vault_monster_okay(r_idx)) return (FALSE);
1494 /* Require "animal" flag */
1495 if (!(r_ptr->flags3 & (RF3_ANIMAL))) return (FALSE);
1503 * @brief モンスターがアンデッドnestの生成必要条件を満たしているかを返す /
1504 * Helper function for "monster nest (undead)"
1505 * @param r_idx 確認したいモンスター種族ID
1506 * @return 生成必要条件を満たしているならTRUEを返す。
1508 static bool vault_aux_undead(int r_idx)
1510 monster_race *r_ptr = &r_info[r_idx];
1512 /* Validate the monster */
1513 if (!vault_monster_okay(r_idx)) return (FALSE);
1515 /* Require Undead */
1516 if (!(r_ptr->flags3 & (RF3_UNDEAD))) return (FALSE);
1523 * @brief モンスターが聖堂nestの生成必要条件を満たしているかを返す /
1524 * Helper function for "monster nest (chapel)"
1525 * @param r_idx 確認したいモンスター種族ID
1526 * @return 生成必要条件を満たしているならTRUEを返す。
1528 static bool vault_aux_chapel_g(int r_idx)
1530 static int chapel_list[] = {
1531 MON_NOV_PRIEST, MON_NOV_PALADIN, MON_NOV_PRIEST_G, MON_NOV_PALADIN_G,
1532 MON_PRIEST, MON_JADE_MONK, MON_IVORY_MONK, MON_ULTRA_PALADIN,
1533 MON_EBONY_MONK, MON_W_KNIGHT, MON_KNI_TEMPLAR, MON_PALADIN,
1538 monster_race *r_ptr = &r_info[r_idx];
1540 /* Validate the monster */
1541 if (!vault_monster_okay(r_idx)) return (FALSE);
1543 if (r_ptr->flags3 & (RF3_EVIL)) return (FALSE);
1544 if ((r_idx == MON_A_GOLD) || (r_idx == MON_A_SILVER)) return (FALSE);
1546 /* Require "priest" or Angel */
1548 if (r_ptr->d_char == 'A') return TRUE;
1550 for (i = 0; chapel_list[i]; i++)
1551 if (r_idx == chapel_list[i]) return TRUE;
1557 * @brief モンスターが犬小屋nestの生成必要条件を満たしているかを返す /
1558 * Helper function for "monster nest (kennel)"
1559 * @param r_idx 確認したいモンスター種族ID
1560 * @return 生成必要条件を満たしているならTRUEを返す。
1562 static bool vault_aux_kennel(int r_idx)
1564 monster_race *r_ptr = &r_info[r_idx];
1566 /* Validate the monster */
1567 if (!vault_monster_okay(r_idx)) return (FALSE);
1569 /* Require a Zephyr Hound or a dog */
1570 if (!my_strchr("CZ", r_ptr->d_char)) return (FALSE);
1577 * @brief モンスターがミミックnestの生成必要条件を満たしているかを返す /
1578 * Helper function for "monster nest (mimic)"
1579 * @param r_idx 確認したいモンスター種族ID
1580 * @return 生成必要条件を満たしているならTRUEを返す。
1582 static bool vault_aux_mimic(int r_idx)
1584 monster_race *r_ptr = &r_info[r_idx];
1586 /* Validate the monster */
1587 if (!vault_monster_okay(r_idx)) return (FALSE);
1590 if (!my_strchr("!$&(/=?[\\|", r_ptr->d_char)) return (FALSE);
1597 * @brief モンスターが単一クローンnestの生成必要条件を満たしているかを返す /
1598 * Helper function for "monster nest (clone)"
1599 * @param r_idx 確認したいモンスター種族ID
1600 * @return 生成必要条件を満たしているならTRUEを返す。
1602 static bool vault_aux_clone(int r_idx)
1604 /* Validate the monster */
1605 if (!vault_monster_okay(r_idx)) return (FALSE);
1607 return (r_idx == vault_aux_race);
1612 * @brief モンスターが邪悪属性シンボルクローンnestの生成必要条件を満たしているかを返す /
1613 * Helper function for "monster nest (symbol clone)"
1614 * @param r_idx 確認したいモンスター種族ID
1615 * @return 生成必要条件を満たしているならTRUEを返す。
1617 static bool vault_aux_symbol_e(int r_idx)
1619 monster_race *r_ptr = &r_info[r_idx];
1621 /* Validate the monster */
1622 if (!vault_monster_okay(r_idx)) return (FALSE);
1624 if ((r_ptr->flags2 & RF2_KILL_BODY) && !(r_ptr->flags1 & RF1_NEVER_BLOW)) return (FALSE);
1626 if (r_ptr->flags3 & (RF3_GOOD)) return (FALSE);
1628 /* Decline incorrect symbol */
1629 if (r_ptr->d_char != vault_aux_char) return (FALSE);
1637 * @brief モンスターが善良属性シンボルクローンnestの生成必要条件を満たしているかを返す /
1638 * Helper function for "monster nest (symbol clone)"
1639 * @param r_idx 確認したいモンスター種族ID
1640 * @return 生成必要条件を満たしているならTRUEを返す。
1642 static bool vault_aux_symbol_g(int r_idx)
1644 monster_race *r_ptr = &r_info[r_idx];
1646 /* Validate the monster */
1647 if (!vault_monster_okay(r_idx)) return (FALSE);
1649 if ((r_ptr->flags2 & RF2_KILL_BODY) && !(r_ptr->flags1 & RF1_NEVER_BLOW)) return (FALSE);
1651 if (r_ptr->flags3 & (RF3_EVIL)) return (FALSE);
1653 /* Decline incorrect symbol */
1654 if (r_ptr->d_char != vault_aux_char) return (FALSE);
1662 * @brief モンスターがオークpitの生成必要条件を満たしているかを返す /
1663 * Helper function for "monster pit (orc)"
1664 * @param r_idx 確認したいモンスター種族ID
1665 * @return 生成必要条件を満たしているならTRUEを返す。
1667 static bool vault_aux_orc(int r_idx)
1669 monster_race *r_ptr = &r_info[r_idx];
1671 /* Validate the monster */
1672 if (!vault_monster_okay(r_idx)) return (FALSE);
1675 if (!(r_ptr->flags3 & RF3_ORC)) return (FALSE);
1677 /* Decline undead */
1678 if (r_ptr->flags3 & RF3_UNDEAD) return (FALSE);
1686 * @brief モンスターがトロルpitの生成必要条件を満たしているかを返す /
1687 * Helper function for "monster pit (troll)"
1688 * @param r_idx 確認したいモンスター種族ID
1689 * @return 生成必要条件を満たしているならTRUEを返す。
1691 static bool vault_aux_troll(int r_idx)
1693 monster_race *r_ptr = &r_info[r_idx];
1695 /* Validate the monster */
1696 if (!vault_monster_okay(r_idx)) return (FALSE);
1699 if (!(r_ptr->flags3 & RF3_TROLL)) return (FALSE);
1701 /* Decline undead */
1702 if (r_ptr->flags3 & RF3_UNDEAD) return (FALSE);
1710 * @brief モンスターが巨人pitの生成必要条件を満たしているかを返す /
1711 * Helper function for "monster pit (giant)"
1712 * @param r_idx 確認したいモンスター種族ID
1713 * @return 生成必要条件を満たしているならTRUEを返す。
1715 static bool vault_aux_giant(int r_idx)
1717 monster_race *r_ptr = &r_info[r_idx];
1719 /* Validate the monster */
1720 if (!vault_monster_okay(r_idx)) return (FALSE);
1723 if (!(r_ptr->flags3 & RF3_GIANT)) return (FALSE);
1725 if (r_ptr->flags3 & RF3_GOOD) return (FALSE);
1727 /* Decline undead */
1728 if (r_ptr->flags3 & RF3_UNDEAD) return (FALSE);
1736 * @brief モンスターがドラゴンpitの生成必要条件を満たしているかを返す /
1737 * Helper function for "monster pit (dragon)"
1738 * @param r_idx 確認したいモンスター種族ID
1739 * @return 生成必要条件を満たしているならTRUEを返す。
1741 static bool vault_aux_dragon(int r_idx)
1743 monster_race *r_ptr = &r_info[r_idx];
1745 /* Validate the monster */
1746 if (!vault_monster_okay(r_idx)) return (FALSE);
1748 /* Require dragon */
1749 if (!(r_ptr->flags3 & RF3_DRAGON)) return (FALSE);
1751 /* Hack -- Require correct "breath attack" */
1752 if (r_ptr->flags4 != vault_aux_dragon_mask4) return (FALSE);
1754 /* Decline undead */
1755 if (r_ptr->flags3 & RF3_UNDEAD) return (FALSE);
1763 * @brief モンスターが悪魔pitの生成必要条件を満たしているかを返す /
1764 * Helper function for "monster pit (demon)"
1765 * @param r_idx 確認したいモンスター種族ID
1766 * @return 生成必要条件を満たしているならTRUEを返す。
1768 static bool vault_aux_demon(int r_idx)
1770 monster_race *r_ptr = &r_info[r_idx];
1772 /* Validate the monster */
1773 if (!vault_monster_okay(r_idx)) return (FALSE);
1775 if ((r_ptr->flags2 & RF2_KILL_BODY) && !(r_ptr->flags1 & RF1_NEVER_BLOW)) return (FALSE);
1778 if (!(r_ptr->flags3 & RF3_DEMON)) return (FALSE);
1786 * @brief モンスターが狂気pitの生成必要条件を満たしているかを返す /
1787 * Helper function for "monster pit (lovecraftian)"
1788 * @param r_idx 確認したいモンスター種族ID
1789 * @return 生成必要条件を満たしているならTRUEを返す。
1791 static bool vault_aux_cthulhu(int r_idx)
1793 monster_race *r_ptr = &r_info[r_idx];
1795 /* Validate the monster */
1796 if (!vault_monster_okay(r_idx)) return (FALSE);
1798 if ((r_ptr->flags2 & RF2_KILL_BODY) && !(r_ptr->flags1 & RF1_NEVER_BLOW)) return (FALSE);
1800 /* Require eldritch horror */
1801 if (!(r_ptr->flags2 & (RF2_ELDRITCH_HORROR))) return (FALSE);
1809 * @brief pit/nestの基準となる単種モンスターを決める /
1812 static void vault_prep_clone(void)
1814 /* Apply the monster restriction */
1815 get_mon_num_prep(vault_aux_simple, NULL);
1817 /* Pick a race to clone */
1818 vault_aux_race = get_mon_num(dun_level + 10);
1820 /* Remove the monster restriction */
1821 get_mon_num_prep(NULL, NULL);
1826 * @brief pit/nestの基準となるモンスターシンボルを決める /
1829 static void vault_prep_symbol(void)
1833 /* Apply the monster restriction */
1834 get_mon_num_prep(vault_aux_simple, NULL);
1836 /* Pick a race to clone */
1837 r_idx = get_mon_num(dun_level + 10);
1839 /* Remove the monster restriction */
1840 get_mon_num_prep(NULL, NULL);
1842 /* Extract the symbol */
1843 vault_aux_char = r_info[r_idx].d_char;
1847 * @brief pit/nestの基準となるドラゴンの種類を決める /
1850 static void vault_prep_dragon(void)
1852 /* Pick dragon type */
1853 switch (randint0(6))
1858 /* Restrict dragon breath type */
1859 vault_aux_dragon_mask4 = RF4_BR_ACID;
1868 /* Restrict dragon breath type */
1869 vault_aux_dragon_mask4 = RF4_BR_ELEC;
1878 /* Restrict dragon breath type */
1879 vault_aux_dragon_mask4 = RF4_BR_FIRE;
1888 /* Restrict dragon breath type */
1889 vault_aux_dragon_mask4 = RF4_BR_COLD;
1898 /* Restrict dragon breath type */
1899 vault_aux_dragon_mask4 = RF4_BR_POIS;
1908 /* Restrict dragon breath type */
1909 vault_aux_dragon_mask4 = (RF4_BR_ACID | RF4_BR_ELEC |
1910 RF4_BR_FIRE | RF4_BR_COLD |
1921 * @brief モンスターがダークエルフpitの生成必要条件を満たしているかを返す /
1922 * Helper function for "monster pit (dark elf)"
1923 * @param r_idx 確認したいモンスター種族ID
1924 * @return 生成必要条件を満たしているならTRUEを返す。
1926 static bool vault_aux_dark_elf(int r_idx)
1929 static int dark_elf_list[] =
1931 MON_D_ELF, MON_D_ELF_MAGE, MON_D_ELF_WARRIOR, MON_D_ELF_PRIEST,
1932 MON_D_ELF_LORD, MON_D_ELF_WARLOCK, MON_D_ELF_DRUID, MON_NIGHTBLADE,
1933 MON_D_ELF_SORC, MON_D_ELF_SHADE, 0,
1936 /* Validate the monster */
1937 if (!vault_monster_okay(r_idx)) return FALSE;
1939 /* Require dark elves */
1940 for (i = 0; dark_elf_list[i]; i++)
1941 if (r_idx == dark_elf_list[i]) return TRUE;
1947 /*! pit/nest型情報のtypedef */
1948 typedef struct vault_aux_type vault_aux_type;
1950 /*! pit/nest型情報の構造体定義 */
1951 struct vault_aux_type
1954 bool (*hook_func)(int r_idx);
1955 void (*prep_func)(void);
1961 * @brief ダンジョン毎に指定されたピット配列を基準にランダムなpit/nestタイプを決める
1962 * @param l_ptr 選択されたpit/nest情報を返す参照ポインタ
1963 * @param allow_flag_mask 生成が許されるpit/nestのビット配列
1964 * @return 選択されたpit/nestのID、選択失敗した場合-1を返す。
1966 static int pick_vault_type(vault_aux_type *l_ptr, s16b allow_flag_mask)
1968 int tmp, total, count;
1970 vault_aux_type *n_ptr;
1972 /* Calculate the total possibilities */
1973 for (n_ptr = l_ptr, total = 0, count = 0; TRUE; n_ptr++, count++)
1976 if (!n_ptr->name) break;
1978 /* Ignore excessive depth */
1979 if (n_ptr->level > dun_level) continue;
1981 /* Not matched with pit/nest flag */
1982 if (!(allow_flag_mask & (1L << count))) continue;
1984 /* Count this possibility */
1985 total += n_ptr->chance * MAX_DEPTH / (MIN(dun_level, MAX_DEPTH - 1) - n_ptr->level + 5);
1988 /* Pick a random type */
1989 tmp = randint0(total);
1991 /* Find this type */
1992 for (n_ptr = l_ptr, total = 0, count = 0; TRUE; n_ptr++, count++)
1995 if (!n_ptr->name) break;
1997 /* Ignore excessive depth */
1998 if (n_ptr->level > dun_level) continue;
2000 /* Not matched with pit/nest flag */
2001 if (!(allow_flag_mask & (1L << count))) continue;
2003 /* Count this possibility */
2004 total += n_ptr->chance * MAX_DEPTH / (MIN(dun_level, MAX_DEPTH - 1) - n_ptr->level + 5);
2006 /* Found the type */
2007 if (tmp < total) break;
2010 return n_ptr->name ? count : -1;
2014 static vault_aux_type nest_types[] =
2017 {"クローン", vault_aux_clone, vault_prep_clone, 5, 3},
2018 {"ゼリー", vault_aux_jelly, NULL, 5, 6},
2019 {"シンボル(善)", vault_aux_symbol_g, vault_prep_symbol, 25, 2},
2020 {"シンボル(悪)", vault_aux_symbol_e, vault_prep_symbol, 25, 2},
2021 {"ミミック", vault_aux_mimic, NULL, 30, 4},
2022 {"狂気", vault_aux_cthulhu, NULL, 70, 2},
2023 {"犬小屋", vault_aux_kennel, NULL, 45, 4},
2024 {"動物園", vault_aux_animal, NULL, 35, 5},
2025 {"教会", vault_aux_chapel_g, NULL, 75, 4},
2026 {"アンデッド", vault_aux_undead, NULL, 75, 5},
2027 {NULL, NULL, NULL, 0, 0},
2029 {"clone", vault_aux_clone, vault_prep_clone, 5, 3},
2030 {"jelly", vault_aux_jelly, NULL, 5, 6},
2031 {"symbol good", vault_aux_symbol_g, vault_prep_symbol, 25, 2},
2032 {"symbol evil", vault_aux_symbol_e, vault_prep_symbol, 25, 2},
2033 {"mimic", vault_aux_mimic, NULL, 30, 4},
2034 {"lovecraftian", vault_aux_cthulhu, NULL, 70, 2},
2035 {"kennel", vault_aux_kennel, NULL, 45, 4},
2036 {"animal", vault_aux_animal, NULL, 35, 5},
2037 {"chapel", vault_aux_chapel_g, NULL, 75, 4},
2038 {"undead", vault_aux_undead, NULL, 75, 5},
2039 {NULL, NULL, NULL, 0, 0},
2044 static vault_aux_type pit_types[] =
2047 {"オーク", vault_aux_orc, NULL, 5, 6},
2048 {"トロル", vault_aux_troll, NULL, 20, 6},
2049 {"ジャイアント", vault_aux_giant, NULL, 50, 6},
2050 {"狂気", vault_aux_cthulhu, NULL, 80, 2},
2051 {"シンボル(善)", vault_aux_symbol_g, vault_prep_symbol, 70, 1},
2052 {"シンボル(悪)", vault_aux_symbol_e, vault_prep_symbol, 70, 1},
2053 {"教会", vault_aux_chapel_g, NULL, 65, 2},
2054 {"ドラゴン", vault_aux_dragon, vault_prep_dragon, 70, 6},
2055 {"デーモン", vault_aux_demon, NULL, 80, 6},
2056 {"ダークエルフ", vault_aux_dark_elf, NULL, 45, 4},
2057 {NULL, NULL, NULL, 0, 0},
2059 {"orc", vault_aux_orc, NULL, 5, 6},
2060 {"troll", vault_aux_troll, NULL, 20, 6},
2061 {"giant", vault_aux_giant, NULL, 50, 6},
2062 {"lovecraftian", vault_aux_cthulhu, NULL, 80, 2},
2063 {"symbol good", vault_aux_symbol_g, vault_prep_symbol, 70, 1},
2064 {"symbol evil", vault_aux_symbol_e, vault_prep_symbol, 70, 1},
2065 {"chapel", vault_aux_chapel_g, NULL, 65, 2},
2066 {"dragon", vault_aux_dragon, vault_prep_dragon, 70, 6},
2067 {"demon", vault_aux_demon, NULL, 80, 6},
2068 {"dark elf", vault_aux_dark_elf, NULL, 45, 4},
2069 {NULL, NULL, NULL, 0, 0},
2074 /*! nestのID定義 / Nest types code */
2075 #define NEST_TYPE_CLONE 0
2076 #define NEST_TYPE_JELLY 1
2077 #define NEST_TYPE_SYMBOL_GOOD 2
2078 #define NEST_TYPE_SYMBOL_EVIL 3
2079 #define NEST_TYPE_MIMIC 4
2080 #define NEST_TYPE_LOVECRAFTIAN 5
2081 #define NEST_TYPE_KENNEL 6
2082 #define NEST_TYPE_ANIMAL 7
2083 #define NEST_TYPE_CHAPEL 8
2084 #define NEST_TYPE_UNDEAD 9
2086 /*! pitのID定義 / Pit types code */
2087 #define PIT_TYPE_ORC 0
2088 #define PIT_TYPE_TROLL 1
2089 #define PIT_TYPE_GIANT 2
2090 #define PIT_TYPE_LOVECRAFTIAN 3
2091 #define PIT_TYPE_SYMBOL_GOOD 4
2092 #define PIT_TYPE_SYMBOL_EVIL 5
2093 #define PIT_TYPE_CHAPEL 6
2094 #define PIT_TYPE_DRAGON 7
2095 #define PIT_TYPE_DEMON 8
2096 #define PIT_TYPE_DARK_ELF 9
2100 * @brief デバッグ時に生成されたpit/nestの型を出力する処理
2101 * @param type pit/nestの型ID
2102 * @param nest TRUEならばnest、FALSEならばpit
2103 * @return デバッグ表示文字列の参照ポインタ
2105 * Hack -- Get the string describing subtype of pit/nest
2106 * Determined in prepare function (some pit/nest only)
2108 static cptr pit_subtype_string(int type, bool nest)
2110 static char inner_buf[256] = "";
2112 inner_buf[0] = '\0'; /* Init string */
2114 if (nest) /* Nests */
2118 case NEST_TYPE_CLONE:
2119 sprintf(inner_buf, "(%s)", r_name + r_info[vault_aux_race].name);
2121 case NEST_TYPE_SYMBOL_GOOD:
2122 case NEST_TYPE_SYMBOL_EVIL:
2123 sprintf(inner_buf, "(%c)", vault_aux_char);
2131 case PIT_TYPE_SYMBOL_GOOD:
2132 case PIT_TYPE_SYMBOL_EVIL:
2133 sprintf(inner_buf, "(%c)", vault_aux_char);
2135 case PIT_TYPE_DRAGON:
2136 switch (vault_aux_dragon_mask4)
2139 case RF4_BR_ACID: strcpy(inner_buf, "(酸)"); break;
2140 case RF4_BR_ELEC: strcpy(inner_buf, "(稲妻)"); break;
2141 case RF4_BR_FIRE: strcpy(inner_buf, "(火炎)"); break;
2142 case RF4_BR_COLD: strcpy(inner_buf, "(冷気)"); break;
2143 case RF4_BR_POIS: strcpy(inner_buf, "(毒)"); break;
2144 case (RF4_BR_ACID | RF4_BR_ELEC | RF4_BR_FIRE | RF4_BR_COLD | RF4_BR_POIS):
2145 strcpy(inner_buf, "(万色)"); break;
2146 default: strcpy(inner_buf, "(未定義)"); break;
2148 case RF4_BR_ACID: strcpy(inner_buf, "(acid)"); break;
2149 case RF4_BR_ELEC: strcpy(inner_buf, "(lightning)"); break;
2150 case RF4_BR_FIRE: strcpy(inner_buf, "(fire)"); break;
2151 case RF4_BR_COLD: strcpy(inner_buf, "(frost)"); break;
2152 case RF4_BR_POIS: strcpy(inner_buf, "(poison)"); break;
2153 case (RF4_BR_ACID | RF4_BR_ELEC | RF4_BR_FIRE | RF4_BR_COLD | RF4_BR_POIS):
2154 strcpy(inner_buf, "(multi-hued)"); break;
2155 default: strcpy(inner_buf, "(undefined)"); break;
2166 /*! デバッグ時にnestのモンスター情報を確認するための構造体 / A struct for nest monster information with cheat_hear */
2176 *! @brief nestのモンスターリストをソートするための関数 /
2177 * Comp function for sorting nest monster information
2178 * @param u ソート処理対象配列ポインタ
2180 * @param a 比較対象参照ID1
2181 * @param b 比較対象参照ID2
2183 static bool ang_sort_comp_nest_mon_info(vptr u, vptr v, int a, int b)
2185 nest_mon_info_type *nest_mon_info = (nest_mon_info_type *)u;
2186 int w1 = nest_mon_info[a].r_idx;
2187 int w2 = nest_mon_info[b].r_idx;
2188 monster_race *r1_ptr = &r_info[w1];
2189 monster_race *r2_ptr = &r_info[w2];
2195 /* Extract used info */
2196 z1 = nest_mon_info[a].used;
2197 z2 = nest_mon_info[b].used;
2199 /* Compare used status */
2200 if (z1 < z2) return FALSE;
2201 if (z1 > z2) return TRUE;
2203 /* Compare levels */
2204 if (r1_ptr->level < r2_ptr->level) return TRUE;
2205 if (r1_ptr->level > r2_ptr->level) return FALSE;
2207 /* Compare experience */
2208 if (r1_ptr->mexp < r2_ptr->mexp) return TRUE;
2209 if (r1_ptr->mexp > r2_ptr->mexp) return FALSE;
2211 /* Compare indexes */
2216 * @brief nestのモンスターリストをスワップするための関数 /
2217 * Swap function for sorting nest monster information
2218 * @param u スワップ処理対象配列ポインタ
2220 * @param a スワップ対象参照ID1
2221 * @param b スワップ対象参照ID2
2223 static void ang_sort_swap_nest_mon_info(vptr u, vptr v, int a, int b)
2225 nest_mon_info_type *nest_mon_info = (nest_mon_info_type *)u;
2226 nest_mon_info_type holder;
2232 holder = nest_mon_info[a];
2233 nest_mon_info[a] = nest_mon_info[b];
2234 nest_mon_info[b] = holder;
2238 #define NUM_NEST_MON_TYPE 64 /*!<nestの種別数 */
2242 * @brief タイプ5の部屋…nestを生成する / Type 5 -- Monster nests
2245 * A monster nest is a "big" room, with an "inner" room, containing\n
2246 * a "collection" of monsters of a given type strewn about the room.\n
2248 * The monsters are chosen from a set of 64 randomly selected monster\n
2249 * races, to allow the nest creation to fail instead of having "holes".\n
2251 * Note the use of the "get_mon_num_prep()" function, and the special\n
2252 * "get_mon_num_hook()" restriction function, to prepare the "monster\n
2253 * allocation table" in such a way as to optimize the selection of\n
2254 * "appropriate" non-unique monsters for the nest.\n
2256 * Note that the "get_mon_num()" function may (rarely) fail, in which\n
2257 * case the nest will be empty.\n
2259 * Note that "monster nests" will never contain "unique" monsters.\n
2261 static bool build_type5(void)
2263 int y, x, y1, x1, y2, x2, xval, yval;
2265 nest_mon_info_type nest_mon_info[NUM_NEST_MON_TYPE];
2271 int cur_nest_type = pick_vault_type(nest_types, d_info[dungeon_type].nest);
2272 vault_aux_type *n_ptr;
2274 /* No type available */
2275 if (cur_nest_type < 0) return FALSE;
2277 n_ptr = &nest_types[cur_nest_type];
2279 /* Process a preparation function if necessary */
2280 if (n_ptr->prep_func) (*(n_ptr->prep_func))();
2282 /* Prepare allocation table */
2283 get_mon_num_prep(n_ptr->hook_func, NULL);
2285 align.sub_align = SUB_ALIGN_NEUTRAL;
2287 /* Pick some monster types */
2288 for (i = 0; i < NUM_NEST_MON_TYPE; i++)
2290 int r_idx = 0, attempts = 100;
2291 monster_race *r_ptr = NULL;
2295 /* Get a (hard) monster type */
2296 r_idx = get_mon_num(dun_level + 11);
2297 r_ptr = &r_info[r_idx];
2299 /* Decline incorrect alignment */
2300 if (monster_has_hostile_align(&align, 0, 0, r_ptr)) continue;
2302 /* Accept this monster */
2306 /* Notice failure */
2307 if (!r_idx || !attempts) return FALSE;
2309 /* Note the alignment */
2310 if (r_ptr->flags3 & RF3_EVIL) align.sub_align |= SUB_ALIGN_EVIL;
2311 if (r_ptr->flags3 & RF3_GOOD) align.sub_align |= SUB_ALIGN_GOOD;
2313 nest_mon_info[i].r_idx = r_idx;
2314 nest_mon_info[i].used = FALSE;
2317 /* Find and reserve some space in the dungeon. Get center of room. */
2318 if (!find_space(&yval, &xval, 11, 25)) return FALSE;
2326 /* Place the floor area */
2327 for (y = y1 - 1; y <= y2 + 1; y++)
2329 for (x = x1 - 1; x <= x2 + 1; x++)
2331 c_ptr = &cave[y][x];
2332 place_floor_grid(c_ptr);
2333 c_ptr->info |= (CAVE_ROOM);
2337 /* Place the outer walls */
2338 for (y = y1 - 1; y <= y2 + 1; y++)
2340 c_ptr = &cave[y][x1 - 1];
2341 place_outer_grid(c_ptr);
2342 c_ptr = &cave[y][x2 + 1];
2343 place_outer_grid(c_ptr);
2345 for (x = x1 - 1; x <= x2 + 1; x++)
2347 c_ptr = &cave[y1 - 1][x];
2348 place_outer_grid(c_ptr);
2349 c_ptr = &cave[y2 + 1][x];
2350 place_outer_grid(c_ptr);
2354 /* Advance to the center room */
2360 /* The inner walls */
2361 for (y = y1 - 1; y <= y2 + 1; y++)
2363 c_ptr = &cave[y][x1 - 1];
2364 place_inner_grid(c_ptr);
2365 c_ptr = &cave[y][x2 + 1];
2366 place_inner_grid(c_ptr);
2369 for (x = x1 - 1; x <= x2 + 1; x++)
2371 c_ptr = &cave[y1 - 1][x];
2372 place_inner_grid(c_ptr);
2373 c_ptr = &cave[y2 + 1][x];
2374 place_inner_grid(c_ptr);
2376 for (y = y1; y <= y2; y++)
2378 for (x = x1; x <= x2; x++)
2380 add_cave_info(y, x, CAVE_ICKY);
2384 /* Place a secret door */
2385 switch (randint1(4))
2387 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
2388 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
2389 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
2390 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
2393 msg_format_wizard(CHEAT_DUNGEON, _("モンスター部屋(nest)(%s%s)を生成します。", "Monster nest (%s%s)"), n_ptr->name, pit_subtype_string(cur_nest_type, TRUE));
2395 /* Place some monsters */
2396 for (y = yval - 2; y <= yval + 2; y++)
2398 for (x = xval - 9; x <= xval + 9; x++)
2402 i = randint0(NUM_NEST_MON_TYPE);
2403 r_idx = nest_mon_info[i].r_idx;
2405 /* Place that "random" monster (no groups) */
2406 (void)place_monster_aux(0, y, x, r_idx, 0L);
2408 nest_mon_info[i].used = TRUE;
2414 ang_sort_comp = ang_sort_comp_nest_mon_info;
2415 ang_sort_swap = ang_sort_swap_nest_mon_info;
2416 ang_sort(nest_mon_info, NULL, NUM_NEST_MON_TYPE);
2418 /* Dump the entries (prevent multi-printing) */
2419 for (i = 0; i < NUM_NEST_MON_TYPE; i++)
2421 if (!nest_mon_info[i].used) break;
2422 for (; i < NUM_NEST_MON_TYPE - 1; i++)
2424 if (nest_mon_info[i].r_idx != nest_mon_info[i + 1].r_idx) break;
2425 if (!nest_mon_info[i + 1].used) break;
2427 msg_format_wizard(CHEAT_DUNGEON, "Nest構成モンスターNo.%d:%s", i, r_name + r_info[nest_mon_info[i].r_idx].name);
2436 * @brief タイプ6の部屋…pitを生成する / Type 6 -- Monster pits
2439 * A monster pit is a "big" room, with an "inner" room, containing\n
2440 * a "collection" of monsters of a given type organized in the room.\n
2442 * The inside room in a monster pit appears as shown below, where the\n
2443 * actual monsters in each location depend on the type of the pit\n
2445 * XXXXXXXXXXXXXXXXXXXXX\n
2446 * X0000000000000000000X\n
2447 * X0112233455543322110X\n
2448 * X0112233467643322110X\n
2449 * X0112233455543322110X\n
2450 * X0000000000000000000X\n
2451 * XXXXXXXXXXXXXXXXXXXXX\n
2453 * Note that the monsters in the pit are now chosen by using "get_mon_num()"\n
2454 * to request 16 "appropriate" monsters, sorting them by level, and using\n
2455 * the "even" entries in this sorted list for the contents of the pit.\n
2457 * Hack -- all of the "dragons" in a "dragon" pit must be the same "color",\n
2458 * which is handled by requiring a specific "breath" attack for all of the\n
2459 * dragons. This may include "multi-hued" breath. Note that "wyrms" may\n
2460 * be present in many of the dragon pits, if they have the proper breath.\n
2462 * Note the use of the "get_mon_num_prep()" function, and the special\n
2463 * "get_mon_num_hook()" restriction function, to prepare the "monster\n
2464 * allocation table" in such a way as to optimize the selection of\n
2465 * "appropriate" non-unique monsters for the pit.\n
2467 * Note that the "get_mon_num()" function may (rarely) fail, in which case\n
2468 * the pit will be empty.\n
2470 * Note that "monster pits" will never contain "unique" monsters.\n
2472 static bool build_type6(void)
2474 int y, x, y1, x1, y2, x2, xval, yval;
2483 int cur_pit_type = pick_vault_type(pit_types, d_info[dungeon_type].pit);
2484 vault_aux_type *n_ptr;
2486 /* No type available */
2487 if (cur_pit_type < 0) return FALSE;
2489 n_ptr = &pit_types[cur_pit_type];
2491 /* Process a preparation function if necessary */
2492 if (n_ptr->prep_func) (*(n_ptr->prep_func))();
2494 /* Prepare allocation table */
2495 get_mon_num_prep(n_ptr->hook_func, NULL);
2497 align.sub_align = SUB_ALIGN_NEUTRAL;
2499 /* Pick some monster types */
2500 for (i = 0; i < 16; i++)
2502 int r_idx = 0, attempts = 100;
2503 monster_race *r_ptr = NULL;
2507 /* Get a (hard) monster type */
2508 r_idx = get_mon_num(dun_level + 11);
2509 r_ptr = &r_info[r_idx];
2511 /* Decline incorrect alignment */
2512 if (monster_has_hostile_align(&align, 0, 0, r_ptr)) continue;
2514 /* Accept this monster */
2518 /* Notice failure */
2519 if (!r_idx || !attempts) return FALSE;
2521 /* Note the alignment */
2522 if (r_ptr->flags3 & RF3_EVIL) align.sub_align |= SUB_ALIGN_EVIL;
2523 if (r_ptr->flags3 & RF3_GOOD) align.sub_align |= SUB_ALIGN_GOOD;
2528 /* Find and reserve some space in the dungeon. Get center of room. */
2529 if (!find_space(&yval, &xval, 11, 25)) return FALSE;
2537 /* Place the floor area */
2538 for (y = y1 - 1; y <= y2 + 1; y++)
2540 for (x = x1 - 1; x <= x2 + 1; x++)
2542 c_ptr = &cave[y][x];
2543 place_floor_grid(c_ptr);
2544 c_ptr->info |= (CAVE_ROOM);
2548 /* Place the outer walls */
2549 for (y = y1 - 1; y <= y2 + 1; y++)
2551 c_ptr = &cave[y][x1 - 1];
2552 place_outer_grid(c_ptr);
2553 c_ptr = &cave[y][x2 + 1];
2554 place_outer_grid(c_ptr);
2556 for (x = x1 - 1; x <= x2 + 1; x++)
2558 c_ptr = &cave[y1 - 1][x];
2559 place_outer_grid(c_ptr);
2560 c_ptr = &cave[y2 + 1][x];
2561 place_outer_grid(c_ptr);
2564 /* Advance to the center room */
2570 /* The inner walls */
2571 for (y = y1 - 1; y <= y2 + 1; y++)
2573 c_ptr = &cave[y][x1 - 1];
2574 place_inner_grid(c_ptr);
2575 c_ptr = &cave[y][x2 + 1];
2576 place_inner_grid(c_ptr);
2578 for (x = x1 - 1; x <= x2 + 1; x++)
2580 c_ptr = &cave[y1 - 1][x];
2581 place_inner_grid(c_ptr);
2582 c_ptr = &cave[y2 + 1][x];
2583 place_inner_grid(c_ptr);
2585 for (y = y1; y <= y2; y++)
2587 for (x = x1; x <= x2; x++)
2589 add_cave_info(y, x, CAVE_ICKY);
2593 /* Place a secret door */
2594 switch (randint1(4))
2596 case 1: place_secret_door(y1 - 1, xval, DOOR_DEFAULT); break;
2597 case 2: place_secret_door(y2 + 1, xval, DOOR_DEFAULT); break;
2598 case 3: place_secret_door(yval, x1 - 1, DOOR_DEFAULT); break;
2599 case 4: place_secret_door(yval, x2 + 1, DOOR_DEFAULT); break;
2602 /* Sort the entries */
2603 for (i = 0; i < 16 - 1; i++)
2605 /* Sort the entries */
2606 for (j = 0; j < 16 - 1; j++)
2611 int p1 = r_info[what[i1]].level;
2612 int p2 = r_info[what[i2]].level;
2618 what[i1] = what[i2];
2624 msg_format_wizard(CHEAT_DUNGEON, _("モンスター部屋(pit)(%s%s)を生成します。", "Monster pit (%s%s)"), n_ptr->name, pit_subtype_string(cur_pit_type, FALSE));
2626 /* Select the entries */
2627 for (i = 0; i < 8; i++)
2629 /* Every other entry */
2630 what[i] = what[i * 2];
2631 msg_format_wizard(CHEAT_DUNGEON, _("Nest構成モンスター選択No.%d:%s", "Nest Monster Select No.%d:%s"), i, r_name + r_info[what[i]].name);
2634 /* Top and bottom rows */
2635 for (x = xval - 9; x <= xval + 9; x++)
2637 place_monster_aux(0, yval - 2, x, what[0], PM_NO_KAGE);
2638 place_monster_aux(0, yval + 2, x, what[0], PM_NO_KAGE);
2641 /* Middle columns */
2642 for (y = yval - 1; y <= yval + 1; y++)
2644 place_monster_aux(0, y, xval - 9, what[0], PM_NO_KAGE);
2645 place_monster_aux(0, y, xval + 9, what[0], PM_NO_KAGE);
2647 place_monster_aux(0, y, xval - 8, what[1], PM_NO_KAGE);
2648 place_monster_aux(0, y, xval + 8, what[1], PM_NO_KAGE);
2650 place_monster_aux(0, y, xval - 7, what[1], PM_NO_KAGE);
2651 place_monster_aux(0, y, xval + 7, what[1], PM_NO_KAGE);
2653 place_monster_aux(0, y, xval - 6, what[2], PM_NO_KAGE);
2654 place_monster_aux(0, y, xval + 6, what[2], PM_NO_KAGE);
2656 place_monster_aux(0, y, xval - 5, what[2], PM_NO_KAGE);
2657 place_monster_aux(0, y, xval + 5, what[2], PM_NO_KAGE);
2659 place_monster_aux(0, y, xval - 4, what[3], PM_NO_KAGE);
2660 place_monster_aux(0, y, xval + 4, what[3], PM_NO_KAGE);
2662 place_monster_aux(0, y, xval - 3, what[3], PM_NO_KAGE);
2663 place_monster_aux(0, y, xval + 3, what[3], PM_NO_KAGE);
2665 place_monster_aux(0, y, xval - 2, what[4], PM_NO_KAGE);
2666 place_monster_aux(0, y, xval + 2, what[4], PM_NO_KAGE);
2669 /* Above/Below the center monster */
2670 for (x = xval - 1; x <= xval + 1; x++)
2672 place_monster_aux(0, yval + 1, x, what[5], PM_NO_KAGE);
2673 place_monster_aux(0, yval - 1, x, what[5], PM_NO_KAGE);
2676 /* Next to the center monster */
2677 place_monster_aux(0, yval, xval + 1, what[6], PM_NO_KAGE);
2678 place_monster_aux(0, yval, xval - 1, what[6], PM_NO_KAGE);
2680 /* Center monster */
2681 place_monster_aux(0, yval, xval, what[7], PM_NO_KAGE);
2688 * @brief Vault地形を回転、上下左右反転するための座標変換を返す / coordinate translation code
2689 * @param x 変換したい点のX座標参照ポインタ
2690 * @param y 変換したい点のY座標参照ポインタ
2691 * @param xoffset Vault生成時の基準X座標
2692 * @param yoffset Vault生成時の基準Y座標
2693 * @param transno 処理ID
2696 static void coord_trans(int *x, int *y, int xoffset, int yoffset, int transno)
2702 * transno specifies what transformation is required. (0-7)
2703 * The lower two bits indicate by how much the vault is rotated,
2704 * and the upper bit indicates a reflection.
2705 * This is done by using rotation matrices... however since
2706 * these are mostly zeros for rotations by 90 degrees this can
2707 * be expressed simply in terms of swapping and inverting the
2708 * x and y coordinates.
2710 for (i = 0; i < transno % 4; i++)
2712 /* rotate by 90 degrees */
2720 /* Reflect depending on status of 3rd bit. */
2724 /* Add offsets so vault stays in the first quadrant */
2730 * @brief Vaultをフロアに配置する / Hack -- fill in "vault" rooms
2731 * @param yval 生成基準Y座標
2732 * @param xval 生成基準X座標
2733 * @param ymax VaultのYサイズ
2734 * @param xmax VaultのXサイズ
2735 * @param data Vaultのデータ文字列
2736 * @param xoffset 変換基準X座標
2737 * @param yoffset 変換基準Y座標
2738 * @param transno 変換ID
2741 static void build_vault(int yval, int xval, int ymax, int xmax, cptr data,
2742 int xoffset, int yoffset, int transno)
2744 int dx, dy, x, y, i, j;
2751 /* Place dungeon features and objects */
2752 for (t = data, dy = 0; dy < ymax; dy++)
2754 for (dx = 0; dx < xmax; dx++, t++)
2756 /* prevent loop counter from being overwritten */
2761 coord_trans(&i, &j, xoffset, yoffset, transno);
2763 /* Extract the location */
2764 if (transno % 2 == 0)
2766 /* no swap of x/y */
2767 x = xval - (xmax / 2) + i;
2768 y = yval - (ymax / 2) + j;
2773 x = xval - (ymax / 2) + i;
2774 y = yval - (xmax / 2) + j;
2777 /* Hack -- skip "non-grids" */
2778 if (*t == ' ') continue;
2780 /* Access the grid */
2781 c_ptr = &cave[y][x];
2783 /* Lay down a floor */
2784 place_floor_grid(c_ptr);
2786 /* Remove any mimic */
2789 /* Part of a vault */
2790 c_ptr->info |= (CAVE_ROOM | CAVE_ICKY);
2792 /* Analyze the grid */
2795 /* Granite wall (outer) */
2797 place_outer_noperm_grid(c_ptr);
2800 /* Granite wall (inner) */
2802 place_inner_grid(c_ptr);
2805 /* Glass wall (inner) */
2807 place_inner_grid(c_ptr);
2808 c_ptr->feat = feat_glass_wall;
2811 /* Permanent wall (inner) */
2813 place_inner_perm_grid(c_ptr);
2816 /* Permanent glass wall (inner) */
2818 place_inner_perm_grid(c_ptr);
2819 c_ptr->feat = feat_permanent_glass_wall;
2824 if (randint0(100) < 75)
2826 place_object(y, x, 0L);
2836 place_secret_door(y, x, DOOR_DEFAULT);
2839 /* Secret glass doors */
2841 place_secret_door(y, x, DOOR_GLASS_DOOR);
2842 if (is_closed_door(c_ptr->feat)) c_ptr->mimic = feat_glass_wall;
2847 place_secret_door(y, x, DOOR_CURTAIN);
2855 /* Black market in a dungeon */
2857 set_cave_feat(y, x, feat_black_market);
2858 store_init(NO_TOWN, STORE_BLACK);
2863 set_cave_feat(y, x, feat_pattern_start);
2867 set_cave_feat(y, x, feat_pattern_1);
2871 set_cave_feat(y, x, feat_pattern_2);
2875 set_cave_feat(y, x, feat_pattern_3);
2879 set_cave_feat(y, x, feat_pattern_4);
2883 set_cave_feat(y, x, feat_pattern_end);
2887 set_cave_feat(y, x, feat_pattern_exit);
2891 /* Reward for Pattern walk */
2892 object_level = base_level + 12;
2893 place_object(y, x, AM_GOOD | AM_GREAT);
2894 object_level = base_level;
2901 /* Place dungeon monsters and objects */
2902 for (t = data, dy = 0; dy < ymax; dy++)
2904 for (dx = 0; dx < xmax; dx++, t++)
2906 /* prevent loop counter from being overwritten */
2911 coord_trans(&i, &j, xoffset, yoffset, transno);
2913 /* Extract the location */
2914 if (transno % 2 == 0)
2916 /* no swap of x/y */
2917 x = xval - (xmax / 2) + i;
2918 y = yval - (ymax / 2) + j;
2923 x = xval - (ymax / 2) + i;
2924 y = yval - (xmax / 2) + j;
2927 /* Hack -- skip "non-grids" */
2928 if (*t == ' ') continue;
2930 /* Analyze the symbol */
2936 monster_level = base_level + 5;
2937 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
2938 monster_level = base_level;
2942 /* Meaner monster */
2945 monster_level = base_level + 11;
2946 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
2947 monster_level = base_level;
2951 /* Meaner monster, plus treasure */
2954 monster_level = base_level + 9;
2955 place_monster(y, x, PM_ALLOW_SLEEP);
2956 monster_level = base_level;
2957 object_level = base_level + 7;
2958 place_object(y, x, AM_GOOD);
2959 object_level = base_level;
2963 /* Nasty monster and treasure */
2966 monster_level = base_level + 40;
2967 place_monster(y, x, PM_ALLOW_SLEEP);
2968 monster_level = base_level;
2969 object_level = base_level + 20;
2970 place_object(y, x, AM_GOOD | AM_GREAT);
2971 object_level = base_level;
2975 /* Monster and/or object */
2978 if (randint0(100) < 50)
2980 monster_level = base_level + 3;
2981 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
2982 monster_level = base_level;
2984 if (randint0(100) < 50)
2986 object_level = base_level + 7;
2987 place_object(y, x, 0L);
2988 object_level = base_level;
3000 * @brief タイプ7の部屋…v_info.txtより小型vaultを生成する / Type 7 -- simple vaults (see "v_info.txt")
3003 static bool build_type7(void)
3005 vault_type *v_ptr = NULL;
3009 int xoffset, yoffset;
3012 /* Pick a lesser vault */
3013 for (dummy = 0; dummy < SAFE_MAX_ATTEMPTS; dummy++)
3015 /* Access a random vault record */
3016 v_ptr = &v_info[randint0(max_v_idx)];
3018 /* Accept the first lesser vault */
3019 if (v_ptr->typ == 7) break;
3022 /* No lesser vault found */
3023 if (dummy >= SAFE_MAX_ATTEMPTS)
3025 msg_print_wizard(CHEAT_DUNGEON, _("小型固定Vaultを配置できませんでした。", "Could not place lesser vault."));
3029 /* pick type of transformation (0-7) */
3030 transno = randint0(8);
3032 /* calculate offsets */
3036 /* Some huge vault cannot be ratated to fit in the dungeon */
3037 if (x+2 > cur_hgt-2)
3039 /* Forbid 90 or 270 degree ratation */
3043 coord_trans(&x, &y, 0, 0, transno);
3063 /* Find and reserve some space in the dungeon. Get center of room. */
3064 if (!find_space(&yval, &xval, abs(y), abs(x))) return FALSE;
3071 msg_format_wizard(CHEAT_DUNGEON, _("小型Vault(%s)を生成しました。", "Lesser vault (%s)."), v_name + v_ptr->name);
3073 /* Hack -- Build the vault */
3074 build_vault(yval, xval, v_ptr->hgt, v_ptr->wid,
3075 v_text + v_ptr->text, xoffset, yoffset, transno);
3081 * @brief タイプ8の部屋…v_info.txtより大型vaultを生成する / Type 8 -- greater vaults (see "v_info.txt")
3084 static bool build_type8(void)
3091 int xoffset, yoffset;
3093 /* Pick a greater vault */
3094 for (dummy = 0; dummy < SAFE_MAX_ATTEMPTS; dummy++)
3096 /* Access a random vault record */
3097 v_ptr = &v_info[randint0(max_v_idx)];
3099 /* Accept the first greater vault */
3100 if (v_ptr->typ == 8) break;
3103 /* No greater vault found */
3104 if (dummy >= SAFE_MAX_ATTEMPTS)
3106 msg_print_wizard(CHEAT_DUNGEON, _("大型固定Vaultを配置できませんでした。", "Could not place greater vault."));
3110 /* pick type of transformation (0-7) */
3111 transno = randint0(8);
3113 /* calculate offsets */
3117 /* Some huge vault cannot be ratated to fit in the dungeon */
3118 if (x+2 > cur_hgt-2)
3120 /* Forbid 90 or 270 degree ratation */
3124 coord_trans(&x, &y, 0, 0, transno);
3145 * Try to allocate space for room. If fails, exit
3147 * Hack -- Prepare a bit larger space (+2, +2) to
3148 * prevent generation of vaults with no-entrance.
3150 /* Find and reserve some space in the dungeon. Get center of room. */
3151 if (!find_space(&yval, &xval, abs(y) + 2, abs(x) + 2)) return FALSE;
3154 v_ptr = &v_info[76 + randint1(3)];
3157 msg_format_wizard(CHEAT_DUNGEON, _("大型固定Vault(%s)を生成しました。", "Greater vault (%s)."), v_name + v_ptr->name);
3159 /* Hack -- Build the vault */
3160 build_vault(yval, xval, v_ptr->hgt, v_ptr->wid,
3161 v_text + v_ptr->text, xoffset, yoffset, transno);
3167 * Structure to hold all "fill" data
3170 typedef struct fill_data_type fill_data_type;
3172 struct fill_data_type
3185 /* features to fill with */
3194 /* number of filled squares */
3198 static fill_data_type fill_data;
3201 /* Store routine for the fractal cave generator */
3202 /* this routine probably should be an inline function or a macro. */
3203 static void store_height(int x, int y, int val)
3205 /* if on boundary set val > cutoff so walls are not as square */
3206 if (((x == fill_data.xmin) || (y == fill_data.ymin) ||
3207 (x == fill_data.xmax) || (y == fill_data.ymax)) &&
3208 (val <= fill_data.c1)) val = fill_data.c1 + 1;
3210 /* store the value in height-map format */
3211 cave[y][x].feat = val;
3218 * Explanation of the plasma fractal algorithm:
3220 * A grid of points is created with the properties of a 'height-map'
3221 * This is done by making the corners of the grid have a random value.
3222 * The grid is then subdivided into one with twice the resolution.
3223 * The new points midway between two 'known' points can be calculated
3224 * by taking the average value of the 'known' ones and randomly adding
3225 * or subtracting an amount proportional to the distance between those
3226 * points. The final 'middle' points of the grid are then calculated
3227 * by averaging all four of the originally 'known' corner points. An
3228 * random amount is added or subtracted from this to get a value of the
3229 * height at that point. The scaling factor here is adjusted to the
3230 * slightly larger distance diagonally as compared to orthogonally.
3232 * This is then repeated recursively to fill an entire 'height-map'
3233 * A rectangular map is done the same way, except there are different
3234 * scaling factors along the x and y directions.
3236 * A hack to change the amount of correlation between points is done using
3237 * the grd variable. If the current step size is greater than grd then
3238 * the point will be random, otherwise it will be calculated by the
3239 * above algorithm. This makes a maximum distance at which two points on
3240 * the height map can affect each other.
3242 * How fractal caves are made:
3244 * When the map is complete, a cut-off value is used to create a cave.
3245 * Heights below this value are "floor", and heights above are "wall".
3246 * This also can be used to create lakes, by adding more height levels
3247 * representing shallow and deep water/ lava etc.
3249 * The grd variable affects the width of passages.
3250 * The roug variable affects the roughness of those passages
3252 * The tricky part is making sure the created cave is connected. This
3253 * is done by 'filling' from the inside and only keeping the 'filled'
3254 * floor. Walls bounding the 'filled' floor are also kept. Everything
3255 * else is converted to the normal _extra_.
3260 * Note that this uses the cave.feat array in a very hackish way
3261 * the values are first set to zero, and then each array location
3262 * is used as a "heightmap"
3263 * The heightmap then needs to be converted back into the "feat" format.
3265 * grd=level at which fractal turns on. smaller gives more mazelike caves
3266 * roug=roughness level. 16=normal. higher values make things more convoluted
3267 * small values are good for smooth walls.
3268 * size=length of the side of the square cave system.
3270 static void generate_hmap(int y0, int x0, int xsiz, int ysiz, int grd, int roug, int cutoff)
3272 int xhsize, yhsize, xsize, ysize, maxsize;
3275 * fixed point variables- these are stored as 256 x normal value
3276 * this gives 8 binary places of fractional part + 8 places of normal part
3279 u16b xstep, xhstep, ystep, yhstep;
3280 u16b xstep2, xhstep2, ystep2, yhstep2;
3281 u16b i, j, ii, jj, diagsize, xxsize, yysize;
3283 /* Cache for speed */
3284 u16b xm, xp, ym, yp;
3286 /* redefine size so can change the value if out of range */
3290 /* Paranoia about size of the system of caves */
3291 if (xsize > 254) xsize = 254;
3292 if (xsize < 4) xsize = 4;
3293 if (ysize > 254) ysize = 254;
3294 if (ysize < 4) ysize = 4;
3296 /* get offsets to middle of array */
3300 /* fix rounding problem */
3304 /* get limits of region */
3305 fill_data.xmin = x0 - xhsize;
3306 fill_data.ymin = y0 - yhsize;
3307 fill_data.xmax = x0 + xhsize;
3308 fill_data.ymax = y0 + yhsize;
3310 /* Store cutoff in global for quick access */
3311 fill_data.c1 = cutoff;
3314 * Scale factor for middle points:
3315 * About sqrt(2) * 256 - correct for a square lattice
3316 * approximately correct for everything else.
3320 /* maximum of xsize and ysize */
3321 maxsize = (xsize > ysize) ? xsize : ysize;
3323 /* Clear the section */
3324 for (i = 0; i <= xsize; i++)
3326 for (j = 0; j <= ysize; j++)
3328 /* -1 is a flag for "not done yet" */
3329 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].feat = -1;
3330 /* Clear icky flag because may be redoing the cave */
3331 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].info &= ~(CAVE_ICKY);
3335 /* Boundaries are walls */
3336 cave[fill_data.ymin][fill_data.xmin].feat = maxsize;
3337 cave[fill_data.ymax][fill_data.xmin].feat = maxsize;
3338 cave[fill_data.ymin][fill_data.xmax].feat = maxsize;
3339 cave[fill_data.ymax][fill_data.xmax].feat = maxsize;
3341 /* Set the middle square to be an open area. */
3342 cave[y0][x0].feat = 0;
3344 /* Initialize the step sizes */
3345 xstep = xhstep = xsize * 256;
3346 ystep = yhstep = ysize * 256;
3347 xxsize = xsize * 256;
3348 yysize = ysize * 256;
3351 * Fill in the rectangle with fractal height data -
3352 * like the 'plasma fractal' in fractint.
3354 while ((xhstep > 256) || (yhstep > 256))
3356 /* Halve the step sizes */
3362 /* cache well used values */
3363 xstep2 = xstep / 256;
3364 ystep2 = ystep / 256;
3366 xhstep2 = xhstep / 256;
3367 yhstep2 = yhstep / 256;
3369 /* middle top to bottom. */
3370 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
3372 for (j = 0; j <= yysize; j += ystep)
3374 /* cache often used values */
3375 ii = i / 256 + fill_data.xmin;
3376 jj = j / 256 + fill_data.ymin;
3379 if (cave[jj][ii].feat == -1)
3383 /* If greater than 'grid' level then is random */
3384 store_height(ii, jj, randint1(maxsize));
3388 /* Average of left and right points +random bit */
3389 store_height(ii, jj,
3390 (cave[jj][fill_data.xmin + (i - xhstep) / 256].feat
3391 + cave[jj][fill_data.xmin + (i + xhstep) / 256].feat) / 2
3392 + (randint1(xstep2) - xhstep2) * roug / 16);
3399 /* middle left to right. */
3400 for (j = yhstep; j <= yysize - yhstep; j += ystep)
3402 for (i = 0; i <= xxsize; i += xstep)
3404 /* cache often used values */
3405 ii = i / 256 + fill_data.xmin;
3406 jj = j / 256 + fill_data.ymin;
3409 if (cave[jj][ii].feat == -1)
3413 /* If greater than 'grid' level then is random */
3414 store_height(ii, jj, randint1(maxsize));
3418 /* Average of up and down points +random bit */
3419 store_height(ii, jj,
3420 (cave[fill_data.ymin + (j - yhstep) / 256][ii].feat
3421 + cave[fill_data.ymin + (j + yhstep) / 256][ii].feat) / 2
3422 + (randint1(ystep2) - yhstep2) * roug / 16);
3429 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
3431 for (j = yhstep; j <= yysize - yhstep; j += ystep)
3433 /* cache often used values */
3434 ii = i / 256 + fill_data.xmin;
3435 jj = j / 256 + fill_data.ymin;
3438 if (cave[jj][ii].feat == -1)
3442 /* If greater than 'grid' level then is random */
3443 store_height(ii, jj, randint1(maxsize));
3447 /* Cache reused values. */
3448 xm = fill_data.xmin + (i - xhstep) / 256;
3449 xp = fill_data.xmin + (i + xhstep) / 256;
3450 ym = fill_data.ymin + (j - yhstep) / 256;
3451 yp = fill_data.ymin + (j + yhstep) / 256;
3454 * Average over all four corners + scale by diagsize to
3455 * reduce the effect of the square grid on the shape of the fractal
3457 store_height(ii, jj,
3458 (cave[ym][xm].feat + cave[yp][xm].feat
3459 + cave[ym][xp].feat + cave[yp][xp].feat) / 4
3460 + (randint1(xstep2) - xhstep2) * (diagsize / 16) / 256 * roug);
3469 static bool hack_isnt_wall(int y, int x, int c1, int c2, int c3, int feat1, int feat2, int feat3, int info1, int info2, int info3)
3472 * function used to convert from height-map back to the
3473 * normal angband cave format
3475 if (cave[y][x].info & CAVE_ICKY)
3482 /* Show that have looked at this square */
3483 cave[y][x].info|= (CAVE_ICKY);
3485 /* Use cutoffs c1-c3 to allocate regions of floor /water/ lava etc. */
3486 if (cave[y][x].feat <= c1)
3488 /* 25% of the time use the other tile : it looks better this way */
3489 if (randint1(100) < 75)
3491 cave[y][x].feat = feat1;
3492 cave[y][x].info &= ~(CAVE_MASK);
3493 cave[y][x].info |= info1;
3498 cave[y][x].feat = feat2;
3499 cave[y][x].info &= ~(CAVE_MASK);
3500 cave[y][x].info |= info2;
3504 else if (cave[y][x].feat <= c2)
3506 /* 25% of the time use the other tile : it looks better this way */
3507 if (randint1(100) < 75)
3509 cave[y][x].feat = feat2;
3510 cave[y][x].info &= ~(CAVE_MASK);
3511 cave[y][x].info |= info2;
3516 cave[y][x].feat = feat1;
3517 cave[y][x].info &= ~(CAVE_MASK);
3518 cave[y][x].info |= info1;
3522 else if (cave[y][x].feat <= c3)
3524 cave[y][x].feat = feat3;
3525 cave[y][x].info &= ~(CAVE_MASK);
3526 cave[y][x].info |= info3;
3529 /* if greater than cutoff then is a wall */
3532 place_outer_bold(y, x);
3542 * Quick and nasty fill routine used to find the connected region
3543 * of floor in the middle of the cave
3545 static void cave_fill(byte y, byte x)
3554 /*** Start Grid ***/
3556 /* Enqueue that entry */
3561 /* Now process the queue */
3562 while (flow_head != flow_tail)
3564 /* Extract the next entry */
3565 ty = temp_y[flow_head];
3566 tx = temp_x[flow_head];
3568 /* Forget that entry */
3569 if (++flow_head == TEMP_MAX) flow_head = 0;
3571 /* Add the "children" */
3572 for (d = 0; d < 8; d++)
3574 int old_head = flow_tail;
3576 /* Child location */
3577 j = ty + ddy_ddd[d];
3578 i = tx + ddx_ddd[d];
3580 /* Paranoia Don't leave the cave */
3581 if (!in_bounds(j, i))
3583 /* affect boundary */
3584 cave[j][i].info |= CAVE_ICKY;
3588 /* If within bounds */
3589 else if ((i > fill_data.xmin) && (i < fill_data.xmax)
3590 && (j > fill_data.ymin) && (j < fill_data.ymax))
3592 /* If not a wall or floor done before */
3593 if (hack_isnt_wall(j, i,
3594 fill_data.c1, fill_data.c2, fill_data.c3,
3595 fill_data.feat1, fill_data.feat2, fill_data.feat3,
3596 fill_data.info1, fill_data.info2, fill_data.info3))
3598 /* Enqueue that entry */
3599 temp_y[flow_tail] = j;
3600 temp_x[flow_tail] = i;
3602 /* Advance the queue */
3603 if (++flow_tail == TEMP_MAX) flow_tail = 0;
3605 /* Hack -- Overflow by forgetting new entry */
3606 if (flow_tail == flow_head)
3608 flow_tail = old_head;
3612 /* keep tally of size of cave system */
3613 (fill_data.amount)++;
3619 /* affect boundary */
3620 cave[j][i].info |= CAVE_ICKY;
3627 static bool generate_fracave(int y0, int x0, int xsize, int ysize, int cutoff, bool light, bool room)
3629 int x, y, i, xhsize, yhsize;
3631 /* offsets to middle from corner */
3637 * select region connected to center of cave system
3638 * this gets rid of alot of isolated one-sqaures that
3639 * can make teleport traps instadeaths...
3643 fill_data.c1 = cutoff;
3647 /* features to fill with */
3648 fill_data.feat1 = floor_type[randint0(100)];
3649 fill_data.feat2 = floor_type[randint0(100)];
3650 fill_data.feat3 = floor_type[randint0(100)];
3652 fill_data.info1 = CAVE_FLOOR;
3653 fill_data.info2 = CAVE_FLOOR;
3654 fill_data.info3 = CAVE_FLOOR;
3656 /* number of filled squares */
3657 fill_data.amount = 0;
3659 cave_fill((byte)y0, (byte)x0);
3661 /* if tally too small, try again */
3662 if (fill_data.amount < 10)
3664 /* too small - clear area and try again later */
3665 for (x = 0; x <= xsize; ++x)
3667 for (y = 0; y <= ysize; ++y)
3669 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
3670 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
3677 * Do boundarys-check to see if they are next to a filled region
3678 * If not then they are set to normal granite
3679 * If so then they are marked as room walls.
3681 for (i = 0; i <= xsize; ++i)
3684 if ((cave[0 + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
3686 /* Next to a 'filled' region? - set to be room walls */
3687 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
3688 if (light) cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_GLOW);
3689 cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_ROOM);
3690 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
3694 /* set to be normal granite */
3695 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
3698 /* bottom boundary */
3699 if ((cave[ysize + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
3701 /* Next to a 'filled' region? - set to be room walls */
3702 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
3703 if (light) cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_GLOW);
3704 cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_ROOM);
3705 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
3709 /* set to be normal granite */
3710 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
3713 /* clear the icky flag-don't need it any more */
3714 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
3715 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
3718 /* Do the left and right boundaries minus the corners (done above) */
3719 for (i = 1; i < ysize; ++i)
3722 if ((cave[i + y0 - yhsize][0 + x0 - xhsize].info & CAVE_ICKY) && room)
3725 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
3726 if (light) cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_GLOW);
3727 cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_ROOM);
3728 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
3733 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
3735 /* right boundary */
3736 if ((cave[i + y0 - yhsize][xsize + x0 - xhsize].info & CAVE_ICKY) && room)
3739 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
3740 if (light) cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_GLOW);
3741 cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_ROOM);
3742 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
3747 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
3750 /* clear icky flag -done with it */
3751 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
3752 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
3756 /* Do the rest: convert back to the normal format */
3757 for (x = 1; x < xsize; ++x)
3759 for (y = 1; y < ysize; ++y)
3761 if (is_floor_bold(y0 + y - yhsize, x0 + x - xhsize) &&
3762 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
3764 /* Clear the icky flag in the filled region */
3765 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~CAVE_ICKY;
3767 /* Set appropriate flags */
3768 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
3769 if (room) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
3771 else if (is_outer_bold(y0 + y - yhsize, x0 + x - xhsize) &&
3772 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
3775 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
3776 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
3779 cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
3784 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
3785 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ROOM);
3790 /* Clear the unconnected regions */
3791 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
3792 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
3798 * XXX XXX XXX There is a slight problem when tunnels pierce the caves:
3799 * Extra doors appear inside the system. (Its not very noticeable though.)
3800 * This can be removed by "filling" from the outside in. This allows a separation
3801 * from _outer_ with _inner_. (Internal walls are _outer_ instead.)
3802 * The extra effort for what seems to be only a minor thing (even non-existant if you
3803 * think of the caves not as normal rooms, but as holes in the dungeon), doesn't seem
3812 * @brief タイプ9の部屋…フラクタルカーブによる洞窟生成 / Type 9 -- Driver routine to create fractal cave system
3815 static bool build_type9(void)
3817 int grd, roug, cutoff, xsize, ysize, y0, x0;
3819 bool done, light, room;
3821 /* get size: note 'Evenness'*/
3822 xsize = randint1(22) * 2 + 6;
3823 ysize = randint1(15) * 2 + 6;
3825 /* Find and reserve some space in the dungeon. Get center of room. */
3826 if (!find_space(&y0, &x0, ysize + 1, xsize + 1))
3828 /* Limit to the minimum room size, and retry */
3832 /* Find and reserve some space in the dungeon. Get center of room. */
3833 if (!find_space(&y0, &x0, ysize + 1, xsize + 1))
3839 return build_type1();
3843 light = done = FALSE;
3846 if ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
3850 /* Note: size must be even or there are rounding problems
3851 * This causes the tunnels not to connect properly to the room */
3853 /* testing values for these parameters feel free to adjust */
3854 grd = 1 << (randint0(4));
3856 /* want average of about 16 */
3857 roug = randint1(8) * randint1(4);
3860 cutoff = randint1(xsize / 4) + randint1(ysize / 4) +
3861 randint1(xsize / 4) + randint1(ysize / 4);
3864 generate_hmap(y0, x0, xsize, ysize, grd, roug, cutoff);
3866 /* Convert to normal format + clean up */
3867 done = generate_fracave(y0, x0, xsize, ysize, cutoff, light, room);
3873 #ifdef ALLOW_CAVERNS_AND_LAKES
3875 * Builds a cave system in the center of the dungeon.
3877 void build_cavern(void)
3879 int grd, roug, cutoff, xsize, ysize, x0, y0;
3882 light = done = FALSE;
3883 if ((dun_level <= randint1(50)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
3885 /* Make a cave the size of the dungeon */
3886 xsize = cur_wid - 1;
3887 ysize = cur_hgt - 1;
3891 /* Paranoia: make size even */
3897 /* testing values for these parameters: feel free to adjust */
3898 grd = randint1(4) + 4;
3900 /* want average of about 16 */
3901 roug = randint1(8) * randint1(4);
3907 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, cutoff);
3909 /* Convert to normal format+ clean up */
3910 done = generate_fracave(y0 + 1, x0 + 1, xsize, ysize, cutoff, light, FALSE);
3914 static bool generate_lake(int y0, int x0, int xsize, int ysize, int c1, int c2, int c3, int type)
3916 int x, y, i, xhsize, yhsize;
3917 int feat1, feat2, feat3;
3919 /* offsets to middle from corner */
3923 /* Get features based on type */
3926 case LAKE_T_LAVA: /* Lava */
3927 feat1 = feat_deep_lava;
3928 feat2 = feat_shallow_lava;
3929 feat3 = floor_type[randint0(100)];
3931 case LAKE_T_WATER: /* Water */
3932 feat1 = feat_deep_water;
3933 feat2 = feat_shallow_water;
3934 feat3 = floor_type[randint0(100)];
3936 case LAKE_T_CAVE: /* Collapsed cave */
3937 feat1 = floor_type[randint0(100)];
3938 feat2 = floor_type[randint0(100)];
3939 feat3 = feat_rubble;
3941 case LAKE_T_EARTH_VAULT: /* Earth vault */
3942 feat1 = feat_rubble;
3943 feat2 = floor_type[randint0(100)];
3944 feat3 = feat_rubble;
3946 case LAKE_T_AIR_VAULT: /* Air vault */
3951 case LAKE_T_WATER_VAULT: /* Water vault */
3952 feat1 = feat_shallow_water;
3953 feat2 = feat_deep_water;
3954 feat3 = feat_shallow_water;
3956 case LAKE_T_FIRE_VAULT: /* Fire Vault */
3957 feat1 = feat_shallow_lava;
3958 feat2 = feat_deep_lava;
3959 feat3 = feat_shallow_lava;
3963 default: return FALSE;
3967 * select region connected to center of cave system
3968 * this gets rid of alot of isolated one-sqaures that
3969 * can make teleport traps instadeaths...
3977 /* features to fill with */
3978 fill_data.feat1 = feat1;
3979 fill_data.feat2 = feat2;
3980 fill_data.feat3 = feat3;
3982 fill_data.info1 = 0;
3983 fill_data.info2 = 0;
3984 fill_data.info3 = 0;
3986 /* number of filled squares */
3987 fill_data.amount = 0;
3989 /* select region connected to center of cave system
3990 * this gets rid of alot of isolated one-sqaures that
3991 * can make teleport traps instadeaths... */
3992 cave_fill((byte)y0, (byte)x0);
3994 /* if tally too small, try again */
3995 if (fill_data.amount < 10)
3997 /* too small -clear area and try again later */
3998 for (x = 0; x <= xsize; ++x)
4000 for (y = 0; y <= ysize; ++y)
4002 place_floor_bold(y0 + y - yhsize, x0 + x - xhsize);
4003 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
4009 /* Do boundarys- set to normal granite */
4010 for (i = 0; i <= xsize; ++i)
4012 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
4013 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
4015 /* clear the icky flag-don't need it any more */
4016 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
4017 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
4020 /* Do the left and right boundaries minus the corners (done above) */
4022 for (i = 1; i < ysize; ++i)
4024 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
4025 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
4027 /* clear icky flag -done with it */
4028 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
4029 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
4033 /* Do the rest: convert back to the normal format */
4034 for (x = 1; x < xsize; ++x)
4036 for (y = 1; y < ysize; ++y)
4038 /* Fill unconnected regions with granite */
4039 if ((!(cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY)) ||
4040 is_outer_bold(y0 + y - yhsize, x0 + x - xhsize))
4041 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
4043 /* turn off icky flag (no longer needed.) */
4044 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
4047 if (cave_have_flag_bold(y0 + y - yhsize, x0 + x - xhsize, FF_LAVA))
4049 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS)) cave[y0 + y - yhsize][x0 + x - xhsize].info |= CAVE_GLOW;
4059 * makes a lake/collapsed cave system in the center of the dungeon
4061 void build_lake(int type)
4063 int grd, roug, xsize, ysize, x0, y0;
4067 /* paranoia - exit if lake type out of range. */
4068 if ((type < LAKE_T_LAVA) || (type > LAKE_T_FIRE_VAULT))
4070 msg_format("Invalid lake type (%d)", type);
4074 /* Make the size of the dungeon */
4075 xsize = cur_wid - 1;
4076 ysize = cur_hgt - 1;
4080 /* Paranoia: make size even */
4086 /* testing values for these parameters: feel free to adjust */
4087 grd = randint1(3) + 4;
4089 /* want average of about 16 */
4090 roug = randint1(8) * randint1(4);
4092 /* Make up size of various componants */
4096 /* Deep water/lava */
4097 c1 = randint0(c3 / 2) + randint0(c3 / 2) - 5;
4099 /* Shallow boundary */
4103 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, c3);
4105 /* Convert to normal format+ clean up */
4106 done = generate_lake(y0 + 1, x0 + 1, xsize, ysize, c1, c2, c3, type);
4109 #endif /* ALLOW_CAVERNS_AND_LAKES */
4113 * Routine used by the random vault creators to add a door to a location
4114 * Note that range checking has to be done in the calling routine.
4116 * The doors must be INSIDE the allocated region.
4118 static void add_door(int x, int y)
4120 /* Need to have a wall in the center square */
4121 if (!is_outer_bold(y, x)) return;
4128 * where x=don't care
4132 if (is_floor_bold(y-1,x) && is_floor_bold(y+1,x) &&
4133 (is_outer_bold(y, x - 1) && is_outer_bold(y, x + 1)))
4136 place_secret_door(y, x, DOOR_DEFAULT);
4138 /* set boundarys so don't get wide doors */
4139 place_solid_bold(y, x - 1);
4140 place_solid_bold(y, x + 1);
4149 * where x = don't care
4152 if (is_outer_bold(y - 1, x) && is_outer_bold(y + 1, x) &&
4153 is_floor_bold(y,x-1) && is_floor_bold(y,x+1))
4156 place_secret_door(y, x, DOOR_DEFAULT);
4158 /* set boundarys so don't get wide doors */
4159 place_solid_bold(y - 1, x);
4160 place_solid_bold(y + 1, x);
4166 * Routine that fills the empty areas of a room with treasure and monsters.
4168 static void fill_treasure(int x1, int x2, int y1, int y2, int difficulty)
4170 int x, y, cx, cy, size;
4173 /* center of room:*/
4177 /* Rough measure of size of vault= sum of lengths of sides */
4178 size = abs(x2 - x1) + abs(y2 - y1);
4180 for (x = x1; x <= x2; x++)
4182 for (y = y1; y <= y2; y++)
4184 /* Thing added based on distance to center of vault
4185 * Difficulty is 1-easy to 10-hard */
4186 value = ((((s32b)(distance(cx, cy, x, y))) * 100) / size) + randint1(10) - difficulty;
4188 /* hack- empty square part of the time */
4189 if ((randint1(100) - difficulty * 3) > 50) value = 20;
4191 /* if floor, shallow water and lava */
4192 if (is_floor_bold(y, x) ||
4193 (cave_have_flag_bold(y, x, FF_PLACE) && cave_have_flag_bold(y, x, FF_DROP)))
4195 /* The smaller 'value' is, the better the stuff */
4198 /* Meanest monster + treasure */
4199 monster_level = base_level + 40;
4200 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4201 monster_level = base_level;
4202 object_level = base_level + 20;
4203 place_object(y, x, AM_GOOD);
4204 object_level = base_level;
4208 /* Mean monster +treasure */
4209 monster_level = base_level + 20;
4210 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4211 monster_level = base_level;
4212 object_level = base_level + 10;
4213 place_object(y, x, AM_GOOD);
4214 object_level = base_level;
4216 else if (value < 10)
4219 monster_level = base_level + 9;
4220 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4221 monster_level = base_level;
4223 else if (value < 17)
4225 /* Intentional Blank space */
4228 * (Want some of the vault to be empty
4229 * so have room for group monsters.
4230 * This is used in the hack above to lower
4231 * the density of stuff in the vault.)
4234 else if (value < 23)
4236 /* Object or trap */
4237 if (randint0(100) < 25)
4239 place_object(y, x, 0L);
4246 else if (value < 30)
4248 /* Monster and trap */
4249 monster_level = base_level + 5;
4250 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4251 monster_level = base_level;
4254 else if (value < 40)
4256 /* Monster or object */
4257 if (randint0(100) < 50)
4259 monster_level = base_level + 3;
4260 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4261 monster_level = base_level;
4263 if (randint0(100) < 50)
4265 object_level = base_level + 7;
4266 place_object(y, x, 0L);
4267 object_level = base_level;
4270 else if (value < 50)
4279 /* 20% monster, 40% trap, 20% object, 20% blank space */
4280 if (randint0(100) < 20)
4282 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
4284 else if (randint0(100) < 50)
4288 else if (randint0(100) < 50)
4290 place_object(y, x, 0L);
4301 * This function creates a random vault that looks like a collection of bubbles.
4302 * It works by getting a set of coordinates that represent the center of each
4303 * bubble. The entire room is made by seeing which bubble center is closest. If
4304 * two centers are equidistant then the square is a wall, otherwise it is a floor.
4305 * The only exception is for squares really near a center, these are always floor.
4306 * (It looks better than without this check.)
4308 * Note: If two centers are on the same point then this algorithm will create a
4309 * blank bubble filled with walls. - This is prevented from happening.
4311 static void build_bubble_vault(int x0, int y0, int xsize, int ysize)
4313 #define BUBBLENUM 10 /* number of bubbles */
4315 /* array of center points of bubbles */
4316 coord center[BUBBLENUM];
4319 u16b min1, min2, temp;
4322 /* Offset from center to top left hand corner */
4323 int xhsize = xsize / 2;
4324 int yhsize = ysize / 2;
4326 msg_print_wizard(CHEAT_DUNGEON, _("泡型ランダムVaultを生成しました。", "Room Vault."));
4328 /* Allocate center of bubbles */
4329 center[0].x = (byte)randint1(xsize - 3) + 1;
4330 center[0].y = (byte)randint1(ysize - 3) + 1;
4332 for (i = 1; i < BUBBLENUM; i++)
4336 /* get center and check to see if it is unique */
4341 x = randint1(xsize - 3) + 1;
4342 y = randint1(ysize - 3) + 1;
4344 for (j = 0; j < i; j++)
4346 /* rough test to see if there is an overlap */
4347 if ((x == center[j].x) && (y == center[j].y)) done = FALSE;
4356 /* Top and bottom boundaries */
4357 for (i = 0; i < xsize; i++)
4359 int side_x = x0 - xhsize + i;
4361 place_outer_noperm_bold(y0 - yhsize + 0, side_x);
4362 cave[y0 - yhsize + 0][side_x].info |= (CAVE_ROOM | CAVE_ICKY);
4363 place_outer_noperm_bold(y0 - yhsize + ysize - 1, side_x);
4364 cave[y0 - yhsize + ysize - 1][side_x].info |= (CAVE_ROOM | CAVE_ICKY);
4367 /* Left and right boundaries */
4368 for (i = 1; i < ysize - 1; i++)
4370 int side_y = y0 - yhsize + i;
4372 place_outer_noperm_bold(side_y, x0 - xhsize + 0);
4373 cave[side_y][x0 - xhsize + 0].info |= (CAVE_ROOM | CAVE_ICKY);
4374 place_outer_noperm_bold(side_y, x0 - xhsize + xsize - 1);
4375 cave[side_y][x0 - xhsize + xsize - 1].info |= (CAVE_ROOM | CAVE_ICKY);
4378 /* Fill in middle with bubbles */
4379 for (x = 1; x < xsize - 1; x++)
4381 for (y = 1; y < ysize - 1; y++)
4383 /* Get distances to two closest centers */
4386 min1 = distance(x, y, center[0].x, center[0].y);
4387 min2 = distance(x, y, center[1].x, center[1].y);
4391 /* swap if in wrong order */
4398 for (i = 2; i < BUBBLENUM; i++)
4400 temp = distance(x, y, center[i].x, center[i].y);
4408 else if (temp < min2)
4410 /* second smallest */
4414 if (((min2 - min1) <= 2) && (!(min1 < 3)))
4416 /* Boundary at midpoint+ not at inner region of bubble */
4417 place_outer_noperm_bold(y0 - yhsize + y, x0 - xhsize + x);
4421 /* middle of a bubble */
4422 place_floor_bold(y0 - yhsize + y, x0 - xhsize + x);
4425 /* clean up rest of flags */
4426 cave[y0 - yhsize + y][x0 - xhsize + x].info |= (CAVE_ROOM | CAVE_ICKY);
4430 /* Try to add some random doors */
4431 for (i = 0; i < 500; i++)
4433 x = randint1(xsize - 3) - xhsize + x0 + 1;
4434 y = randint1(ysize - 3) - yhsize + y0 + 1;
4438 /* Fill with monsters and treasure, low difficulty */
4439 fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 2, y0 - yhsize + 1, y0 - yhsize + ysize - 2, randint1(5));
4444 * Overlay a rectangular room given its bounds
4445 * This routine is used by build_room_vault
4446 * The area inside the walls is not touched:
4447 * only granite is removed- normal walls stay
4449 static void build_room(int x1, int x2, int y1, int y2)
4451 int x, y, i, xsize, ysize, temp;
4453 /* Check if rectangle has no width */
4454 if ((x1 == x2) || (y1 == y2)) return;
4459 /* Swap boundaries if in wrong order */
4467 /* Swap boundaries if in wrong order */
4473 /* get total widths */
4478 /* Top and bottom boundaries */
4479 for (i = 0; i <= xsize; i++)
4481 place_outer_noperm_bold(y1, x1 + i);
4482 cave[y1][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
4483 place_outer_noperm_bold(y2, x1 + i);
4484 cave[y2][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
4487 /* Left and right boundaries */
4488 for (i = 1; i < ysize; i++)
4490 place_outer_noperm_bold(y1 + i, x1);
4491 cave[y1 + i][x1].info|=(CAVE_ROOM | CAVE_ICKY);
4492 place_outer_noperm_bold(y1 + i, x2);
4493 cave[y1 + i][x2].info|=(CAVE_ROOM | CAVE_ICKY);
4497 for (x = 1; x < xsize; x++)
4499 for (y = 1; y < ysize; y++)
4501 if (is_extra_bold(y1+y, x1+x))
4503 /* clear the untouched region */
4504 place_floor_bold(y1 + y, x1 + x);
4505 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
4509 /* make it a room- but don't touch */
4510 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
4517 /* Create a random vault that looks like a collection of overlapping rooms */
4519 static void build_room_vault(int x0, int y0, int xsize, int ysize)
4521 int i, x1, x2, y1, y2, xhsize, yhsize;
4523 /* get offset from center */
4527 msg_print_wizard(CHEAT_DUNGEON, _("部屋型ランダムVaultを生成しました。", "Room Vault."));
4529 /* fill area so don't get problems with arena levels */
4530 for (x1 = 0; x1 < xsize; x1++)
4532 int x = x0 - xhsize + x1;
4534 for (y1 = 0; y1 < ysize; y1++)
4536 int y = y0 - yhsize + y1;
4538 place_extra_bold(y, x);
4539 cave[y][x].info &= (~CAVE_ICKY);
4543 /* add ten random rooms */
4544 for (i = 0; i < 10; i++)
4546 x1 = randint1(xhsize) * 2 + x0 - xhsize;
4547 x2 = randint1(xhsize) * 2 + x0 - xhsize;
4548 y1 = randint1(yhsize) * 2 + y0 - yhsize;
4549 y2 = randint1(yhsize) * 2 + y0 - yhsize;
4550 build_room(x1, x2, y1, y2);
4553 /* Add some random doors */
4554 for (i = 0; i < 500; i++)
4556 x1 = randint1(xsize - 3) - xhsize + x0 + 1;
4557 y1 = randint1(ysize - 3) - yhsize + y0 + 1;
4561 /* Fill with monsters and treasure, high difficulty */
4562 fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 2, y0 - yhsize + 1, y0 - yhsize + ysize - 2, randint1(5) + 5);
4566 /* Create a random vault out of a fractal cave */
4567 static void build_cave_vault(int x0, int y0, int xsiz, int ysiz)
4569 int grd, roug, cutoff, xhsize, yhsize, xsize, ysize, x, y;
4570 bool done, light, room;
4572 /* round to make sizes even */
4578 msg_print_wizard(CHEAT_DUNGEON, _("洞穴ランダムVaultを生成しました。", "Cave Vault."));
4580 light = done = FALSE;
4585 /* testing values for these parameters feel free to adjust */
4586 grd = 1 << randint0(4);
4588 /* want average of about 16 */
4589 roug = randint1(8) * randint1(4);
4592 cutoff = randint1(xsize / 4) + randint1(ysize / 4) +
4593 randint1(xsize / 4) + randint1(ysize / 4);
4596 generate_hmap(y0, x0, xsize, ysize, grd, roug, cutoff);
4598 /* Convert to normal format+ clean up */
4599 done = generate_fracave(y0, x0, xsize, ysize, cutoff, light, room);
4602 /* Set icky flag because is a vault */
4603 for (x = 0; x <= xsize; x++)
4605 for (y = 0; y <= ysize; y++)
4607 cave[y0 - yhsize + y][x0 - xhsize + x].info |= CAVE_ICKY;
4611 /* Fill with monsters and treasure, low difficulty */
4612 fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 1, y0 - yhsize + 1, y0 - yhsize + ysize - 1, randint1(5));
4616 * maze vault -- rectangular labyrinthine rooms
4618 * maze vault uses two routines:
4619 * r_visit - a recursive routine that builds the labyrinth
4620 * build_maze_vault - a driver routine that calls r_visit and adds
4621 * monsters, traps and treasure
4623 * The labyrinth is built by creating a spanning tree of a graph.
4624 * The graph vertices are at
4625 * (x, y) = (2j + x1, 2k + y1) j = 0,...,m-1 k = 0,...,n-1
4626 * and the edges are the vertical and horizontal nearest neighbors.
4628 * The spanning tree is created by performing a suitably randomized
4629 * depth-first traversal of the graph. The only adjustable parameter
4630 * is the randint0(3) below; it governs the relative density of
4631 * twists and turns in the labyrinth: smaller number, more twists.
4633 static void r_visit(int y1, int x1, int y2, int x2,
4634 int node, int dir, int *visited)
4636 int i, j, m, n, temp, x, y, adj[4];
4638 /* dimensions of vertex array */
4639 m = (x2 - x1) / 2 + 1;
4640 n = (y2 - y1) / 2 + 1;
4642 /* mark node visited and set it to a floor */
4644 x = 2 * (node % m) + x1;
4645 y = 2 * (node / m) + y1;
4646 place_floor_bold(y, x);
4648 /* setup order of adjacent node visits */
4651 /* pick a random ordering */
4652 for (i = 0; i < 4; i++)
4654 for (i = 0; i < 4; i++)
4665 /* pick a random ordering with dir first */
4667 for (i = 1; i < 4; i++)
4669 for (i = 1; i < 4; i++)
4671 j = 1 + randint0(3);
4678 for (i = 0; i < 4; i++)
4683 /* (0,+) - check for bottom boundary */
4684 if ((node / m < n - 1) && (visited[node + m] == 0))
4686 place_floor_bold(y + 1, x);
4687 r_visit(y1, x1, y2, x2, node + m, dir, visited);
4691 /* (0,-) - check for top boundary */
4692 if ((node / m > 0) && (visited[node - m] == 0))
4694 place_floor_bold(y - 1, x);
4695 r_visit(y1, x1, y2, x2, node - m, dir, visited);
4699 /* (+,0) - check for right boundary */
4700 if ((node % m < m - 1) && (visited[node + 1] == 0))
4702 place_floor_bold(y, x + 1);
4703 r_visit(y1, x1, y2, x2, node + 1, dir, visited);
4707 /* (-,0) - check for left boundary */
4708 if ((node % m > 0) && (visited[node - 1] == 0))
4710 place_floor_bold(y, x - 1);
4711 r_visit(y1, x1, y2, x2, node - 1, dir, visited);
4718 void build_maze_vault(int x0, int y0, int xsize, int ysize, bool is_vault)
4722 int m, n, num_vertices, *visited;
4726 msg_print_wizard(CHEAT_DUNGEON, _("迷路ランダムVaultを生成しました。", "Maze Vault."));
4728 /* Choose lite or dark */
4729 light = ((dun_level <= randint1(25)) && is_vault && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
4731 /* Pick a random room size - randomized by calling routine */
4740 /* generate the room */
4741 for (y = y1 - 1; y <= y2 + 1; y++)
4743 for (x = x1 - 1; x <= x2 + 1; x++)
4745 c_ptr = &cave[y][x];
4746 c_ptr->info |= CAVE_ROOM;
4747 if (is_vault) c_ptr->info |= CAVE_ICKY;
4748 if ((x == x1 - 1) || (x == x2 + 1) || (y == y1 - 1) || (y == y2 + 1))
4750 place_outer_grid(c_ptr);
4754 place_extra_grid(c_ptr);
4758 place_inner_grid(c_ptr);
4760 if (light) c_ptr->info |= (CAVE_GLOW);
4764 /* dimensions of vertex array */
4767 num_vertices = m * n;
4769 /* initialize array of visited vertices */
4770 C_MAKE(visited, num_vertices, int);
4772 /* traverse the graph to create a spaning tree, pick a random root */
4773 r_visit(y1, x1, y2, x2, randint0(num_vertices), 0, visited);
4775 /* Fill with monsters and treasure, low difficulty */
4776 if (is_vault) fill_treasure(x1, x2, y1, y2, randint1(5));
4778 C_KILL(visited, num_vertices, int);
4782 /* Build a "mini" checkerboard vault
4784 * This is done by making a permanent wall maze and setting
4785 * the diagonal sqaures of the checker board to be granite.
4786 * The vault has two entrances on opposite sides to guarantee
4787 * a way to get in even if the vault abuts a side of the dungeon.
4789 static void build_mini_c_vault(int x0, int y0, int xsize, int ysize)
4792 int y1, x1, y2, x2, y, x, total;
4793 int m, n, num_vertices;
4796 msg_print_wizard(CHEAT_DUNGEON, _("小型チェッカーランダムVaultを生成しました。", "Mini Checker Board Vault."));
4798 /* Pick a random room size */
4808 /* generate the room */
4809 for (x = x1 - 2; x <= x2 + 2; x++)
4811 if (!in_bounds(y1-2,x)) break;
4813 cave[y1-2][x].info |= (CAVE_ROOM | CAVE_ICKY);
4815 place_outer_noperm_bold(y1-2, x);
4818 for (x = x1 - 2; x <= x2 + 2; x++)
4820 if (!in_bounds(y2+2,x)) break;
4822 cave[y2+2][x].info |= (CAVE_ROOM | CAVE_ICKY);
4824 place_outer_noperm_bold(y2+2, x);
4827 for (y = y1 - 2; y <= y2 + 2; y++)
4829 if (!in_bounds(y,x1-2)) break;
4831 cave[y][x1-2].info |= (CAVE_ROOM | CAVE_ICKY);
4833 place_outer_noperm_bold(y, x1-2);
4836 for (y = y1 - 2; y <= y2 + 2; y++)
4838 if (!in_bounds(y,x2+2)) break;
4840 cave[y][x2+2].info |= (CAVE_ROOM | CAVE_ICKY);
4842 place_outer_noperm_bold(y, x2+2);
4845 for (y = y1 - 1; y <= y2 + 1; y++)
4847 for (x = x1 - 1; x <= x2 + 1; x++)
4849 cave_type *c_ptr = &cave[y][x];
4851 c_ptr->info |= (CAVE_ROOM | CAVE_ICKY);
4853 /* Permanent walls */
4854 place_inner_perm_grid(c_ptr);
4859 /* dimensions of vertex array */
4862 num_vertices = m * n;
4864 /* initialize array of visited vertices */
4865 C_MAKE(visited, num_vertices, int);
4867 /* traverse the graph to create a spannng tree, pick a random root */
4868 r_visit(y1, x1, y2, x2, randint0(num_vertices), 0, visited);
4870 /* Make it look like a checker board vault */
4871 for (x = x1; x <= x2; x++)
4873 for (y = y1; y <= y2; y++)
4875 total = x - x1 + y - y1;
4876 /* If total is odd- and is a floor then make a wall */
4877 if ((total % 2 == 1) && is_floor_bold(y, x))
4879 place_inner_bold(y, x);
4884 /* Make a couple of entrances */
4887 /* left and right */
4888 y = randint1(dy) + dy / 2;
4889 place_inner_bold(y1 + y, x1 - 1);
4890 place_inner_bold(y1 + y, x2 + 1);
4894 /* top and bottom */
4895 x = randint1(dx) + dx / 2;
4896 place_inner_bold(y1 - 1, x1 + x);
4897 place_inner_bold(y2 + 1, x1 + x);
4900 /* Fill with monsters and treasure, highest difficulty */
4901 fill_treasure(x1, x2, y1, y2, 10);
4903 C_KILL(visited, num_vertices, int);
4907 /* Build a town/ castle by using a recursive algorithm.
4908 * Basically divide each region in a probalistic way to create
4909 * smaller regions. When the regions get too small stop.
4911 * The power variable is a measure of how well defended a region is.
4912 * This alters the possible choices.
4914 static void build_recursive_room(int x1, int y1, int x2, int y2, int power)
4920 /* Temp variables */
4926 if ((power < 3) && (xsize > 12) && (ysize > 12))
4928 /* Need outside wall +keep */
4935 /* Make rooms + subdivide */
4936 if ((randint1(10) > 2) && (xsize < 8) && (ysize < 8))
4942 choice = randint1(2) + 1;
4947 /* Mostly subdivide */
4948 choice = randint1(3) + 1;
4952 /* Based on the choice made above, do something */
4960 /* top and bottom */
4961 for (x = x1; x <= x2; x++)
4963 place_outer_bold(y1, x);
4964 place_outer_bold(y2, x);
4967 /* left and right */
4968 for (y = y1 + 1; y < y2; y++)
4970 place_outer_bold(y, x1);
4971 place_outer_bold(y, x2);
4974 /* Make a couple of entrances */
4977 /* left and right */
4978 y = randint1(ysize) + y1;
4979 place_floor_bold(y, x1);
4980 place_floor_bold(y, x2);
4984 /* top and bottom */
4985 x = randint1(xsize) + x1;
4986 place_floor_bold(y1, x);
4987 place_floor_bold(y2, x);
4990 /* Select size of keep */
4991 t1 = randint1(ysize / 3) + y1;
4992 t2 = y2 - randint1(ysize / 3);
4993 t3 = randint1(xsize / 3) + x1;
4994 t4 = x2 - randint1(xsize / 3);
4996 /* Do outside areas */
4998 /* Above and below keep */
4999 build_recursive_room(x1 + 1, y1 + 1, x2 - 1, t1, power + 1);
5000 build_recursive_room(x1 + 1, t2, x2 - 1, y2, power + 1);
5002 /* Left and right of keep */
5003 build_recursive_room(x1 + 1, t1 + 1, t3, t2 - 1, power + 3);
5004 build_recursive_room(t4, t1 + 1, x2 - 1, t2 - 1, power + 3);
5006 /* Make the keep itself: */
5019 /* Try to build a room */
5020 if ((xsize < 3) || (ysize < 3))
5022 for (y = y1; y < y2; y++)
5024 for (x = x1; x < x2; x++)
5026 place_inner_bold(y, x);
5034 /* Make outside walls */
5035 /* top and bottom */
5036 for (x = x1 + 1; x <= x2 - 1; x++)
5038 place_inner_bold(y1 + 1, x);
5039 place_inner_bold(y2 - 1, x);
5042 /* left and right */
5043 for (y = y1 + 1; y <= y2 - 1; y++)
5045 place_inner_bold(y, x1 + 1);
5046 place_inner_bold(y, x2 - 1);
5050 y = randint1(ysize - 3) + y1 + 1;
5055 place_floor_bold(y, x1 + 1);
5060 place_floor_bold(y, x2 - 1);
5063 /* Build the room */
5064 build_recursive_room(x1 + 2, y1 + 2, x2 - 2, y2 - 2, power + 3);
5069 /* Try and divide vertically */
5073 for (y = y1; y < y2; y++)
5075 for (x = x1; x < x2; x++)
5077 place_inner_bold(y, x);
5083 t1 = randint1(xsize - 2) + x1 + 1;
5084 build_recursive_room(x1, y1, t1, y2, power - 2);
5085 build_recursive_room(t1 + 1, y1, x2, y2, power - 2);
5090 /* Try and divide horizontally */
5094 for (y = y1; y < y2; y++)
5096 for (x = x1; x < x2; x++)
5098 place_inner_bold(y, x);
5104 t1 = randint1(ysize - 2) + y1 + 1;
5105 build_recursive_room(x1, y1, x2, t1, power - 2);
5106 build_recursive_room(x1, t1 + 1, x2, y2, power - 2);
5113 /* Build a castle */
5115 /* Driver routine: clear the region and call the recursive
5118 *This makes a vault that looks like a castle/ city in the dungeon.
5120 static void build_castle_vault(int x0, int y0, int xsize, int ysize)
5126 /* Pick a random room size */
5135 msg_print_wizard(CHEAT_DUNGEON, _("城型ランダムVaultを生成しました。", "Castle Vault"));
5137 /* generate the room */
5138 for (y = y1 - 1; y <= y2 + 1; y++)
5140 for (x = x1 - 1; x <= x2 + 1; x++)
5142 cave[y][x].info |= (CAVE_ROOM | CAVE_ICKY);
5143 /* Make everything a floor */
5144 place_floor_bold(y, x);
5148 /* Make the castle */
5149 build_recursive_room(x1, y1, x2, y2, randint1(5));
5151 /* Fill with monsters and treasure, low difficulty */
5152 fill_treasure(x1, x2, y1, y2, randint1(3));
5157 * Add outer wall to a floored region
5158 * Note: no range checking is done so must be inside dungeon
5159 * This routine also stomps on doors
5161 static void add_outer_wall(int x, int y, int light, int x1, int y1, int x2, int y2)
5164 feature_type *f_ptr;
5167 if (!in_bounds(y, x)) return;
5169 c_ptr = &cave[y][x];
5171 /* hack- check to see if square has been visited before
5172 * if so, then exit (use room flag to do this) */
5173 if (c_ptr->info & CAVE_ROOM) return;
5176 c_ptr->info |= CAVE_ROOM;
5178 f_ptr = &f_info[c_ptr->feat];
5180 if (is_floor_bold(y, x))
5182 for (i = -1; i <= 1; i++)
5184 for (j = -1; j <= 1; j++)
5186 if ((x + i >= x1) && (x + i <= x2) &&
5187 (y + j >= y1) && (y + j <= y2))
5189 add_outer_wall(x + i, y + j, light, x1, y1, x2, y2);
5190 if (light) c_ptr->info |= CAVE_GLOW;
5195 else if (is_extra_bold(y, x))
5197 /* Set bounding walls */
5198 place_outer_bold(y, x);
5199 if (light) c_ptr->info |= CAVE_GLOW;
5201 else if (permanent_wall(f_ptr))
5203 /* Set bounding walls */
5204 if (light) c_ptr->info |= CAVE_GLOW;
5210 * Hacked distance formula - gives the 'wrong' answer.
5211 * Used to build crypts
5213 static int dist2(int x1, int y1, int x2, int y2,
5214 int h1, int h2, int h3, int h4)
5220 /* Basically this works by taking the normal pythagorean formula
5221 * and using an expansion to express this in a way without the
5222 * square root. This approximate formula is then perturbed to give
5223 * the distorted results. (I found this by making a mistake when I was
5224 * trying to fix the circular rooms.)
5227 /* h1-h4 are constants that describe the metric */
5228 if (dx >= 2 * dy) return (dx + (dy * h1) / h2);
5229 if (dy >= 2 * dx) return (dy + (dx * h1) / h2);
5230 return (((dx + dy) * 128) / 181 +
5231 (dx * dx / (dy * h3) + dy * dy / (dx * h3)) * h4);
5232 /* 128/181 is approx. 1/sqrt(2) */
5237 * Build target vault.
5238 * This is made by two concentric "crypts" with perpendicular
5239 * walls creating the cross-hairs.
5241 static void build_target_vault(int x0, int y0, int xsize, int ysize)
5245 /* Make a random metric */
5247 h1 = randint1(32) - 16;
5250 h4 = randint1(32) - 16;
5252 msg_print_wizard(CHEAT_DUNGEON, _("対称形ランダムVaultを生成しました。", "Elemental Vault"));
5254 /* work out outer radius */
5265 for (x = x0 - rad; x <= x0 + rad; x++)
5267 for (y = y0 - rad; y <= y0 + rad; y++)
5269 /* clear room flag */
5270 cave[y][x].info &= ~(CAVE_ROOM);
5272 /* Vault - so is "icky" */
5273 cave[y][x].info |= CAVE_ICKY;
5275 if (dist2(y0, x0, y, x, h1, h2, h3, h4) <= rad - 1)
5277 /* inside- so is floor */
5278 place_floor_bold(y, x);
5282 /* make granite outside so arena works */
5283 place_extra_bold(y, x);
5286 /* proper boundary for arena */
5287 if (((y + rad) == y0) || ((y - rad) == y0) ||
5288 ((x + rad) == x0) || ((x - rad) == x0))
5290 place_extra_bold(y, x);
5295 /* Find visible outer walls and set to be FEAT_OUTER */
5296 add_outer_wall(x0, y0, FALSE, x0 - rad - 1, y0 - rad - 1,
5297 x0 + rad + 1, y0 + rad + 1);
5299 /* Add inner wall */
5300 for (x = x0 - rad / 2; x <= x0 + rad / 2; x++)
5302 for (y = y0 - rad / 2; y <= y0 + rad / 2; y++)
5304 if (dist2(y0, x0, y, x, h1, h2, h3, h4) == rad / 2)
5306 /* Make an internal wall */
5307 place_inner_bold(y, x);
5312 /* Add perpendicular walls */
5313 for (x = x0 - rad; x <= x0 + rad; x++)
5315 place_inner_bold(y0, x);
5318 for (y = y0 - rad; y <= y0 + rad; y++)
5320 place_inner_bold(y, x0);
5323 /* Make inner vault */
5324 for (y = y0 - 1; y <= y0 + 1; y++)
5326 place_inner_bold(y, x0 - 1);
5327 place_inner_bold(y, x0 + 1);
5329 for (x = x0 - 1; x <= x0 + 1; x++)
5331 place_inner_bold(y0 - 1, x);
5332 place_inner_bold(y0 + 1, x);
5335 place_floor_bold(y0, x0);
5338 /* Add doors to vault */
5339 /* get two distances so can place doors relative to centre */
5340 x = (rad - 2) / 4 + 1;
5343 add_door(x0 + x, y0);
5344 add_door(x0 + y, y0);
5345 add_door(x0 - x, y0);
5346 add_door(x0 - y, y0);
5347 add_door(x0, y0 + x);
5348 add_door(x0, y0 + y);
5349 add_door(x0, y0 - x);
5350 add_door(x0, y0 - y);
5352 /* Fill with stuff - medium difficulty */
5353 fill_treasure(x0 - rad, x0 + rad, y0 - rad, y0 + rad, randint1(3) + 3);
5357 #ifdef ALLOW_CAVERNS_AND_LAKES
5359 * This routine uses a modified version of the lake code to make a
5360 * distribution of some terrain type over the vault. This type
5361 * depends on the dungeon depth.
5363 * Miniture rooms are then scattered across the vault.
5365 static void build_elemental_vault(int x0, int y0, int xsiz, int ysiz)
5370 int xsize, ysize, xhsize, yhsize, x, y, i;
5373 msg_print_wizard(CHEAT_DUNGEON, _("精霊界ランダムVaultを生成しました。", "Elemental Vault"));
5375 /* round to make sizes even */
5383 /* Earth vault (Rubble) */
5384 type = LAKE_T_EARTH_VAULT;
5386 else if (dun_level < 50)
5388 /* Air vault (Trees) */
5389 type = LAKE_T_AIR_VAULT;
5391 else if (dun_level < 75)
5393 /* Water vault (shallow water) */
5394 type = LAKE_T_WATER_VAULT;
5398 /* Fire vault (shallow lava) */
5399 type = LAKE_T_FIRE_VAULT;
5404 /* testing values for these parameters: feel free to adjust */
5405 grd = 1 << (randint0(3));
5407 /* want average of about 16 */
5408 roug = randint1(8) * randint1(4);
5410 /* Make up size of various componants */
5414 /* Deep water/lava */
5415 c1 = randint0(c3 / 2) + randint0(c3 / 2) - 5;
5417 /* Shallow boundary */
5421 generate_hmap(y0, x0, xsize, ysize, grd, roug, c3);
5423 /* Convert to normal format+ clean up */
5424 done = generate_lake(y0, x0, xsize, ysize, c1, c2, c3, type);
5427 /* Set icky flag because is a vault */
5428 for (x = 0; x <= xsize; x++)
5430 for (y = 0; y <= ysize; y++)
5432 cave[y0 - yhsize + y][x0 - xhsize + x].info |= CAVE_ICKY;
5436 /* make a few rooms in the vault */
5437 for (i = 1; i <= (xsize * ysize) / 50; i++)
5439 build_small_room(x0 + randint0(xsize - 4) - xsize / 2 + 2,
5440 y0 + randint0(ysize - 4) - ysize / 2 + 2);
5443 /* Fill with monsters and treasure, low difficulty */
5444 fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 1,
5445 y0 - yhsize + 1, y0 - yhsize + ysize - 1, randint1(5));
5447 #endif /* ALLOW_CAVERNS_AND_LAKES */
5451 * @brief タイプ10の部屋…ランダム生成vault / Type 10 -- Random vaults
5454 static bool build_type10(void)
5456 int y0, x0, xsize, ysize, vtype;
5459 /* big enough to look good, small enough to be fairly common. */
5460 xsize = randint1(22) + 22;
5461 ysize = randint1(11) + 11;
5463 /* Find and reserve some space in the dungeon. Get center of room. */
5464 if (!find_space(&y0, &x0, ysize + 1, xsize + 1)) return FALSE;
5466 /* Select type of vault */
5467 #ifdef ALLOW_CAVERNS_AND_LAKES
5470 vtype = randint1(15);
5472 while ((d_info[dungeon_type].flags1 & DF1_NO_CAVE) &&
5473 ((vtype == 1) || (vtype == 3) || (vtype == 8) || (vtype == 9) || (vtype == 11)));
5474 #else /* ALLOW_CAVERNS_AND_LAKES */
5477 vtype = randint1(7);
5479 while ((d_info[dungeon_type].flags1 & DF1_NO_CAVE) &&
5480 ((vtype == 1) || (vtype == 3)));
5481 #endif /* ALLOW_CAVERNS_AND_LAKES */
5485 /* Build an appropriate room */
5486 case 1: case 9: build_bubble_vault(x0, y0, xsize, ysize); break;
5487 case 2: case 10: build_room_vault(x0, y0, xsize, ysize); break;
5488 case 3: case 11: build_cave_vault(x0, y0, xsize, ysize); break;
5489 case 4: case 12: build_maze_vault(x0, y0, xsize, ysize, TRUE); break;
5490 case 5: case 13: build_mini_c_vault(x0, y0, xsize, ysize); break;
5491 case 6: case 14: build_castle_vault(x0, y0, xsize, ysize); break;
5492 case 7: case 15: build_target_vault(x0, y0, xsize, ysize); break;
5493 #ifdef ALLOW_CAVERNS_AND_LAKES
5494 case 8: build_elemental_vault(x0, y0, xsize, ysize); break;
5495 #endif /* ALLOW_CAVERNS_AND_LAKES */
5496 /* I know how to add a few more... give me some time. */
5499 default: return FALSE;
5507 * @brief タイプ11の部屋…円形部屋の生成 / Type 11 -- Build an vertical oval room.
5510 * For every grid in the possible square, check the distance.\n
5511 * If it's less than the radius, make it a room square.\n
5513 * When done fill from the inside to find the walls,\n
5515 static bool build_type11(void)
5517 int rad, x, y, x0, y0;
5520 /* Occasional light */
5521 if ((randint1(dun_level) <= 15) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
5525 /* Find and reserve some space in the dungeon. Get center of room. */
5526 if (!find_space(&y0, &x0, rad * 2 + 1, rad * 2 + 1)) return FALSE;
5528 /* Make circular floor */
5529 for (x = x0 - rad; x <= x0 + rad; x++)
5531 for (y = y0 - rad; y <= y0 + rad; y++)
5533 if (distance(y0, x0, y, x) <= rad - 1)
5535 /* inside- so is floor */
5536 place_floor_bold(y, x);
5538 else if (distance(y0, x0, y, x) <= rad + 1)
5540 /* make granite outside so arena works */
5541 place_extra_bold(y, x);
5546 /* Find visible outer walls and set to be FEAT_OUTER */
5547 add_outer_wall(x0, y0, light, x0 - rad, y0 - rad, x0 + rad, y0 + rad);
5554 * @brief タイプ12の部屋…ドーム型部屋の生成 / Type 12 -- Build crypt room.
5557 * For every grid in the possible square, check the (fake) distance.\n
5558 * If it's less than the radius, make it a room square.\n
5560 * When done fill from the inside to find the walls,\n
5562 static bool build_type12(void)
5564 int rad, x, y, x0, y0;
5566 bool emptyflag = TRUE;
5568 /* Make a random metric */
5570 h1 = randint1(32) - 16;
5573 h4 = randint1(32) - 16;
5575 /* Occasional light */
5576 if ((randint1(dun_level) <= 5) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
5580 /* Find and reserve some space in the dungeon. Get center of room. */
5581 if (!find_space(&y0, &x0, rad * 2 + 3, rad * 2 + 3)) return FALSE;
5584 for (x = x0 - rad; x <= x0 + rad; x++)
5586 for (y = y0 - rad; y <= y0 + rad; y++)
5588 /* clear room flag */
5589 cave[y][x].info &= ~(CAVE_ROOM);
5591 if (dist2(y0, x0, y, x, h1, h2, h3, h4) <= rad - 1)
5593 /* inside - so is floor */
5594 place_floor_bold(y, x);
5596 else if (distance(y0, x0, y, x) < 3)
5598 place_floor_bold(y, x);
5602 /* make granite outside so arena works */
5603 place_extra_bold(y, x);
5606 /* proper boundary for arena */
5607 if (((y + rad) == y0) || ((y - rad) == y0) ||
5608 ((x + rad) == x0) || ((x - rad) == x0))
5610 place_extra_bold(y, x);
5615 /* Find visible outer walls and set to be FEAT_OUTER */
5616 add_outer_wall(x0, y0, light, x0 - rad - 1, y0 - rad - 1,
5617 x0 + rad + 1, y0 + rad + 1);
5619 /* Check to see if there is room for an inner vault */
5620 for (x = x0 - 2; x <= x0 + 2; x++)
5622 for (y = y0 - 2; y <= y0 + 2; y++)
5624 if (!is_floor_bold(y, x))
5626 /* Wall in the way */
5632 if (emptyflag && one_in_(2))
5634 /* Build the vault */
5635 build_small_room(x0, y0);
5637 /* Place a treasure in the vault */
5638 place_object(y0, x0, 0L);
5640 /* Let's guard the treasure well */
5641 vault_monsters(y0, x0, randint0(2) + 3);
5643 /* Traps naturally */
5644 vault_traps(y0, x0, 4, 4, randint0(3) + 2);
5652 * Helper function for "trapped monster pit"
5654 static bool vault_aux_trapped_pit(int r_idx)
5656 monster_race *r_ptr = &r_info[r_idx];
5658 /* Validate the monster */
5659 if (!vault_monster_okay(r_idx)) return (FALSE);
5661 /* No wall passing monster */
5662 if (r_ptr->flags2 & (RF2_PASS_WALL | RF2_KILL_WALL)) return (FALSE);
5670 * @brief タイプ13の部屋…トラップpitの生成 / Type 13 -- Trapped monster pits
5673 * A trapped monster pit is a "big" room with a straight corridor in\n
5674 * which wall opening traps are placed, and with two "inner" rooms\n
5675 * containing a "collection" of monsters of a given type organized in\n
5678 * The trapped monster pit appears as shown below, where the actual\n
5679 * monsters in each location depend on the type of the pit\n
5681 * XXXXXXXXXXXXXXXXXXXXXXXXX\n
5683 * XXXXXXXXXXXXXXXXXXXXXXX X\n
5684 * XXXXX001123454321100XXX X\n
5685 * XXX0012234567654322100X X\n
5686 * XXXXXXXXXXXXXXXXXXXXXXX X\n
5688 * X XXXXXXXXXXXXXXXXXXXXXXX\n
5689 * X X0012234567654322100XXX\n
5690 * X XXX001123454321100XXXXX\n
5691 * X XXXXXXXXXXXXXXXXXXXXXXX\n
5693 * XXXXXXXXXXXXXXXXXXXXXXXXX\n
5695 * Note that the monsters in the pit are now chosen by using "get_mon_num()"\n
5696 * to request 16 "appropriate" monsters, sorting them by level, and using\n
5697 * the "even" entries in this sorted list for the contents of the pit.\n
5699 * Hack -- all of the "dragons" in a "dragon" pit must be the same "color",\n
5700 * which is handled by requiring a specific "breath" attack for all of the\n
5701 * dragons. This may include "multi-hued" breath. Note that "wyrms" may\n
5702 * be present in many of the dragon pits, if they have the proper breath.\n
5704 * Note the use of the "get_mon_num_prep()" function, and the special\n
5705 * "get_mon_num_hook()" restriction function, to prepare the "monster\n
5706 * allocation table" in such a way as to optimize the selection of\n
5707 * "appropriate" non-unique monsters for the pit.\n
5709 * Note that the "get_mon_num()" function may (rarely) fail, in which case\n
5710 * the pit will be empty.\n
5712 * Note that "monster pits" will never contain "unique" monsters.\n
5714 static bool build_type13(void)
5716 static int placing[][3] = {
5717 {-2, -9, 0}, {-2, -8, 0}, {-3, -7, 0}, {-3, -6, 0},
5718 {+2, -9, 0}, {+2, -8, 0}, {+3, -7, 0}, {+3, -6, 0},
5719 {-2, +9, 0}, {-2, +8, 0}, {-3, +7, 0}, {-3, +6, 0},
5720 {+2, +9, 0}, {+2, +8, 0}, {+3, +7, 0}, {+3, +6, 0},
5721 {-2, -7, 1}, {-3, -5, 1}, {-3, -4, 1},
5722 {+2, -7, 1}, {+3, -5, 1}, {+3, -4, 1},
5723 {-2, +7, 1}, {-3, +5, 1}, {-3, +4, 1},
5724 {+2, +7, 1}, {+3, +5, 1}, {+3, +4, 1},
5725 {-2, -6, 2}, {-2, -5, 2}, {-3, -3, 2},
5726 {+2, -6, 2}, {+2, -5, 2}, {+3, -3, 2},
5727 {-2, +6, 2}, {-2, +5, 2}, {-3, +3, 2},
5728 {+2, +6, 2}, {+2, +5, 2}, {+3, +3, 2},
5729 {-2, -4, 3}, {-3, -2, 3},
5730 {+2, -4, 3}, {+3, -2, 3},
5731 {-2, +4, 3}, {-3, +2, 3},
5732 {+2, +4, 3}, {+3, +2, 3},
5733 {-2, -3, 4}, {-3, -1, 4},
5734 {+2, -3, 4}, {+3, -1, 4},
5735 {-2, +3, 4}, {-3, +1, 4},
5736 {+2, +3, 4}, {+3, +1, 4},
5737 {-2, -2, 5}, {-3, 0, 5}, {-2, +2, 5},
5738 {+2, -2, 5}, {+3, 0, 5}, {+2, +2, 5},
5739 {-2, -1, 6}, {-2, +1, 6},
5740 {+2, -1, 6}, {+2, +1, 6},
5741 {-2, 0, 7}, {+2, 0, 7},
5745 int y, x, y1, x1, y2, x2, xval, yval;
5754 int cur_pit_type = pick_vault_type(pit_types, d_info[dungeon_type].pit);
5755 vault_aux_type *n_ptr;
5757 /* Only in Angband */
5758 if (dungeon_type != DUNGEON_ANGBAND) return FALSE;
5760 /* No type available */
5761 if (cur_pit_type < 0) return FALSE;
5763 n_ptr = &pit_types[cur_pit_type];
5765 /* Process a preparation function if necessary */
5766 if (n_ptr->prep_func) (*(n_ptr->prep_func))();
5768 /* Prepare allocation table */
5769 get_mon_num_prep(n_ptr->hook_func, vault_aux_trapped_pit);
5771 align.sub_align = SUB_ALIGN_NEUTRAL;
5773 /* Pick some monster types */
5774 for (i = 0; i < 16; i++)
5776 int r_idx = 0, attempts = 100;
5777 monster_race *r_ptr = NULL;
5781 /* Get a (hard) monster type */
5782 r_idx = get_mon_num(dun_level + 0);
5783 r_ptr = &r_info[r_idx];
5785 /* Decline incorrect alignment */
5786 if (monster_has_hostile_align(&align, 0, 0, r_ptr)) continue;
5788 /* Accept this monster */
5792 /* Notice failure */
5793 if (!r_idx || !attempts) return FALSE;
5795 /* Note the alignment */
5796 if (r_ptr->flags3 & RF3_EVIL) align.sub_align |= SUB_ALIGN_EVIL;
5797 if (r_ptr->flags3 & RF3_GOOD) align.sub_align |= SUB_ALIGN_GOOD;
5802 /* Find and reserve some space in the dungeon. Get center of room. */
5803 if (!find_space(&yval, &xval, 13, 25)) return FALSE;
5811 /* Fill with inner walls */
5812 for (y = y1 - 1; y <= y2 + 1; y++)
5814 for (x = x1 - 1; x <= x2 + 1; x++)
5816 c_ptr = &cave[y][x];
5817 place_inner_grid(c_ptr);
5818 c_ptr->info |= (CAVE_ROOM);
5822 /* Place the floor area 1 */
5823 for (x = x1 + 3; x <= x2 - 3; x++)
5825 c_ptr = &cave[yval-2][x];
5826 place_floor_grid(c_ptr);
5827 add_cave_info(yval-2, x, CAVE_ICKY);
5829 c_ptr = &cave[yval+2][x];
5830 place_floor_grid(c_ptr);
5831 add_cave_info(yval+2, x, CAVE_ICKY);
5834 /* Place the floor area 2 */
5835 for (x = x1 + 5; x <= x2 - 5; x++)
5837 c_ptr = &cave[yval-3][x];
5838 place_floor_grid(c_ptr);
5839 add_cave_info(yval-3, x, CAVE_ICKY);
5841 c_ptr = &cave[yval+3][x];
5842 place_floor_grid(c_ptr);
5843 add_cave_info(yval+3, x, CAVE_ICKY);
5847 for (x = x1; x <= x2; x++)
5849 c_ptr = &cave[yval][x];
5850 place_floor_grid(c_ptr);
5851 c_ptr = &cave[y1][x];
5852 place_floor_grid(c_ptr);
5853 c_ptr = &cave[y2][x];
5854 place_floor_grid(c_ptr);
5857 /* Place the outer walls */
5858 for (y = y1 - 1; y <= y2 + 1; y++)
5860 c_ptr = &cave[y][x1 - 1];
5861 place_outer_grid(c_ptr);
5862 c_ptr = &cave[y][x2 + 1];
5863 place_outer_grid(c_ptr);
5865 for (x = x1 - 1; x <= x2 + 1; x++)
5867 c_ptr = &cave[y1 - 1][x];
5868 place_outer_grid(c_ptr);
5869 c_ptr = &cave[y2 + 1][x];
5870 place_outer_grid(c_ptr);
5873 /* Random corridor */
5876 for (y = y1; y <= yval; y++)
5878 place_floor_bold(y, x2);
5879 place_solid_bold(y, x1-1);
5881 for (y = yval; y <= y2 + 1; y++)
5883 place_floor_bold(y, x1);
5884 place_solid_bold(y, x2+1);
5889 for (y = yval; y <= y2 + 1; y++)
5891 place_floor_bold(y, x1);
5892 place_solid_bold(y, x2+1);
5894 for (y = y1; y <= yval; y++)
5896 place_floor_bold(y, x2);
5897 place_solid_bold(y, x1-1);
5901 /* Place the wall open trap */
5902 cave[yval][xval].mimic = cave[yval][xval].feat;
5903 cave[yval][xval].feat = feat_trap_open;
5905 /* Sort the entries */
5906 for (i = 0; i < 16 - 1; i++)
5908 /* Sort the entries */
5909 for (j = 0; j < 16 - 1; j++)
5914 int p1 = r_info[what[i1]].level;
5915 int p2 = r_info[what[i2]].level;
5921 what[i1] = what[i2];
5927 msg_format_wizard(CHEAT_DUNGEON, _("%s%sの罠ピットが生成されました。", "Trapped monster pit (%s%s)"),
5928 n_ptr->name, pit_subtype_string(cur_pit_type, FALSE));
5930 /* Select the entries */
5931 for (i = 0; i < 8; i++)
5933 /* Every other entry */
5934 what[i] = what[i * 2];
5939 msg_print(r_name + r_info[what[i]].name);
5943 for (i = 0; placing[i][2] >= 0; i++)
5945 y = yval + placing[i][0];
5946 x = xval + placing[i][1];
5947 place_monster_aux(0, y, x, what[placing[i][2]], PM_NO_KAGE);
5955 * @brief タイプ14の部屋…特殊トラップ部屋の生成 / Type 14 -- trapped rooms
5958 * A special trap is placed at center of the room
5960 static bool build_type14(void)
5962 int y, x, y2, x2, yval, xval;
5963 int y1, x1, xsize, ysize;
5970 /* Pick a room size */
5976 xsize = x1 + x2 + 1;
5977 ysize = y1 + y2 + 1;
5979 /* Find and reserve some space in the dungeon. Get center of room. */
5980 if (!find_space(&yval, &xval, ysize + 2, xsize + 2)) return FALSE;
5982 /* Choose lite or dark */
5983 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
5986 /* Get corner values */
5987 y1 = yval - ysize / 2;
5988 x1 = xval - xsize / 2;
5989 y2 = yval + (ysize - 1) / 2;
5990 x2 = xval + (xsize - 1) / 2;
5993 /* Place a full floor under the room */
5994 for (y = y1 - 1; y <= y2 + 1; y++)
5996 for (x = x1 - 1; x <= x2 + 1; x++)
5998 c_ptr = &cave[y][x];
5999 place_floor_grid(c_ptr);
6000 c_ptr->info |= (CAVE_ROOM);
6001 if (light) c_ptr->info |= (CAVE_GLOW);
6005 /* Walls around the room */
6006 for (y = y1 - 1; y <= y2 + 1; y++)
6008 c_ptr = &cave[y][x1 - 1];
6009 place_outer_grid(c_ptr);
6010 c_ptr = &cave[y][x2 + 1];
6011 place_outer_grid(c_ptr);
6013 for (x = x1 - 1; x <= x2 + 1; x++)
6015 c_ptr = &cave[y1 - 1][x];
6016 place_outer_grid(c_ptr);
6017 c_ptr = &cave[y2 + 1][x];
6018 place_outer_grid(c_ptr);
6021 if (dun_level < 30 + randint1(30))
6022 trap = feat_trap_piranha;
6024 trap = feat_trap_armageddon;
6026 /* Place a special trap */
6027 c_ptr = &cave[rand_spread(yval, ysize/4)][rand_spread(xval, xsize/4)];
6028 c_ptr->mimic = c_ptr->feat;
6031 msg_format_wizard(CHEAT_DUNGEON, _("%sの部屋が生成されました。", "Room of %s was generated."), f_name + f_info[trap].name);
6038 * Helper function for "glass room"
6040 static bool vault_aux_lite(int r_idx)
6042 monster_race *r_ptr = &r_info[r_idx];
6044 /* Validate the monster */
6045 if (!vault_monster_okay(r_idx)) return FALSE;
6047 /* Require lite attack */
6048 if (!(r_ptr->flags4 & RF4_BR_LITE) && !(r_ptr->a_ability_flags1 & RF5_BA_LITE)) return FALSE;
6050 /* No wall passing monsters */
6051 if (r_ptr->flags2 & (RF2_PASS_WALL | RF2_KILL_WALL)) return FALSE;
6053 /* No disintegrating monsters */
6054 if (r_ptr->flags4 & RF4_BR_DISI) return FALSE;
6060 * Helper function for "glass room"
6062 static bool vault_aux_shards(int r_idx)
6064 monster_race *r_ptr = &r_info[r_idx];
6066 /* Validate the monster */
6067 if (!vault_monster_okay(r_idx)) return FALSE;
6069 /* Require shards breath attack */
6070 if (!(r_ptr->flags4 & RF4_BR_SHAR)) return FALSE;
6076 * Hack -- determine if a template is potion
6078 static bool kind_is_potion(int k_idx)
6080 return k_info[k_idx].tval == TV_POTION;
6084 * @brief タイプ15の部屋…ガラス部屋の生成 / Type 15 -- glass rooms
6087 static bool build_type15(void)
6089 int y, x, y2, x2, yval, xval;
6090 int y1, x1, xsize, ysize;
6095 /* Pick a room size */
6096 xsize = rand_range(9, 13);
6097 ysize = rand_range(9, 13);
6099 /* Find and reserve some space in the dungeon. Get center of room. */
6100 if (!find_space(&yval, &xval, ysize + 2, xsize + 2)) return FALSE;
6102 /* Choose lite or dark */
6103 light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
6105 /* Get corner values */
6106 y1 = yval - ysize / 2;
6107 x1 = xval - xsize / 2;
6108 y2 = yval + (ysize - 1) / 2;
6109 x2 = xval + (xsize - 1) / 2;
6111 /* Place a full floor under the room */
6112 for (y = y1 - 1; y <= y2 + 1; y++)
6114 for (x = x1 - 1; x <= x2 + 1; x++)
6116 c_ptr = &cave[y][x];
6117 place_floor_grid(c_ptr);
6118 c_ptr->feat = feat_glass_floor;
6119 c_ptr->info |= (CAVE_ROOM);
6120 if (light) c_ptr->info |= (CAVE_GLOW);
6124 /* Walls around the room */
6125 for (y = y1 - 1; y <= y2 + 1; y++)
6127 c_ptr = &cave[y][x1 - 1];
6128 place_outer_grid(c_ptr);
6129 c_ptr->feat = feat_glass_wall;
6130 c_ptr = &cave[y][x2 + 1];
6131 place_outer_grid(c_ptr);
6132 c_ptr->feat = feat_glass_wall;
6134 for (x = x1 - 1; x <= x2 + 1; x++)
6136 c_ptr = &cave[y1 - 1][x];
6137 place_outer_grid(c_ptr);
6138 c_ptr->feat = feat_glass_wall;
6139 c_ptr = &cave[y2 + 1][x];
6140 place_outer_grid(c_ptr);
6141 c_ptr->feat = feat_glass_wall;
6144 switch (randint1(3))
6146 case 1: /* 4 lite breathers + potion */
6150 /* Prepare allocation table */
6151 get_mon_num_prep(vault_aux_lite, NULL);
6153 /* Place fixed lite berathers */
6154 for (dir1 = 4; dir1 < 8; dir1++)
6156 int r_idx = get_mon_num(dun_level);
6158 y = yval + 2 * ddy_ddd[dir1];
6159 x = xval + 2 * ddx_ddd[dir1];
6160 if (r_idx) place_monster_aux(0, y, x, r_idx, PM_ALLOW_SLEEP);
6162 /* Walls around the breather */
6163 for (dir2 = 0; dir2 < 8; dir2++)
6165 c_ptr = &cave[y + ddy_ddd[dir2]][x + ddx_ddd[dir2]];
6166 place_inner_grid(c_ptr);
6167 c_ptr->feat = feat_glass_wall;
6171 /* Walls around the potion */
6172 for (dir1 = 0; dir1 < 4; dir1++)
6174 y = yval + 2 * ddy_ddd[dir1];
6175 x = xval + 2 * ddx_ddd[dir1];
6176 c_ptr = &cave[y][x];
6177 place_inner_perm_grid(c_ptr);
6178 c_ptr->feat = feat_permanent_glass_wall;
6179 cave[yval + ddy_ddd[dir1]][xval + ddx_ddd[dir1]].info |= (CAVE_ICKY);
6184 y = yval + 2 * ddy_ddd[dir1];
6185 x = xval + 2 * ddx_ddd[dir1];
6186 place_secret_door(y, x, DOOR_GLASS_DOOR);
6187 c_ptr = &cave[y][x];
6188 if (is_closed_door(c_ptr->feat)) c_ptr->mimic = feat_glass_wall;
6190 /* Place a potion */
6191 get_obj_num_hook = kind_is_potion;
6192 place_object(yval, xval, AM_NO_FIXED_ART);
6193 cave[yval][xval].info |= (CAVE_ICKY);
6197 case 2: /* 1 lite breather + random object */
6202 c_ptr = &cave[y1 + 1][x1 + 1];
6203 place_inner_grid(c_ptr);
6204 c_ptr->feat = feat_glass_wall;
6206 c_ptr = &cave[y1 + 1][x2 - 1];
6207 place_inner_grid(c_ptr);
6208 c_ptr->feat = feat_glass_wall;
6210 c_ptr = &cave[y2 - 1][x1 + 1];
6211 place_inner_grid(c_ptr);
6212 c_ptr->feat = feat_glass_wall;
6214 c_ptr = &cave[y2 - 1][x2 - 1];
6215 place_inner_grid(c_ptr);
6216 c_ptr->feat = feat_glass_wall;
6218 /* Prepare allocation table */
6219 get_mon_num_prep(vault_aux_lite, NULL);
6221 r_idx = get_mon_num(dun_level);
6222 if (r_idx) place_monster_aux(0, yval, xval, r_idx, 0L);
6224 /* Walls around the breather */
6225 for (dir1 = 0; dir1 < 8; dir1++)
6227 c_ptr = &cave[yval + ddy_ddd[dir1]][xval + ddx_ddd[dir1]];
6228 place_inner_grid(c_ptr);
6229 c_ptr->feat = feat_glass_wall;
6232 /* Curtains around the breather */
6233 for (y = yval - 1; y <= yval + 1; y++)
6235 place_closed_door(y, xval - 2, DOOR_CURTAIN);
6236 place_closed_door(y, xval + 2, DOOR_CURTAIN);
6238 for (x = xval - 1; x <= xval + 1; x++)
6240 place_closed_door(yval - 2, x, DOOR_CURTAIN);
6241 place_closed_door(yval + 2, x, DOOR_CURTAIN);
6244 /* Place an object */
6245 place_object(yval, xval, AM_NO_FIXED_ART);
6246 cave[yval][xval].info |= (CAVE_ICKY);
6250 case 3: /* 4 shards breathers + 2 potions */
6254 /* Walls around the potion */
6255 for (y = yval - 2; y <= yval + 2; y++)
6257 c_ptr = &cave[y][xval - 3];
6258 place_inner_grid(c_ptr);
6259 c_ptr->feat = feat_glass_wall;
6260 c_ptr = &cave[y][xval + 3];
6261 place_inner_grid(c_ptr);
6262 c_ptr->feat = feat_glass_wall;
6264 for (x = xval - 2; x <= xval + 2; x++)
6266 c_ptr = &cave[yval - 3][x];
6267 place_inner_grid(c_ptr);
6268 c_ptr->feat = feat_glass_wall;
6269 c_ptr = &cave[yval + 3][x];
6270 place_inner_grid(c_ptr);
6271 c_ptr->feat = feat_glass_wall;
6273 for (dir1 = 4; dir1 < 8; dir1++)
6275 c_ptr = &cave[yval + 2 * ddy_ddd[dir1]][xval + 2 * ddx_ddd[dir1]];
6276 place_inner_grid(c_ptr);
6277 c_ptr->feat = feat_glass_wall;
6280 /* Prepare allocation table */
6281 get_mon_num_prep(vault_aux_shards, NULL);
6283 /* Place shard berathers */
6284 for (dir1 = 4; dir1 < 8; dir1++)
6286 int r_idx = get_mon_num(dun_level);
6288 y = yval + ddy_ddd[dir1];
6289 x = xval + ddx_ddd[dir1];
6290 if (r_idx) place_monster_aux(0, y, x, r_idx, 0L);
6293 /* Place two potions */
6296 get_obj_num_hook = kind_is_potion;
6297 place_object(yval, xval - 1, AM_NO_FIXED_ART);
6298 get_obj_num_hook = kind_is_potion;
6299 place_object(yval, xval + 1, AM_NO_FIXED_ART);
6303 get_obj_num_hook = kind_is_potion;
6304 place_object(yval - 1, xval, AM_NO_FIXED_ART);
6305 get_obj_num_hook = kind_is_potion;
6306 place_object(yval + 1, xval, AM_NO_FIXED_ART);
6309 for (y = yval - 2; y <= yval + 2; y++)
6310 for (x = xval - 2; x <= xval + 2; x++)
6311 cave[y][x].info |= (CAVE_ICKY);
6317 msg_print_wizard(CHEAT_DUNGEON, _("ガラスの部屋が生成されました。", "Glass room was generated."));
6323 /* Create a new floor room with optional light */
6324 void generate_room_floor(int y1, int x1, int y2, int x2, int light)
6330 for (y = y1; y <= y2; y++)
6332 for (x = x1; x <= x2; x++)
6335 c_ptr = &cave[y][x];
6336 place_floor_grid(c_ptr);
6337 c_ptr->info |= (CAVE_ROOM);
6338 if (light) c_ptr->info |= (CAVE_GLOW);
6343 void generate_fill_perm_bold(int y1, int x1, int y2, int x2)
6347 for (y = y1; y <= y2; y++)
6349 for (x = x1; x <= x2; x++)
6352 place_inner_perm_bold(y, x);
6357 /* Minimum & maximum town size */
6358 #define MIN_TOWN_WID ((MAX_WID / 3) / 2)
6359 #define MIN_TOWN_HGT ((MAX_HGT / 3) / 2)
6360 #define MAX_TOWN_WID ((MAX_WID / 3) * 2 / 3)
6361 #define MAX_TOWN_HGT ((MAX_HGT / 3) * 2 / 3)
6363 /* Struct for build underground buildings */
6366 int y0, x0; /* North-west corner (relative) */
6367 int y1, x1; /* South-east corner (relative) */
6371 ugbldg_type *ugbldg;
6374 * Precalculate buildings' location of underground arcade
6376 static bool precalc_ugarcade(int town_hgt, int town_wid, int n)
6378 int i, y, x, center_y, center_x, tmp, attempt = 10000;
6379 int max_bldg_hgt = 3 * town_hgt / MAX_TOWN_HGT;
6380 int max_bldg_wid = 5 * town_wid / MAX_TOWN_WID;
6381 ugbldg_type *cur_ugbldg;
6382 bool **ugarcade_used, abort;
6384 /* Allocate "ugarcade_used" array (2-dimension) */
6385 C_MAKE(ugarcade_used, town_hgt, bool *);
6386 C_MAKE(*ugarcade_used, town_hgt * town_wid, bool);
6387 for (y = 1; y < town_hgt; y++) ugarcade_used[y] = *ugarcade_used + y * town_wid;
6389 /* Calculate building locations */
6390 for (i = 0; i < n; i++)
6392 cur_ugbldg = &ugbldg[i];
6393 (void)WIPE(cur_ugbldg, ugbldg_type);
6397 /* Find the "center" of the store */
6398 center_y = rand_range(2, town_hgt - 3);
6399 center_x = rand_range(2, town_wid - 3);
6401 /* Determine the store boundaries */
6402 tmp = center_y - randint1(max_bldg_hgt);
6403 cur_ugbldg->y0 = MAX(tmp, 1);
6404 tmp = center_x - randint1(max_bldg_wid);
6405 cur_ugbldg->x0 = MAX(tmp, 1);
6406 tmp = center_y + randint1(max_bldg_hgt);
6407 cur_ugbldg->y1 = MIN(tmp, town_hgt - 2);
6408 tmp = center_x + randint1(max_bldg_wid);
6409 cur_ugbldg->x1 = MIN(tmp, town_wid - 2);
6411 /* Scan this building's area */
6412 for (abort = FALSE, y = cur_ugbldg->y0; (y <= cur_ugbldg->y1) && !abort; y++)
6414 for (x = cur_ugbldg->x0; x <= cur_ugbldg->x1; x++)
6416 if (ugarcade_used[y][x])
6426 while (abort && attempt); /* Accept this building if no overlapping */
6428 /* Failed to generate underground arcade */
6429 if (!attempt) break;
6432 * Mark to ugarcade_used[][] as "used"
6433 * Note: Building-adjacent grids are included for preventing
6434 * connected bulidings.
6436 for (y = cur_ugbldg->y0 - 1; y <= cur_ugbldg->y1 + 1; y++)
6438 for (x = cur_ugbldg->x0 - 1; x <= cur_ugbldg->x1 + 1; x++)
6440 ugarcade_used[y][x] = TRUE;
6445 /* Free "ugarcade_used" array (2-dimension) */
6446 C_KILL(*ugarcade_used, town_hgt * town_wid, bool);
6447 C_KILL(ugarcade_used, town_hgt, bool *);
6449 /* If i < n, generation is not allowed */
6454 * @brief タイプ16の部屋…地下都市生成のサブルーチン / Actually create buildings
6456 * @param ltcy 生成基準Y座標
6457 * @param ltcx 生成基準X座標
6458 * @param stotes[] 生成する店舗のリスト
6461 * Note: ltcy and ltcx indicate "left top corner".
6463 static void build_stores(int ltcy, int ltcx, int stores[], int n)
6466 ugbldg_type *cur_ugbldg;
6468 for (i = 0; i < n; i++)
6470 cur_ugbldg = &ugbldg[i];
6472 /* Generate new room */
6473 generate_room_floor(
6474 ltcy + cur_ugbldg->y0 - 2, ltcx + cur_ugbldg->x0 - 2,
6475 ltcy + cur_ugbldg->y1 + 2, ltcx + cur_ugbldg->x1 + 2,
6479 for (i = 0; i < n; i++)
6481 cur_ugbldg = &ugbldg[i];
6483 /* Build an invulnerable rectangular building */
6484 generate_fill_perm_bold(
6485 ltcy + cur_ugbldg->y0, ltcx + cur_ugbldg->x0,
6486 ltcy + cur_ugbldg->y1, ltcx + cur_ugbldg->x1);
6488 /* Pick a door direction (S,N,E,W) */
6489 switch (randint0(4))
6494 x = rand_range(cur_ugbldg->x0, cur_ugbldg->x1);
6500 x = rand_range(cur_ugbldg->x0, cur_ugbldg->x1);
6505 y = rand_range(cur_ugbldg->y0, cur_ugbldg->y1);
6511 y = rand_range(cur_ugbldg->y0, cur_ugbldg->y1);
6516 for (j = 0; j < max_f_idx; j++)
6518 if (have_flag(f_info[j].flags, FF_STORE))
6520 if (f_info[j].subtype == stores[i]) break;
6524 /* Clear previous contents, add a store door */
6527 cave_set_feat(ltcy + y, ltcx + x, j);
6530 store_init(NO_TOWN, stores[i]);
6537 * @brief タイプ16の部屋…地下都市の生成 / Type 16 -- Underground Arcade
6540 * Town logic flow for generation of new town\n
6541 * Originally from Vanilla 3.0.3\n
6543 * We start with a fully wiped cave of normal floors.\n
6545 * Note that town_gen_hack() plays games with the R.N.G.\n
6547 * This function does NOT do anything about the owners of the stores,\n
6548 * nor the contents thereof. It only handles the physical layout.\n
6550 static bool build_type16(void)
6554 STORE_GENERAL, STORE_ARMOURY, STORE_WEAPON, STORE_TEMPLE,
6555 STORE_ALCHEMIST, STORE_MAGIC, STORE_BLACK, STORE_BOOK,
6557 int n = sizeof stores / sizeof (int);
6558 int i, y, x, y1, x1, yval, xval;
6559 int town_hgt = rand_range(MIN_TOWN_HGT, MAX_TOWN_HGT);
6560 int town_wid = rand_range(MIN_TOWN_WID, MAX_TOWN_WID);
6561 bool prevent_bm = FALSE;
6563 /* Hack -- If already exist black market, prevent building */
6564 for (y = 0; (y < cur_hgt) && !prevent_bm; y++)
6566 for (x = 0; x < cur_wid; x++)
6568 if (cave[y][x].feat == FF_STORE)
6570 prevent_bm = (f_info[cave[y][x].feat].subtype == STORE_BLACK);
6575 for (i = 0; i < n; i++)
6577 if ((stores[i] == STORE_BLACK) && prevent_bm) stores[i] = stores[--n];
6579 if (!n) return FALSE;
6581 /* Allocate buildings array */
6582 C_MAKE(ugbldg, n, ugbldg_type);
6584 /* If cannot build stores, abort */
6585 if (!precalc_ugarcade(town_hgt, town_wid, n))
6587 /* Free buildings array */
6588 C_KILL(ugbldg, n, ugbldg_type);
6592 /* Find and reserve some space in the dungeon. Get center of room. */
6593 if (!find_space(&yval, &xval, town_hgt + 4, town_wid + 4))
6595 /* Free buildings array */
6596 C_KILL(ugbldg, n, ugbldg_type);
6600 /* Get top left corner */
6601 y1 = yval - (town_hgt / 2);
6602 x1 = xval - (town_wid / 2);
6604 /* Generate new room */
6605 generate_room_floor(
6606 y1 + town_hgt / 3, x1 + town_wid / 3,
6607 y1 + town_hgt * 2 / 3, x1 + town_wid * 2 / 3, FALSE);
6610 build_stores(y1, x1, stores, n);
6612 msg_print_wizard(CHEAT_DUNGEON, _("地下街を生成しました", "Underground arcade was generated."));
6614 /* Free buildings array */
6615 C_KILL(ugbldg, n, ugbldg_type);
6622 * @brief 与えられた部屋型IDに応じて部屋の生成処理分岐を行い結果を返す / Attempt to build a room of the given type at the given block
6624 * @note that we restrict the number of "crowded" rooms to reduce the chance of overflowing the monster list during level creation.
6625 * @return 部屋の精製に成功した場合 TRUE を返す。
6627 static bool room_build(int typ)
6632 /* Build an appropriate room */
6633 case ROOM_T_NORMAL: return build_type1();
6634 case ROOM_T_OVERLAP: return build_type2();
6635 case ROOM_T_CROSS: return build_type3();
6636 case ROOM_T_INNER_FEAT: return build_type4();
6637 case ROOM_T_NEST: return build_type5();
6638 case ROOM_T_PIT: return build_type6();
6639 case ROOM_T_LESSER_VAULT: return build_type7();
6640 case ROOM_T_GREATER_VAULT: return build_type8();
6641 case ROOM_T_FRACAVE: return build_type9();
6642 case ROOM_T_RANDOM_VAULT: return build_type10();
6643 case ROOM_T_OVAL: return build_type11();
6644 case ROOM_T_CRYPT: return build_type12();
6645 case ROOM_T_TRAP_PIT: return build_type13();
6646 case ROOM_T_TRAP: return build_type14();
6647 case ROOM_T_GLASS: return build_type15();
6648 case ROOM_T_ARCADE: return build_type16();
6656 * @brief 指定した部屋の生成確率を別の部屋に加算し、指定した部屋の生成率を0にする
6657 * @param dst 確率を移す先の部屋種ID
6658 * @param src 確率を与える元の部屋種ID
6660 #define MOVE_PLIST(dst, src) (prob_list[dst] += prob_list[src], prob_list[src] = 0)
6663 * @brief 部屋生成処理のメインルーチン(Sangbandを経由してOangbandからの実装を引用) / Generate rooms in dungeon. Build bigger rooms at first. [from SAngband (originally from OAngband)]
6664 * @return 部屋生成に成功した場合 TRUE を返す。
6666 bool generate_rooms(void)
6672 int prob_list[ROOM_T_MAX];
6673 int rooms_built = 0;
6674 int area_size = 100 * (cur_hgt*cur_wid) / (MAX_HGT*MAX_WID);
6675 int level_index = MIN(10, div_round(dun_level, 10));
6677 /* Number of each type of room on this level */
6678 s16b room_num[ROOM_T_MAX];
6680 /* Limit number of rooms */
6681 int dun_rooms = DUN_ROOMS_MAX * area_size / 100;
6683 /* Assume normal cave */
6684 room_info_type *room_info_ptr = room_info_normal;
6687 * Initialize probability list.
6689 for (i = 0; i < ROOM_T_MAX; i++)
6691 /* No rooms allowed above their minimum depth. */
6692 if (dun_level < room_info_ptr[i].min_level)
6698 prob_list[i] = room_info_ptr[i].prob[level_index];
6703 * XXX -- Various dungeon types and options.
6706 /*! @details ダンジョンにBEGINNER、CHAMELEON、SMALLESTいずれのフラグもなく、かつ「常に通常でない部屋を生成する」フラグがONならば、GRATER_VAULTのみを生成対象とする。 / Ironman sees only Greater Vaults */
6707 if (ironman_rooms && !((d_info[dungeon_type].flags1 & (DF1_BEGINNER | DF1_CHAMELEON | DF1_SMALLEST))))
6709 for (i = 0; i < ROOM_T_MAX; i++)
6711 if (i == ROOM_T_GREATER_VAULT) prob_list[i] = 1;
6712 else prob_list[i] = 0;
6716 /*! @details ダンジョンにNO_VAULTフラグがあるならば、LESSER_VAULT / GREATER_VAULT/ RANDOM_VAULTを除外 / Forbidden vaults */
6717 else if (d_info[dungeon_type].flags1 & DF1_NO_VAULT)
6719 prob_list[ROOM_T_LESSER_VAULT] = 0;
6720 prob_list[ROOM_T_GREATER_VAULT] = 0;
6721 prob_list[ROOM_T_RANDOM_VAULT] = 0;
6724 /*! @details ダンジョンにNO_CAVEフラグがある場合、FRACAVEの生成枠がNORMALに与えられる。CRIPT、OVALの生成枠がINNER_Fに与えられる。/ NO_CAVE dungeon (Castle)*/
6725 if (d_info[dungeon_type].flags1 & DF1_NO_CAVE)
6727 MOVE_PLIST(ROOM_T_NORMAL, ROOM_T_FRACAVE);
6728 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_CRYPT);
6729 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_OVAL);
6732 /*! @details ダンジョンにCAVEフラグがある場合、NORMALの生成枠がFRACAVEに与えられる。/ CAVE dungeon (Orc cave etc.) */
6733 else if (d_info[dungeon_type].flags1 & DF1_CAVE)
6735 MOVE_PLIST(ROOM_T_FRACAVE, ROOM_T_NORMAL);
6738 /*! @details ダンジョンの基本地形が最初から渓谷かアリーナ型の場合 FRACAVE は生成から除外。 / No caves when a (random) cavern exists: they look bad */
6739 else if (dun->cavern || dun->empty_level)
6741 prob_list[ROOM_T_FRACAVE] = 0;
6744 /*! @details ダンジョンに最初からGLASS_ROOMフラグがある場合、GLASS を生成から除外。/ Forbidden glass rooms */
6745 if (!(d_info[dungeon_type].flags1 & DF1_GLASS_ROOM))
6747 prob_list[ROOM_T_GLASS] = 0;
6750 /*! @details ARCADEは同フラグがダンジョンにないと生成されない。 / Forbidden glass rooms */
6751 if (!(d_info[dungeon_type].flags1 & DF1_ARCADE))
6753 prob_list[ROOM_T_ARCADE] = 0;
6757 * Initialize number of rooms,
6758 * And calcurate total probability.
6760 for (total_prob = 0, i = 0; i < ROOM_T_MAX; i++)
6763 total_prob += prob_list[i];
6767 * Prepare the number of rooms, of all types, we should build
6770 for (i = dun_rooms; i > 0; i--)
6773 int rand = randint0(total_prob);
6775 /* Get room_type randomly */
6776 for (room_type = 0; room_type < ROOM_T_MAX; room_type++)
6778 if (rand < prob_list[room_type]) break;
6779 else rand -= prob_list[room_type];
6783 if (room_type >= ROOM_T_MAX) room_type = ROOM_T_NORMAL;
6785 /* Increase the number of rooms of that type we should build. */
6786 room_num[room_type]++;
6792 case ROOM_T_LESSER_VAULT:
6793 case ROOM_T_TRAP_PIT:
6801 case ROOM_T_GREATER_VAULT:
6802 case ROOM_T_RANDOM_VAULT:
6811 * Build each type of room one by one until we cannot build any more.
6812 * [from SAngband (originally from OAngband)]
6816 /* Assume no remaining rooms */
6819 for (i = 0; i < ROOM_T_MAX; i++)
6821 /* What type of room are we building now? */
6822 int room_type = room_build_order[i];
6824 /* Go next if none available */
6825 if (!room_num[room_type]) continue;
6827 /* Use up one unit */
6828 room_num[room_type]--;
6830 /* Build the room. */
6831 if (room_build(room_type))
6833 /* Increase the room built count. */
6836 /* Mark as there was some remaining rooms */
6843 case ROOM_T_TRAP_PIT:
6845 /* Avoid too many monsters */
6848 room_num[ROOM_T_PIT] = 0;
6849 room_num[ROOM_T_NEST] = 0;
6850 room_num[ROOM_T_TRAP_PIT] = 0;
6856 /* Avoid double-town */
6857 room_num[ROOM_T_ARCADE] = 0;
6863 /* End loop if no room remain */
6867 /*! @details 部屋生成数が2未満の場合生成失敗を返す */
6868 if (rooms_built < 2)
6870 msg_format_wizard(CHEAT_DUNGEON, _("部屋数が2未満でした。生成を再試行します。", "Number of rooms was under 2. Retry."), rooms_built);
6874 msg_format_wizard(CHEAT_DUNGEON, _("このダンジョンの部屋数は %d です。", "Number of Rooms: %d"), rooms_built);