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
44 #include "rooms-city.h"
45 #include "rooms-fractal.h"
46 #include "rooms-normal.h"
47 #include "rooms-pitnest.h"
48 #include "rooms-special.h"
49 #include "rooms-trap.h"
50 #include "rooms-vault.h"
57 *[from SAngband (originally from OAngband)]\n
59 * Table of values that control how many times each type of room will\n
60 * appear. Each type of room has its own row, and each column\n
61 * corresponds to dungeon levels 0, 10, 20, and so on. The final\n
62 * value is the minimum depth the room can appear at. -LM-\n
64 * Level 101 and below use the values for level 100.\n
66 * Rooms with lots of monsters or loot may not be generated if the\n
67 * object or monster lists are already nearly full. Rooms will not\n
68 * appear above their minimum depth. Tiny levels will not have space\n
69 * for all the rooms you ask for.\n
71 static room_info_type room_info_normal[ROOM_T_MAX] =
74 /* 0 10 20 30 40 50 60 70 80 90 100 min limit */
76 {{999,900,800,700,600,500,400,300,200,100, 0}, 0}, /*NORMAL */
77 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 1}, /*OVERLAP */
78 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 3}, /*CROSS */
79 {{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 3}, /*INNER_F */
80 {{ 0, 1, 1, 1, 2, 3, 5, 6, 8, 10, 13}, 10}, /*NEST */
81 {{ 0, 1, 1, 2, 3, 4, 6, 8, 10, 13, 16}, 10}, /*PIT */
82 {{ 0, 1, 1, 1, 2, 2, 3, 5, 6, 8, 10}, 10}, /*LESSER_V */
83 {{ 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 4}, 20}, /*GREATER_V*/
84 {{ 0,100,200,300,400,500,600,700,800,900,999}, 10}, /*FRACAVE */
85 {{ 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2}, 10}, /*RANDOM_V */
86 {{ 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 40}, 3}, /*OVAL */
87 {{ 1, 6, 12, 18, 24, 30, 36, 42, 48, 54, 60}, 10}, /*CRYPT */
88 {{ 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8}, 20}, /*TRAP_PIT */
89 {{ 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8}, 20}, /*TRAP */
90 {{ 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2}, 40}, /*GLASS */
91 {{ 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3}, 1}, /*ARCADE */
92 {{ 20, 40, 60, 80,100,100,100,100,100,100,100}, 1}, /*FIX */
96 /*! 部屋の生成処理順 / Build rooms in descending order of difficulty. */
97 static byte room_build_order[ROOM_T_MAX] = {
118 * @brief 1マスだけの部屋を作成し、上下左右いずれか一つに隠しドアを配置する。
119 * @param y0 配置したい中心のY座標
120 * @param x0 配置したい中心のX座標
122 * This funtion makes a very small room centred at (x0, y0)
123 * This is used in crypts, and random elemental vaults.
125 * Note - this should be used only on allocated regions
126 * within another room.
128 void build_small_room(int x0, int y0)
132 for (y = y0 - 1; y <= y0 + 1; y++)
134 place_inner_bold(y, x0 - 1);
135 place_inner_bold(y, x0 + 1);
138 for (x = x0 - 1; x <= x0 + 1; x++)
140 place_inner_bold(y0 - 1, x);
141 place_inner_bold(y0 + 1, x);
144 /* Place a secret door on one side */
147 case 0: place_secret_door(y0, x0 - 1, DOOR_DEFAULT); break;
148 case 1: place_secret_door(y0, x0 + 1, DOOR_DEFAULT); break;
149 case 2: place_secret_door(y0 - 1, x0, DOOR_DEFAULT); break;
150 case 3: place_secret_door(y0 + 1, x0, DOOR_DEFAULT); break;
153 /* Clear mimic type */
154 cave[y0][x0].mimic = 0;
156 /* Add inner open space */
157 place_floor_bold(y0, x0);
162 * 指定範囲に通路が通っていることを確認した上で床で埋める
163 * This function tunnels around a room if it will cut off part of a cave system.
170 static void check_room_boundary(int x1, int y1, int x2, int y2)
173 bool old_is_floor, new_is_floor;
179 old_is_floor = get_is_floor(x1 - 1, y1);
182 * Count the number of floor-wall boundaries around the room
183 * Note: diagonal squares are ignored since the player can move diagonally
184 * to bypass these if needed.
187 /* Above the top boundary */
188 for (x = x1; x <= x2; x++)
190 new_is_floor = get_is_floor(x, y1 - 1);
192 /* Increment counter if they are different */
193 if (new_is_floor != old_is_floor) count++;
195 old_is_floor = new_is_floor;
199 for (y = y1; y <= y2; y++)
201 new_is_floor = get_is_floor(x2 + 1, y);
203 /* increment counter if they are different */
204 if (new_is_floor != old_is_floor) count++;
206 old_is_floor = new_is_floor;
209 /* Bottom boundary */
210 for (x = x2; x >= x1; x--)
212 new_is_floor = get_is_floor(x, y2 + 1);
214 /* increment counter if they are different */
215 if (new_is_floor != old_is_floor) count++;
217 old_is_floor = new_is_floor;
221 for (y = y2; y >= y1; y--)
223 new_is_floor = get_is_floor(x1 - 1, y);
225 /* increment counter if they are different */
226 if (new_is_floor != old_is_floor) count++;
228 old_is_floor = new_is_floor;
231 /* If all the same, or only one connection exit. */
232 if (count <= 2) return;
235 /* Tunnel around the room so to prevent problems with caves */
236 for (y = y1; y <= y2; y++)
238 for (x = x1; x <= x2; x++)
248 * find_space()の予備処理として部屋の生成が可能かを判定する /
249 * Helper function for find_space(). Is this a good location?
250 * @param blocks_high 範囲の高さ
251 * @param blocks_wide 範囲の幅
252 * @param block_y 範囲の上端
253 * @param block_x 範囲の左端
256 static bool find_space_aux(int blocks_high, int blocks_wide, int block_y, int block_x)
258 int by1, bx1, by2, bx2, by, bx;
260 /* Itty-bitty rooms must shift about within their rectangle */
263 if ((blocks_wide == 2) && (block_x % 3) == 2)
267 /* Rooms with width divisible by 3 must be fitted to a rectangle. */
268 else if ((blocks_wide % 3) == 0)
270 /* Must be aligned to the left edge of a 11x33 rectangle. */
271 if ((block_x % 3) != 0)
276 * Big rooms that do not have a width divisible by 3 must be
277 * aligned towards the edge of the dungeon closest to them.
281 /* Shift towards left edge of dungeon. */
282 if (block_x + (blocks_wide / 2) <= dun->col_rooms / 2)
284 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
286 if ((block_x % 3) == 1)
290 /* Shift toward right edge of dungeon. */
293 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
295 if ((block_x % 3) == 1)
303 by2 = block_y + blocks_high;
304 bx2 = block_x + blocks_wide;
306 /* Never run off the screen */
307 if ((by1 < 0) || (by2 > dun->row_rooms)) return FALSE;
308 if ((bx1 < 0) || (bx2 > dun->col_rooms)) return FALSE;
310 /* Verify available space */
311 for (by = by1; by < by2; by++)
313 for (bx = bx1; bx < bx2; bx++)
315 if (dun->room_map[by][bx])
322 /* This location is okay */
328 * @brief 部屋生成が可能なスペースを確保する / Find a good spot for the next room. -LM-
329 * @param y 部屋の生成が可能な中心Y座標を返す参照ポインタ
330 * @param x 部屋の生成が可能な中心X座標を返す参照ポインタ
331 * @param height 確保したい領域の高さ
332 * @param width 確保したい領域の幅
333 * @return 所定の範囲が確保できた場合TRUEを返す
335 * Find and allocate a free space in the dungeon large enough to hold\n
336 * the room calling this function.\n
338 * We allocate space in 11x11 blocks, but want to make sure that rooms\n
339 * align neatly on the standard screen. Therefore, we make them use\n
340 * blocks in few 11x33 rectangles as possible.\n
342 * Be careful to include the edges of the room in height and width!\n
344 * Return TRUE and values for the center of the room if all went well.\n
345 * Otherwise, return FALSE.\n
347 bool find_space(POSITION *y, POSITION *x, POSITION height, POSITION width)
349 int candidates, pick;
350 int by, bx, by1, bx1, by2, bx2;
351 int block_y = 0, block_x = 0;
354 /* Find out how many blocks we need. */
355 int blocks_high = 1 + ((height - 1) / BLOCK_HGT);
356 int blocks_wide = 1 + ((width - 1) / BLOCK_WID);
358 /* There are no way to allocate such huge space */
359 if (dun->row_rooms < blocks_high) return FALSE;
360 if (dun->col_rooms < blocks_wide) return FALSE;
365 /* Count the number of valid places */
366 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
368 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
370 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
372 /* Find a valid place */
385 if (!(d_info[dungeon_type].flags1 & DF1_NO_CAVE))
387 /* Choose a random one */
388 pick = randint1(candidates);
391 /* NO_CAVE dungeon (Castle) */
394 /* Always choose the center one */
395 pick = candidates/2 + 1;
398 /* Pick up the choosen location */
399 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
401 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
403 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
407 /* This one is picked? */
418 by2 = block_y + blocks_high;
419 bx2 = block_x + blocks_wide;
422 * It is *extremely* important that the following calculation
423 * be *exactly* correct to prevent memory errors
426 /* Acquire the location of the room */
427 (*y) = ((by1 + by2) * BLOCK_HGT) / 2;
428 (*x) = ((bx1 + bx2) * BLOCK_WID) / 2;
430 /* Save the room location */
431 if (dun->cent_n < CENT_MAX)
433 dun->cent[dun->cent_n].y = (byte_hack)*y;
434 dun->cent[dun->cent_n].x = (byte_hack)*x;
438 /* Reserve some blocks. */
439 for (by = by1; by < by2; by++)
441 for (bx = bx1; bx < bx2; bx++)
443 dun->room_map[by][bx] = TRUE;
449 * Hack- See if room will cut off a cavern.
451 * If so, fix by tunneling outside the room in such a
452 * way as to connect the caves.
454 check_room_boundary(*x - width / 2 - 1, *y - height / 2 - 1, *x + (width - 1) / 2 + 1, *y + (height - 1) / 2 + 1);
465 * Structure to hold all "fill" data
468 typedef struct fill_data_type fill_data_type;
470 struct fill_data_type
483 /* features to fill with */
492 /* number of filled squares */
496 static fill_data_type fill_data;
499 /* Store routine for the fractal cave generator */
500 /* this routine probably should be an inline function or a macro. */
501 static void store_height(int x, int y, int val)
503 /* if on boundary set val > cutoff so walls are not as square */
504 if (((x == fill_data.xmin) || (y == fill_data.ymin) ||
505 (x == fill_data.xmax) || (y == fill_data.ymax)) &&
506 (val <= fill_data.c1)) val = fill_data.c1 + 1;
508 /* store the value in height-map format */
509 cave[y][x].feat = (s16b)val;
516 * Explanation of the plasma fractal algorithm:
518 * A grid of points is created with the properties of a 'height-map'
519 * This is done by making the corners of the grid have a random value.
520 * The grid is then subdivided into one with twice the resolution.
521 * The new points midway between two 'known' points can be calculated
522 * by taking the average value of the 'known' ones and randomly adding
523 * or subtracting an amount proportional to the distance between those
524 * points. The final 'middle' points of the grid are then calculated
525 * by averaging all four of the originally 'known' corner points. An
526 * random amount is added or subtracted from this to get a value of the
527 * height at that point. The scaling factor here is adjusted to the
528 * slightly larger distance diagonally as compared to orthogonally.
530 * This is then repeated recursively to fill an entire 'height-map'
531 * A rectangular map is done the same way, except there are different
532 * scaling factors along the x and y directions.
534 * A hack to change the amount of correlation between points is done using
535 * the grd variable. If the current step size is greater than grd then
536 * the point will be random, otherwise it will be calculated by the
537 * above algorithm. This makes a maximum distance at which two points on
538 * the height map can affect each other.
540 * How fractal caves are made:
542 * When the map is complete, a cut-off value is used to create a cave.
543 * Heights below this value are "floor", and heights above are "wall".
544 * This also can be used to create lakes, by adding more height levels
545 * representing shallow and deep water/ lava etc.
547 * The grd variable affects the width of passages.
548 * The roug variable affects the roughness of those passages
550 * The tricky part is making sure the created cave is connected. This
551 * is done by 'filling' from the inside and only keeping the 'filled'
552 * floor. Walls bounding the 'filled' floor are also kept. Everything
553 * else is converted to the normal _extra_.
558 * Note that this uses the cave.feat array in a very hackish way
559 * the values are first set to zero, and then each array location
560 * is used as a "heightmap"
561 * The heightmap then needs to be converted back into the "feat" format.
563 * grd=level at which fractal turns on. smaller gives more mazelike caves
564 * roug=roughness level. 16=normal. higher values make things more convoluted
565 * small values are good for smooth walls.
566 * size=length of the side of the square cave system.
568 void generate_hmap(POSITION y0, POSITION x0, POSITION xsiz, POSITION ysiz, int grd, int roug, int cutoff)
570 POSITION xhsize, yhsize, xsize, ysize, maxsize;
573 * fixed point variables- these are stored as 256 x normal value
574 * this gives 8 binary places of fractional part + 8 places of normal part
577 u16b xstep, xhstep, ystep, yhstep;
578 u16b xstep2, xhstep2, ystep2, yhstep2;
579 u16b i, j, ii, jj, diagsize, xxsize, yysize;
581 /* Cache for speed */
584 /* redefine size so can change the value if out of range */
588 /* Paranoia about size of the system of caves */
589 if (xsize > 254) xsize = 254;
590 if (xsize < 4) xsize = 4;
591 if (ysize > 254) ysize = 254;
592 if (ysize < 4) ysize = 4;
594 /* get offsets to middle of array */
598 /* fix rounding problem */
602 /* get limits of region */
603 fill_data.xmin = x0 - xhsize;
604 fill_data.ymin = y0 - yhsize;
605 fill_data.xmax = x0 + xhsize;
606 fill_data.ymax = y0 + yhsize;
608 /* Store cutoff in global for quick access */
609 fill_data.c1 = cutoff;
612 * Scale factor for middle points:
613 * About sqrt(2) * 256 - correct for a square lattice
614 * approximately correct for everything else.
618 /* maximum of xsize and ysize */
619 maxsize = (xsize > ysize) ? xsize : ysize;
621 /* Clear the section */
622 for (i = 0; i <= xsize; i++)
624 for (j = 0; j <= ysize; j++)
626 /* -1 is a flag for "not done yet" */
627 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].feat = -1;
628 /* Clear icky flag because may be redoing the cave */
629 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].info &= ~(CAVE_ICKY);
633 /* Boundaries are walls */
634 cave[fill_data.ymin][fill_data.xmin].feat = (s16b)maxsize;
635 cave[fill_data.ymax][fill_data.xmin].feat = (s16b)maxsize;
636 cave[fill_data.ymin][fill_data.xmax].feat = (s16b)maxsize;
637 cave[fill_data.ymax][fill_data.xmax].feat = (s16b)maxsize;
639 /* Set the middle square to be an open area. */
640 cave[y0][x0].feat = 0;
642 /* Initialize the step sizes */
643 xstep = xhstep = xsize * 256;
644 ystep = yhstep = ysize * 256;
645 xxsize = xsize * 256;
646 yysize = ysize * 256;
649 * Fill in the rectangle with fractal height data -
650 * like the 'plasma fractal' in fractint.
652 while ((xhstep > 256) || (yhstep > 256))
654 /* Halve the step sizes */
660 /* cache well used values */
661 xstep2 = xstep / 256;
662 ystep2 = ystep / 256;
664 xhstep2 = xhstep / 256;
665 yhstep2 = yhstep / 256;
667 /* middle top to bottom. */
668 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
670 for (j = 0; j <= yysize; j += ystep)
672 /* cache often used values */
673 ii = i / 256 + fill_data.xmin;
674 jj = j / 256 + fill_data.ymin;
677 if (cave[jj][ii].feat == -1)
681 /* If greater than 'grid' level then is random */
682 store_height(ii, jj, randint1(maxsize));
686 /* Average of left and right points +random bit */
688 (cave[jj][fill_data.xmin + (i - xhstep) / 256].feat
689 + cave[jj][fill_data.xmin + (i + xhstep) / 256].feat) / 2
690 + (randint1(xstep2) - xhstep2) * roug / 16);
697 /* middle left to right. */
698 for (j = yhstep; j <= yysize - yhstep; j += ystep)
700 for (i = 0; i <= xxsize; i += xstep)
702 /* cache often used values */
703 ii = i / 256 + fill_data.xmin;
704 jj = j / 256 + fill_data.ymin;
707 if (cave[jj][ii].feat == -1)
711 /* If greater than 'grid' level then is random */
712 store_height(ii, jj, randint1(maxsize));
716 /* Average of up and down points +random bit */
718 (cave[fill_data.ymin + (j - yhstep) / 256][ii].feat
719 + cave[fill_data.ymin + (j + yhstep) / 256][ii].feat) / 2
720 + (randint1(ystep2) - yhstep2) * roug / 16);
727 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
729 for (j = yhstep; j <= yysize - yhstep; j += ystep)
731 /* cache often used values */
732 ii = i / 256 + fill_data.xmin;
733 jj = j / 256 + fill_data.ymin;
736 if (cave[jj][ii].feat == -1)
740 /* If greater than 'grid' level then is random */
741 store_height(ii, jj, randint1(maxsize));
745 /* Cache reused values. */
746 xm = fill_data.xmin + (i - xhstep) / 256;
747 xp = fill_data.xmin + (i + xhstep) / 256;
748 ym = fill_data.ymin + (j - yhstep) / 256;
749 yp = fill_data.ymin + (j + yhstep) / 256;
752 * Average over all four corners + scale by diagsize to
753 * reduce the effect of the square grid on the shape of the fractal
756 (cave[ym][xm].feat + cave[yp][xm].feat
757 + cave[ym][xp].feat + cave[yp][xp].feat) / 4
758 + (randint1(xstep2) - xhstep2) * (diagsize / 16) / 256 * roug);
767 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)
770 * function used to convert from height-map back to the
771 * normal angband cave format
773 if (cave[y][x].info & CAVE_ICKY)
780 /* Show that have looked at this square */
781 cave[y][x].info|= (CAVE_ICKY);
783 /* Use cutoffs c1-c3 to allocate regions of floor /water/ lava etc. */
784 if (cave[y][x].feat <= c1)
786 /* 25% of the time use the other tile : it looks better this way */
787 if (randint1(100) < 75)
789 cave[y][x].feat = (s16b)feat1;
790 cave[y][x].info &= ~(CAVE_MASK);
791 cave[y][x].info |= info1;
796 cave[y][x].feat = (s16b)feat2;
797 cave[y][x].info &= ~(CAVE_MASK);
798 cave[y][x].info |= info2;
802 else if (cave[y][x].feat <= c2)
804 /* 25% of the time use the other tile : it looks better this way */
805 if (randint1(100) < 75)
807 cave[y][x].feat = (s16b)feat2;
808 cave[y][x].info &= ~(CAVE_MASK);
809 cave[y][x].info |= info2;
814 cave[y][x].feat = (s16b)feat1;
815 cave[y][x].info &= ~(CAVE_MASK);
816 cave[y][x].info |= info1;
820 else if (cave[y][x].feat <= c3)
822 cave[y][x].feat = (s16b)feat3;
823 cave[y][x].info &= ~(CAVE_MASK);
824 cave[y][x].info |= info3;
827 /* if greater than cutoff then is a wall */
830 place_outer_bold(y, x);
840 * Quick and nasty fill routine used to find the connected region
841 * of floor in the middle of the cave
843 static void cave_fill(POSITION y, POSITION x)
854 /* Enqueue that entry */
859 /* Now process the queue */
860 while (flow_head != flow_tail)
862 /* Extract the next entry */
863 ty = temp_y[flow_head];
864 tx = temp_x[flow_head];
866 /* Forget that entry */
867 if (++flow_head == TEMP_MAX) flow_head = 0;
869 /* Add the "children" */
870 for (d = 0; d < 8; d++)
872 int old_head = flow_tail;
878 /* Paranoia Don't leave the cave */
879 if (!in_bounds(j, i))
881 /* affect boundary */
882 cave[j][i].info |= CAVE_ICKY;
886 /* If within bounds */
887 else if ((i > fill_data.xmin) && (i < fill_data.xmax)
888 && (j > fill_data.ymin) && (j < fill_data.ymax))
890 /* If not a wall or floor done before */
891 if (hack_isnt_wall(j, i,
892 fill_data.c1, fill_data.c2, fill_data.c3,
893 fill_data.feat1, fill_data.feat2, fill_data.feat3,
894 fill_data.info1, fill_data.info2, fill_data.info3))
896 /* Enqueue that entry */
897 temp_y[flow_tail] = (byte_hack)j;
898 temp_x[flow_tail] = (byte_hack)i;
900 /* Advance the queue */
901 if (++flow_tail == TEMP_MAX) flow_tail = 0;
903 /* Hack -- Overflow by forgetting new entry */
904 if (flow_tail == flow_head)
906 flow_tail = old_head;
910 /* keep tally of size of cave system */
911 (fill_data.amount)++;
917 /* affect boundary */
918 cave[j][i].info |= CAVE_ICKY;
925 bool generate_fracave(POSITION y0, POSITION x0, POSITION xsize, POSITION ysize, int cutoff, bool light, bool room)
927 POSITION x, y, xhsize, yhsize;
930 /* offsets to middle from corner */
936 * select region connected to center of cave system
937 * this gets rid of alot of isolated one-sqaures that
938 * can make teleport traps instadeaths...
942 fill_data.c1 = cutoff;
946 /* features to fill with */
947 fill_data.feat1 = floor_type[randint0(100)];
948 fill_data.feat2 = floor_type[randint0(100)];
949 fill_data.feat3 = floor_type[randint0(100)];
951 fill_data.info1 = CAVE_FLOOR;
952 fill_data.info2 = CAVE_FLOOR;
953 fill_data.info3 = CAVE_FLOOR;
955 /* number of filled squares */
956 fill_data.amount = 0;
958 cave_fill((byte)y0, (byte)x0);
960 /* if tally too small, try again */
961 if (fill_data.amount < 10)
963 /* too small - clear area and try again later */
964 for (x = 0; x <= xsize; ++x)
966 for (y = 0; y <= ysize; ++y)
968 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
969 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
976 * Do boundarys-check to see if they are next to a filled region
977 * If not then they are set to normal granite
978 * If so then they are marked as room walls.
980 for (i = 0; i <= xsize; ++i)
983 if ((cave[0 + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
985 /* Next to a 'filled' region? - set to be room walls */
986 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
987 if (light) cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_GLOW);
988 cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_ROOM);
989 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
993 /* set to be normal granite */
994 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
997 /* bottom boundary */
998 if ((cave[ysize + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
1000 /* Next to a 'filled' region? - set to be room walls */
1001 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1002 if (light) cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_GLOW);
1003 cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_ROOM);
1004 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1008 /* set to be normal granite */
1009 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1012 /* clear the icky flag-don't need it any more */
1013 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1014 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1017 /* Do the left and right boundaries minus the corners (done above) */
1018 for (i = 1; i < ysize; ++i)
1021 if ((cave[i + y0 - yhsize][0 + x0 - xhsize].info & CAVE_ICKY) && room)
1024 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1025 if (light) cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_GLOW);
1026 cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_ROOM);
1027 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1032 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1034 /* right boundary */
1035 if ((cave[i + y0 - yhsize][xsize + x0 - xhsize].info & CAVE_ICKY) && room)
1038 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1039 if (light) cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_GLOW);
1040 cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_ROOM);
1041 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1046 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1049 /* clear icky flag -done with it */
1050 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
1051 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
1055 /* Do the rest: convert back to the normal format */
1056 for (x = 1; x < xsize; ++x)
1058 for (y = 1; y < ysize; ++y)
1060 if (is_floor_bold(y0 + y - yhsize, x0 + x - xhsize) &&
1061 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
1063 /* Clear the icky flag in the filled region */
1064 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~CAVE_ICKY;
1066 /* Set appropriate flags */
1067 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
1068 if (room) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
1070 else if (is_outer_bold(y0 + y - yhsize, x0 + x - xhsize) &&
1071 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
1074 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
1075 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
1078 cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
1083 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1084 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ROOM);
1089 /* Clear the unconnected regions */
1090 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1091 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
1097 * XXX XXX XXX There is a slight problem when tunnels pierce the caves:
1098 * Extra doors appear inside the system. (Its not very noticeable though.)
1099 * This can be removed by "filling" from the outside in. This allows a separation
1100 * from _outer_ with _inner_. (Internal walls are _outer_ instead.)
1101 * The extra effort for what seems to be only a minor thing (even non-existant if you
1102 * think of the caves not as normal rooms, but as holes in the dungeon), doesn't seem
1110 #ifdef ALLOW_CAVERNS_AND_LAKES
1112 * Builds a cave system in the center of the dungeon.
1114 void build_cavern(void)
1116 int grd, roug, cutoff, xsize, ysize, x0, y0;
1119 light = done = FALSE;
1120 if ((dun_level <= randint1(50)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
1122 /* Make a cave the size of the dungeon */
1123 xsize = cur_wid - 1;
1124 ysize = cur_hgt - 1;
1128 /* Paranoia: make size even */
1134 /* testing values for these parameters: feel free to adjust */
1135 grd = randint1(4) + 4;
1137 /* want average of about 16 */
1138 roug = randint1(8) * randint1(4);
1144 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, cutoff);
1146 /* Convert to normal format+ clean up */
1147 done = generate_fracave(y0 + 1, x0 + 1, xsize, ysize, cutoff, light, FALSE);
1151 bool generate_lake(int y0, int x0, int xsize, int ysize, int c1, int c2, int c3, int type)
1153 int x, y, i, xhsize, yhsize;
1154 int feat1, feat2, feat3;
1156 /* offsets to middle from corner */
1160 /* Get features based on type */
1163 case LAKE_T_LAVA: /* Lava */
1164 feat1 = feat_deep_lava;
1165 feat2 = feat_shallow_lava;
1166 feat3 = floor_type[randint0(100)];
1168 case LAKE_T_WATER: /* Water */
1169 feat1 = feat_deep_water;
1170 feat2 = feat_shallow_water;
1171 feat3 = floor_type[randint0(100)];
1173 case LAKE_T_CAVE: /* Collapsed cave */
1174 feat1 = floor_type[randint0(100)];
1175 feat2 = floor_type[randint0(100)];
1176 feat3 = feat_rubble;
1178 case LAKE_T_EARTH_VAULT: /* Earth vault */
1179 feat1 = feat_rubble;
1180 feat2 = floor_type[randint0(100)];
1181 feat3 = feat_rubble;
1183 case LAKE_T_AIR_VAULT: /* Air vault */
1188 case LAKE_T_WATER_VAULT: /* Water vault */
1189 feat1 = feat_shallow_water;
1190 feat2 = feat_deep_water;
1191 feat3 = feat_shallow_water;
1193 case LAKE_T_FIRE_VAULT: /* Fire Vault */
1194 feat1 = feat_shallow_lava;
1195 feat2 = feat_deep_lava;
1196 feat3 = feat_shallow_lava;
1200 default: return FALSE;
1204 * select region connected to center of cave system
1205 * this gets rid of alot of isolated one-sqaures that
1206 * can make teleport traps instadeaths...
1214 /* features to fill with */
1215 fill_data.feat1 = feat1;
1216 fill_data.feat2 = feat2;
1217 fill_data.feat3 = feat3;
1219 fill_data.info1 = 0;
1220 fill_data.info2 = 0;
1221 fill_data.info3 = 0;
1223 /* number of filled squares */
1224 fill_data.amount = 0;
1226 /* select region connected to center of cave system
1227 * this gets rid of alot of isolated one-sqaures that
1228 * can make teleport traps instadeaths... */
1229 cave_fill((byte)y0, (byte)x0);
1231 /* if tally too small, try again */
1232 if (fill_data.amount < 10)
1234 /* too small -clear area and try again later */
1235 for (x = 0; x <= xsize; ++x)
1237 for (y = 0; y <= ysize; ++y)
1239 place_floor_bold(y0 + y - yhsize, x0 + x - xhsize);
1240 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
1246 /* Do boundarys- set to normal granite */
1247 for (i = 0; i <= xsize; ++i)
1249 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
1250 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1252 /* clear the icky flag-don't need it any more */
1253 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1254 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1257 /* Do the left and right boundaries minus the corners (done above) */
1259 for (i = 1; i < ysize; ++i)
1261 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1262 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1264 /* clear icky flag -done with it */
1265 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
1266 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
1270 /* Do the rest: convert back to the normal format */
1271 for (x = 1; x < xsize; ++x)
1273 for (y = 1; y < ysize; ++y)
1275 /* Fill unconnected regions with granite */
1276 if ((!(cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY)) ||
1277 is_outer_bold(y0 + y - yhsize, x0 + x - xhsize))
1278 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1280 /* turn off icky flag (no longer needed.) */
1281 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
1284 if (cave_have_flag_bold(y0 + y - yhsize, x0 + x - xhsize, FF_LAVA))
1286 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS)) cave[y0 + y - yhsize][x0 + x - xhsize].info |= CAVE_GLOW;
1296 * makes a lake/collapsed cave system in the center of the dungeon
1298 void build_lake(int type)
1300 int grd, roug, xsize, ysize, x0, y0;
1304 /* paranoia - exit if lake type out of range. */
1305 if ((type < LAKE_T_LAVA) || (type > LAKE_T_FIRE_VAULT))
1307 msg_format("Invalid lake type (%d)", type);
1311 /* Make the size of the dungeon */
1312 xsize = cur_wid - 1;
1313 ysize = cur_hgt - 1;
1317 /* Paranoia: make size even */
1323 /* testing values for these parameters: feel free to adjust */
1324 grd = randint1(3) + 4;
1326 /* want average of about 16 */
1327 roug = randint1(8) * randint1(4);
1329 /* Make up size of various componants */
1333 /* Deep water/lava */
1334 c1 = randint0(c3 / 2) + randint0(c3 / 2) - 5;
1336 /* Shallow boundary */
1340 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, c3);
1342 /* Convert to normal format+ clean up */
1343 done = generate_lake(y0 + 1, x0 + 1, xsize, ysize, c1, c2, c3, type);
1346 #endif /* ALLOW_CAVERNS_AND_LAKES */
1351 * Routine that fills the empty areas of a room with treasure and monsters.
1353 void fill_treasure(int x1, int x2, int y1, int y2, int difficulty)
1355 int x, y, cx, cy, size;
1358 /* center of room:*/
1362 /* Rough measure of size of vault= sum of lengths of sides */
1363 size = abs(x2 - x1) + abs(y2 - y1);
1365 for (x = x1; x <= x2; x++)
1367 for (y = y1; y <= y2; y++)
1369 /* Thing added based on distance to center of vault
1370 * Difficulty is 1-easy to 10-hard */
1371 value = ((((s32b)(distance(cx, cy, x, y))) * 100) / size) + randint1(10) - difficulty;
1373 /* hack- empty square part of the time */
1374 if ((randint1(100) - difficulty * 3) > 50) value = 20;
1376 /* if floor, shallow water and lava */
1377 if (is_floor_bold(y, x) ||
1378 (cave_have_flag_bold(y, x, FF_PLACE) && cave_have_flag_bold(y, x, FF_DROP)))
1380 /* The smaller 'value' is, the better the stuff */
1383 /* Meanest monster + treasure */
1384 monster_level = base_level + 40;
1385 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1386 monster_level = base_level;
1387 object_level = base_level + 20;
1388 place_object(y, x, AM_GOOD);
1389 object_level = base_level;
1393 /* Mean monster +treasure */
1394 monster_level = base_level + 20;
1395 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1396 monster_level = base_level;
1397 object_level = base_level + 10;
1398 place_object(y, x, AM_GOOD);
1399 object_level = base_level;
1401 else if (value < 10)
1404 monster_level = base_level + 9;
1405 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1406 monster_level = base_level;
1408 else if (value < 17)
1410 /* Intentional Blank space */
1413 * (Want some of the vault to be empty
1414 * so have room for group monsters.
1415 * This is used in the hack above to lower
1416 * the density of stuff in the vault.)
1419 else if (value < 23)
1421 /* Object or trap */
1422 if (randint0(100) < 25)
1424 place_object(y, x, 0L);
1431 else if (value < 30)
1433 /* Monster and trap */
1434 monster_level = base_level + 5;
1435 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1436 monster_level = base_level;
1439 else if (value < 40)
1441 /* Monster or object */
1442 if (randint0(100) < 50)
1444 monster_level = base_level + 3;
1445 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1446 monster_level = base_level;
1448 if (randint0(100) < 50)
1450 object_level = base_level + 7;
1451 place_object(y, x, 0L);
1452 object_level = base_level;
1455 else if (value < 50)
1464 /* 20% monster, 40% trap, 20% object, 20% blank space */
1465 if (randint0(100) < 20)
1467 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1469 else if (randint0(100) < 50)
1473 else if (randint0(100) < 50)
1475 place_object(y, x, 0L);
1487 * Overlay a rectangular room given its bounds
1488 * This routine is used by build_room_vault
1489 * The area inside the walls is not touched:
1490 * only granite is removed- normal walls stay
1492 void build_room(int x1, int x2, int y1, int y2)
1494 int x, y, i, xsize, ysize, temp;
1496 /* Check if rectangle has no width */
1497 if ((x1 == x2) || (y1 == y2)) return;
1502 /* Swap boundaries if in wrong order */
1510 /* Swap boundaries if in wrong order */
1516 /* get total widths */
1521 /* Top and bottom boundaries */
1522 for (i = 0; i <= xsize; i++)
1524 place_outer_noperm_bold(y1, x1 + i);
1525 cave[y1][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
1526 place_outer_noperm_bold(y2, x1 + i);
1527 cave[y2][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
1530 /* Left and right boundaries */
1531 for (i = 1; i < ysize; i++)
1533 place_outer_noperm_bold(y1 + i, x1);
1534 cave[y1 + i][x1].info|=(CAVE_ROOM | CAVE_ICKY);
1535 place_outer_noperm_bold(y1 + i, x2);
1536 cave[y1 + i][x2].info|=(CAVE_ROOM | CAVE_ICKY);
1540 for (x = 1; x < xsize; x++)
1542 for (y = 1; y < ysize; y++)
1544 if (is_extra_bold(y1+y, x1+x))
1546 /* clear the untouched region */
1547 place_floor_bold(y1 + y, x1 + x);
1548 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
1552 /* make it a room- but don't touch */
1553 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
1562 * maze vault -- rectangular labyrinthine rooms
1564 * maze vault uses two routines:
1565 * r_visit - a recursive routine that builds the labyrinth
1566 * build_maze_vault - a driver routine that calls r_visit and adds
1567 * monsters, traps and treasure
1569 * The labyrinth is built by creating a spanning tree of a graph.
1570 * The graph vertices are at
1571 * (x, y) = (2j + x1, 2k + y1) j = 0,...,m-1 k = 0,...,n-1
1572 * and the edges are the vertical and horizontal nearest neighbors.
1574 * The spanning tree is created by performing a suitably randomized
1575 * depth-first traversal of the graph. The only adjustable parameter
1576 * is the randint0(3) below; it governs the relative density of
1577 * twists and turns in the labyrinth: smaller number, more twists.
1579 void r_visit(int y1, int x1, int y2, int x2, int node, int dir, int *visited)
1581 int i, j, m, n, temp, x, y, adj[4];
1583 /* dimensions of vertex array */
1584 m = (x2 - x1) / 2 + 1;
1585 n = (y2 - y1) / 2 + 1;
1587 /* mark node visited and set it to a floor */
1589 x = 2 * (node % m) + x1;
1590 y = 2 * (node / m) + y1;
1591 place_floor_bold(y, x);
1593 /* setup order of adjacent node visits */
1596 /* pick a random ordering */
1597 for (i = 0; i < 4; i++)
1599 for (i = 0; i < 4; i++)
1610 /* pick a random ordering with dir first */
1612 for (i = 1; i < 4; i++)
1614 for (i = 1; i < 4; i++)
1616 j = 1 + randint0(3);
1623 for (i = 0; i < 4; i++)
1628 /* (0,+) - check for bottom boundary */
1629 if ((node / m < n - 1) && (visited[node + m] == 0))
1631 place_floor_bold(y + 1, x);
1632 r_visit(y1, x1, y2, x2, node + m, dir, visited);
1636 /* (0,-) - check for top boundary */
1637 if ((node / m > 0) && (visited[node - m] == 0))
1639 place_floor_bold(y - 1, x);
1640 r_visit(y1, x1, y2, x2, node - m, dir, visited);
1644 /* (+,0) - check for right boundary */
1645 if ((node % m < m - 1) && (visited[node + 1] == 0))
1647 place_floor_bold(y, x + 1);
1648 r_visit(y1, x1, y2, x2, node + 1, dir, visited);
1652 /* (-,0) - check for left boundary */
1653 if ((node % m > 0) && (visited[node - 1] == 0))
1655 place_floor_bold(y, x - 1);
1656 r_visit(y1, x1, y2, x2, node - 1, dir, visited);
1663 void build_maze_vault(int x0, int y0, int xsize, int ysize, bool is_vault)
1667 int m, n, num_vertices, *visited;
1671 msg_print_wizard(CHEAT_DUNGEON, _("迷路ランダムVaultを生成しました。", "Maze Vault."));
1673 /* Choose lite or dark */
1674 light = ((dun_level <= randint1(25)) && is_vault && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
1676 /* Pick a random room size - randomized by calling routine */
1685 /* generate the room */
1686 for (y = y1 - 1; y <= y2 + 1; y++)
1688 for (x = x1 - 1; x <= x2 + 1; x++)
1690 c_ptr = &cave[y][x];
1691 c_ptr->info |= CAVE_ROOM;
1692 if (is_vault) c_ptr->info |= CAVE_ICKY;
1693 if ((x == x1 - 1) || (x == x2 + 1) || (y == y1 - 1) || (y == y2 + 1))
1695 place_outer_grid(c_ptr);
1699 place_extra_grid(c_ptr);
1703 place_inner_grid(c_ptr);
1705 if (light) c_ptr->info |= (CAVE_GLOW);
1709 /* dimensions of vertex array */
1712 num_vertices = m * n;
1714 /* initialize array of visited vertices */
1715 C_MAKE(visited, num_vertices, int);
1717 /* traverse the graph to create a spaning tree, pick a random root */
1718 r_visit(y1, x1, y2, x2, randint0(num_vertices), 0, visited);
1720 /* Fill with monsters and treasure, low difficulty */
1721 if (is_vault) fill_treasure(x1, x2, y1, y2, randint1(5));
1723 C_KILL(visited, num_vertices, int);
1727 /* Build a town/ castle by using a recursive algorithm.
1728 * Basically divide each region in a probalistic way to create
1729 * smaller regions. When the regions get too small stop.
1731 * The power variable is a measure of how well defended a region is.
1732 * This alters the possible choices.
1734 void build_recursive_room(int x1, int y1, int x2, int y2, int power)
1740 /* Temp variables */
1746 if ((power < 3) && (xsize > 12) && (ysize > 12))
1748 /* Need outside wall +keep */
1755 /* Make rooms + subdivide */
1756 if ((randint1(10) > 2) && (xsize < 8) && (ysize < 8))
1762 choice = randint1(2) + 1;
1767 /* Mostly subdivide */
1768 choice = randint1(3) + 1;
1772 /* Based on the choice made above, do something */
1780 /* top and bottom */
1781 for (x = x1; x <= x2; x++)
1783 place_outer_bold(y1, x);
1784 place_outer_bold(y2, x);
1787 /* left and right */
1788 for (y = y1 + 1; y < y2; y++)
1790 place_outer_bold(y, x1);
1791 place_outer_bold(y, x2);
1794 /* Make a couple of entrances */
1797 /* left and right */
1798 y = randint1(ysize) + y1;
1799 place_floor_bold(y, x1);
1800 place_floor_bold(y, x2);
1804 /* top and bottom */
1805 x = randint1(xsize) + x1;
1806 place_floor_bold(y1, x);
1807 place_floor_bold(y2, x);
1810 /* Select size of keep */
1811 t1 = randint1(ysize / 3) + y1;
1812 t2 = y2 - randint1(ysize / 3);
1813 t3 = randint1(xsize / 3) + x1;
1814 t4 = x2 - randint1(xsize / 3);
1816 /* Do outside areas */
1818 /* Above and below keep */
1819 build_recursive_room(x1 + 1, y1 + 1, x2 - 1, t1, power + 1);
1820 build_recursive_room(x1 + 1, t2, x2 - 1, y2, power + 1);
1822 /* Left and right of keep */
1823 build_recursive_room(x1 + 1, t1 + 1, t3, t2 - 1, power + 3);
1824 build_recursive_room(t4, t1 + 1, x2 - 1, t2 - 1, power + 3);
1826 /* Make the keep itself: */
1839 /* Try to build a room */
1840 if ((xsize < 3) || (ysize < 3))
1842 for (y = y1; y < y2; y++)
1844 for (x = x1; x < x2; x++)
1846 place_inner_bold(y, x);
1854 /* Make outside walls */
1855 /* top and bottom */
1856 for (x = x1 + 1; x <= x2 - 1; x++)
1858 place_inner_bold(y1 + 1, x);
1859 place_inner_bold(y2 - 1, x);
1862 /* left and right */
1863 for (y = y1 + 1; y <= y2 - 1; y++)
1865 place_inner_bold(y, x1 + 1);
1866 place_inner_bold(y, x2 - 1);
1870 y = randint1(ysize - 3) + y1 + 1;
1875 place_floor_bold(y, x1 + 1);
1880 place_floor_bold(y, x2 - 1);
1883 /* Build the room */
1884 build_recursive_room(x1 + 2, y1 + 2, x2 - 2, y2 - 2, power + 3);
1889 /* Try and divide vertically */
1893 for (y = y1; y < y2; y++)
1895 for (x = x1; x < x2; x++)
1897 place_inner_bold(y, x);
1903 t1 = randint1(xsize - 2) + x1 + 1;
1904 build_recursive_room(x1, y1, t1, y2, power - 2);
1905 build_recursive_room(t1 + 1, y1, x2, y2, power - 2);
1910 /* Try and divide horizontally */
1914 for (y = y1; y < y2; y++)
1916 for (x = x1; x < x2; x++)
1918 place_inner_bold(y, x);
1924 t1 = randint1(ysize - 2) + y1 + 1;
1925 build_recursive_room(x1, y1, x2, t1, power - 2);
1926 build_recursive_room(x1, t1 + 1, x2, y2, power - 2);
1934 * Add outer wall to a floored region
1935 * Note: no range checking is done so must be inside dungeon
1936 * This routine also stomps on doors
1938 void add_outer_wall(int x, int y, int light, int x1, int y1, int x2, int y2)
1941 feature_type *f_ptr;
1944 if (!in_bounds(y, x)) return;
1946 c_ptr = &cave[y][x];
1948 /* hack- check to see if square has been visited before
1949 * if so, then exit (use room flag to do this) */
1950 if (c_ptr->info & CAVE_ROOM) return;
1953 c_ptr->info |= CAVE_ROOM;
1955 f_ptr = &f_info[c_ptr->feat];
1957 if (is_floor_bold(y, x))
1959 for (i = -1; i <= 1; i++)
1961 for (j = -1; j <= 1; j++)
1963 if ((x + i >= x1) && (x + i <= x2) &&
1964 (y + j >= y1) && (y + j <= y2))
1966 add_outer_wall(x + i, y + j, light, x1, y1, x2, y2);
1967 if (light) c_ptr->info |= CAVE_GLOW;
1972 else if (is_extra_bold(y, x))
1974 /* Set bounding walls */
1975 place_outer_bold(y, x);
1976 if (light) c_ptr->info |= CAVE_GLOW;
1978 else if (permanent_wall(f_ptr))
1980 /* Set bounding walls */
1981 if (light) c_ptr->info |= CAVE_GLOW;
1987 * Hacked distance formula - gives the 'wrong' answer.
1988 * Used to build crypts
1990 int dist2(int x1, int y1, int x2, int y2, int h1, int h2, int h3, int h4)
1996 /* Basically this works by taking the normal pythagorean formula
1997 * and using an expansion to express this in a way without the
1998 * square root. This approximate formula is then perturbed to give
1999 * the distorted results. (I found this by making a mistake when I was
2000 * trying to fix the circular rooms.)
2003 /* h1-h4 are constants that describe the metric */
2004 if (dx >= 2 * dy) return (dx + (dy * h1) / h2);
2005 if (dy >= 2 * dx) return (dy + (dx * h1) / h2);
2006 return (((dx + dy) * 128) / 181 +
2007 (dx * dx / (dy * h3) + dy * dy / (dx * h3)) * h4);
2008 /* 128/181 is approx. 1/sqrt(2) */
2014 /* Create a new floor room with optional light */
2015 void generate_room_floor(int y1, int x1, int y2, int x2, int light)
2021 for (y = y1; y <= y2; y++)
2023 for (x = x1; x <= x2; x++)
2026 c_ptr = &cave[y][x];
2027 place_floor_grid(c_ptr);
2028 c_ptr->info |= (CAVE_ROOM);
2029 if (light) c_ptr->info |= (CAVE_GLOW);
2034 void generate_fill_perm_bold(int y1, int x1, int y2, int x2)
2038 for (y = y1; y <= y2; y++)
2040 for (x = x1; x <= x2; x++)
2043 place_inner_perm_bold(y, x);
2050 * @brief 与えられた部屋型IDに応じて部屋の生成処理分岐を行い結果を返す / Attempt to build a room of the given type at the given block
2052 * @note that we restrict the number of "crowded" rooms to reduce the chance of overflowing the monster list during level creation.
2053 * @return 部屋の精製に成功した場合 TRUE を返す。
2055 static bool room_build(int typ)
2060 /* Build an appropriate room */
2061 case ROOM_T_NORMAL: return build_type1();
2062 case ROOM_T_OVERLAP: return build_type2();
2063 case ROOM_T_CROSS: return build_type3();
2064 case ROOM_T_INNER_FEAT: return build_type4();
2065 case ROOM_T_NEST: return build_type5();
2066 case ROOM_T_PIT: return build_type6();
2067 case ROOM_T_LESSER_VAULT: return build_type7();
2068 case ROOM_T_GREATER_VAULT: return build_type8();
2069 case ROOM_T_FRACAVE: return build_type9();
2070 case ROOM_T_RANDOM_VAULT: return build_type10();
2071 case ROOM_T_OVAL: return build_type11();
2072 case ROOM_T_CRYPT: return build_type12();
2073 case ROOM_T_TRAP_PIT: return build_type13();
2074 case ROOM_T_TRAP: return build_type14();
2075 case ROOM_T_GLASS: return build_type15();
2076 case ROOM_T_ARCADE: return build_type16();
2077 case ROOM_T_FIXED: return build_type17();
2085 * @brief 指定した部屋の生成確率を別の部屋に加算し、指定した部屋の生成率を0にする
2086 * @param dst 確率を移す先の部屋種ID
2087 * @param src 確率を与える元の部屋種ID
2089 #define MOVE_PLIST(dst, src) (prob_list[dst] += prob_list[src], prob_list[src] = 0)
2092 * @brief 部屋生成処理のメインルーチン(Sangbandを経由してOangbandからの実装を引用) / Generate rooms in dungeon. Build bigger rooms at first. [from SAngband (originally from OAngband)]
2093 * @return 部屋生成に成功した場合 TRUE を返す。
2095 bool generate_rooms(void)
2101 int prob_list[ROOM_T_MAX];
2102 int rooms_built = 0;
2103 int area_size = 100 * (cur_hgt*cur_wid) / (MAX_HGT*MAX_WID);
2104 int level_index = MIN(10, div_round(dun_level, 10));
2106 /* Number of each type of room on this level */
2107 s16b room_num[ROOM_T_MAX];
2109 /* Limit number of rooms */
2110 int dun_rooms = DUN_ROOMS_MAX * area_size / 100;
2112 /* Assume normal cave */
2113 room_info_type *room_info_ptr = room_info_normal;
2116 * Initialize probability list.
2118 for (i = 0; i < ROOM_T_MAX; i++)
2120 /* No rooms allowed above their minimum depth. */
2121 if (dun_level < room_info_ptr[i].min_level)
2127 prob_list[i] = room_info_ptr[i].prob[level_index];
2132 * XXX -- Various dungeon types and options.
2135 /*! @details ダンジョンにBEGINNER、CHAMELEON、SMALLESTいずれのフラグもなく、かつ「常に通常でない部屋を生成する」フラグがONならば、GRATER_VAULTのみを生成対象とする。 / Ironman sees only Greater Vaults */
2136 if (ironman_rooms && !((d_info[dungeon_type].flags1 & (DF1_BEGINNER | DF1_CHAMELEON | DF1_SMALLEST))))
2138 for (i = 0; i < ROOM_T_MAX; i++)
2140 if (i == ROOM_T_GREATER_VAULT) prob_list[i] = 1;
2141 else prob_list[i] = 0;
2145 /*! @details ダンジョンにNO_VAULTフラグがあるならば、LESSER_VAULT / GREATER_VAULT/ RANDOM_VAULTを除外 / Forbidden vaults */
2146 else if (d_info[dungeon_type].flags1 & DF1_NO_VAULT)
2148 prob_list[ROOM_T_LESSER_VAULT] = 0;
2149 prob_list[ROOM_T_GREATER_VAULT] = 0;
2150 prob_list[ROOM_T_RANDOM_VAULT] = 0;
2153 /*! @details ダンジョンにNO_CAVEフラグがある場合、FRACAVEの生成枠がNORMALに与えられる。CRIPT、OVALの生成枠がINNER_Fに与えられる。/ NO_CAVE dungeon (Castle)*/
2154 if (d_info[dungeon_type].flags1 & DF1_NO_CAVE)
2156 MOVE_PLIST(ROOM_T_NORMAL, ROOM_T_FRACAVE);
2157 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_CRYPT);
2158 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_OVAL);
2161 /*! @details ダンジョンにCAVEフラグがある場合、NORMALの生成枠がFRACAVEに与えられる。/ CAVE dungeon (Orc cave etc.) */
2162 else if (d_info[dungeon_type].flags1 & DF1_CAVE)
2164 MOVE_PLIST(ROOM_T_FRACAVE, ROOM_T_NORMAL);
2167 /*! @details ダンジョンの基本地形が最初から渓谷かアリーナ型の場合 FRACAVE は生成から除外。 / No caves when a (random) cavern exists: they look bad */
2168 else if (dun->cavern || dun->empty_level)
2170 prob_list[ROOM_T_FRACAVE] = 0;
2173 /*! @details ダンジョンに最初からGLASS_ROOMフラグがある場合、GLASS を生成から除外。/ Forbidden glass rooms */
2174 if (!(d_info[dungeon_type].flags1 & DF1_GLASS_ROOM))
2176 prob_list[ROOM_T_GLASS] = 0;
2179 /*! @details ARCADEは同フラグがダンジョンにないと生成されない。 / Forbidden glass rooms */
2180 if (!(d_info[dungeon_type].flags1 & DF1_ARCADE))
2182 prob_list[ROOM_T_ARCADE] = 0;
2186 * Initialize number of rooms,
2187 * And calcurate total probability.
2189 for (total_prob = 0, i = 0; i < ROOM_T_MAX; i++)
2192 total_prob += prob_list[i];
2196 * Prepare the number of rooms, of all types, we should build
2199 for (i = dun_rooms; i > 0; i--)
2202 int rand = randint0(total_prob);
2204 /* Get room_type randomly */
2205 for (room_type = 0; room_type < ROOM_T_MAX; room_type++)
2207 if (rand < prob_list[room_type]) break;
2208 else rand -= prob_list[room_type];
2212 if (room_type >= ROOM_T_MAX) room_type = ROOM_T_NORMAL;
2214 /* Increase the number of rooms of that type we should build. */
2215 room_num[room_type]++;
2221 case ROOM_T_LESSER_VAULT:
2222 case ROOM_T_TRAP_PIT:
2230 case ROOM_T_GREATER_VAULT:
2231 case ROOM_T_RANDOM_VAULT:
2240 * Build each type of room one by one until we cannot build any more.
2241 * [from SAngband (originally from OAngband)]
2245 /* Assume no remaining rooms */
2248 for (i = 0; i < ROOM_T_MAX; i++)
2250 /* What type of room are we building now? */
2251 int room_type = room_build_order[i];
2253 /* Go next if none available */
2254 if (!room_num[room_type]) continue;
2256 /* Use up one unit */
2257 room_num[room_type]--;
2259 /* Build the room. */
2260 if (room_build(room_type))
2262 /* Increase the room built count. */
2265 /* Mark as there was some remaining rooms */
2272 case ROOM_T_TRAP_PIT:
2274 /* Avoid too many monsters */
2277 room_num[ROOM_T_PIT] = 0;
2278 room_num[ROOM_T_NEST] = 0;
2279 room_num[ROOM_T_TRAP_PIT] = 0;
2285 /* Avoid double-town */
2286 room_num[ROOM_T_ARCADE] = 0;
2292 /* End loop if no room remain */
2296 /*! @details 部屋生成数が2未満の場合生成失敗を返す */
2297 if (rooms_built < 2)
2299 msg_format_wizard(CHEAT_DUNGEON, _("部屋数が2未満でした。生成を再試行します。", "Number of rooms was under 2. Retry."), rooms_built);
2303 msg_format_wizard(CHEAT_DUNGEON, _("このダンジョンの部屋数は %d です。", "Number of Rooms: %d"), rooms_built);