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(POSITION x0, POSITION 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(POSITION x1, POSITION y1, POSITION x2, POSITION y2)
174 bool old_is_floor, new_is_floor;
180 old_is_floor = get_is_floor(x1 - 1, y1);
183 * Count the number of floor-wall boundaries around the room
184 * Note: diagonal squares are ignored since the player can move diagonally
185 * to bypass these if needed.
188 /* Above the top boundary */
189 for (x = x1; x <= x2; x++)
191 new_is_floor = get_is_floor(x, y1 - 1);
193 /* Increment counter if they are different */
194 if (new_is_floor != old_is_floor) count++;
196 old_is_floor = new_is_floor;
200 for (y = y1; y <= y2; y++)
202 new_is_floor = get_is_floor(x2 + 1, y);
204 /* increment counter if they are different */
205 if (new_is_floor != old_is_floor) count++;
207 old_is_floor = new_is_floor;
210 /* Bottom boundary */
211 for (x = x2; x >= x1; x--)
213 new_is_floor = get_is_floor(x, y2 + 1);
215 /* increment counter if they are different */
216 if (new_is_floor != old_is_floor) count++;
218 old_is_floor = new_is_floor;
222 for (y = y2; y >= y1; y--)
224 new_is_floor = get_is_floor(x1 - 1, y);
226 /* increment counter if they are different */
227 if (new_is_floor != old_is_floor) count++;
229 old_is_floor = new_is_floor;
232 /* If all the same, or only one connection exit. */
233 if (count <= 2) return;
236 /* Tunnel around the room so to prevent problems with caves */
237 for (y = y1; y <= y2; y++)
239 for (x = x1; x <= x2; x++)
249 * find_space()の予備処理として部屋の生成が可能かを判定する /
250 * Helper function for find_space(). Is this a good location?
251 * @param blocks_high 範囲の高さ
252 * @param blocks_wide 範囲の幅
253 * @param block_y 範囲の上端
254 * @param block_x 範囲の左端
257 static bool find_space_aux(int blocks_high, int blocks_wide, int block_y, int block_x)
259 int by1, bx1, by2, bx2, by, bx;
261 /* Itty-bitty rooms must shift about within their rectangle */
264 if ((blocks_wide == 2) && (block_x % 3) == 2)
268 /* Rooms with width divisible by 3 must be fitted to a rectangle. */
269 else if ((blocks_wide % 3) == 0)
271 /* Must be aligned to the left edge of a 11x33 rectangle. */
272 if ((block_x % 3) != 0)
277 * Big rooms that do not have a width divisible by 3 must be
278 * aligned towards the edge of the dungeon closest to them.
282 /* Shift towards left edge of dungeon. */
283 if (block_x + (blocks_wide / 2) <= dun->col_rooms / 2)
285 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
287 if ((block_x % 3) == 1)
291 /* Shift toward right edge of dungeon. */
294 if (((block_x % 3) == 2) && ((blocks_wide % 3) == 2))
296 if ((block_x % 3) == 1)
304 by2 = block_y + blocks_high;
305 bx2 = block_x + blocks_wide;
307 /* Never run off the screen */
308 if ((by1 < 0) || (by2 > dun->row_rooms)) return FALSE;
309 if ((bx1 < 0) || (bx2 > dun->col_rooms)) return FALSE;
311 /* Verify available space */
312 for (by = by1; by < by2; by++)
314 for (bx = bx1; bx < bx2; bx++)
316 if (dun->room_map[by][bx])
323 /* This location is okay */
329 * @brief 部屋生成が可能なスペースを確保する / Find a good spot for the next room. -LM-
330 * @param y 部屋の生成が可能な中心Y座標を返す参照ポインタ
331 * @param x 部屋の生成が可能な中心X座標を返す参照ポインタ
332 * @param height 確保したい領域の高さ
333 * @param width 確保したい領域の幅
334 * @return 所定の範囲が確保できた場合TRUEを返す
336 * Find and allocate a free space in the dungeon large enough to hold\n
337 * the room calling this function.\n
339 * We allocate space in 11x11 blocks, but want to make sure that rooms\n
340 * align neatly on the standard screen. Therefore, we make them use\n
341 * blocks in few 11x33 rectangles as possible.\n
343 * Be careful to include the edges of the room in height and width!\n
345 * Return TRUE and values for the center of the room if all went well.\n
346 * Otherwise, return FALSE.\n
348 bool find_space(POSITION *y, POSITION *x, POSITION height, POSITION width)
350 int candidates, pick;
351 int by, bx, by1, bx1, by2, bx2;
352 int block_y = 0, block_x = 0;
355 /* Find out how many blocks we need. */
356 int blocks_high = 1 + ((height - 1) / BLOCK_HGT);
357 int blocks_wide = 1 + ((width - 1) / BLOCK_WID);
359 /* There are no way to allocate such huge space */
360 if (dun->row_rooms < blocks_high) return FALSE;
361 if (dun->col_rooms < blocks_wide) return FALSE;
366 /* Count the number of valid places */
367 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
369 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
371 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
373 /* Find a valid place */
386 if (!(d_info[dungeon_type].flags1 & DF1_NO_CAVE))
388 /* Choose a random one */
389 pick = randint1(candidates);
392 /* NO_CAVE dungeon (Castle) */
395 /* Always choose the center one */
396 pick = candidates/2 + 1;
399 /* Pick up the choosen location */
400 for (block_y = dun->row_rooms - blocks_high; block_y >= 0; block_y--)
402 for (block_x = dun->col_rooms - blocks_wide; block_x >= 0; block_x--)
404 if (find_space_aux(blocks_high, blocks_wide, block_y, block_x))
408 /* This one is picked? */
419 by2 = block_y + blocks_high;
420 bx2 = block_x + blocks_wide;
423 * It is *extremely* important that the following calculation
424 * be *exactly* correct to prevent memory errors
427 /* Acquire the location of the room */
428 (*y) = ((by1 + by2) * BLOCK_HGT) / 2;
429 (*x) = ((bx1 + bx2) * BLOCK_WID) / 2;
431 /* Save the room location */
432 if (dun->cent_n < CENT_MAX)
434 dun->cent[dun->cent_n].y = (byte_hack)*y;
435 dun->cent[dun->cent_n].x = (byte_hack)*x;
439 /* Reserve some blocks. */
440 for (by = by1; by < by2; by++)
442 for (bx = bx1; bx < bx2; bx++)
444 dun->room_map[by][bx] = TRUE;
450 * Hack- See if room will cut off a cavern.
452 * If so, fix by tunneling outside the room in such a
453 * way as to connect the caves.
455 check_room_boundary(*x - width / 2 - 1, *y - height / 2 - 1, *x + (width - 1) / 2 + 1, *y + (height - 1) / 2 + 1);
466 * Structure to hold all "fill" data
469 typedef struct fill_data_type fill_data_type;
471 struct fill_data_type
484 /* features to fill with */
493 /* number of filled squares */
497 static fill_data_type fill_data;
500 /* Store routine for the fractal cave generator */
501 /* this routine probably should be an inline function or a macro. */
502 static void store_height(int x, int y, int val)
504 /* if on boundary set val > cutoff so walls are not as square */
505 if (((x == fill_data.xmin) || (y == fill_data.ymin) ||
506 (x == fill_data.xmax) || (y == fill_data.ymax)) &&
507 (val <= fill_data.c1)) val = fill_data.c1 + 1;
509 /* store the value in height-map format */
510 cave[y][x].feat = (s16b)val;
517 * Explanation of the plasma fractal algorithm:
519 * A grid of points is created with the properties of a 'height-map'
520 * This is done by making the corners of the grid have a random value.
521 * The grid is then subdivided into one with twice the resolution.
522 * The new points midway between two 'known' points can be calculated
523 * by taking the average value of the 'known' ones and randomly adding
524 * or subtracting an amount proportional to the distance between those
525 * points. The final 'middle' points of the grid are then calculated
526 * by averaging all four of the originally 'known' corner points. An
527 * random amount is added or subtracted from this to get a value of the
528 * height at that point. The scaling factor here is adjusted to the
529 * slightly larger distance diagonally as compared to orthogonally.
531 * This is then repeated recursively to fill an entire 'height-map'
532 * A rectangular map is done the same way, except there are different
533 * scaling factors along the x and y directions.
535 * A hack to change the amount of correlation between points is done using
536 * the grd variable. If the current step size is greater than grd then
537 * the point will be random, otherwise it will be calculated by the
538 * above algorithm. This makes a maximum distance at which two points on
539 * the height map can affect each other.
541 * How fractal caves are made:
543 * When the map is complete, a cut-off value is used to create a cave.
544 * Heights below this value are "floor", and heights above are "wall".
545 * This also can be used to create lakes, by adding more height levels
546 * representing shallow and deep water/ lava etc.
548 * The grd variable affects the width of passages.
549 * The roug variable affects the roughness of those passages
551 * The tricky part is making sure the created cave is connected. This
552 * is done by 'filling' from the inside and only keeping the 'filled'
553 * floor. Walls bounding the 'filled' floor are also kept. Everything
554 * else is converted to the normal _extra_.
559 * Note that this uses the cave.feat array in a very hackish way
560 * the values are first set to zero, and then each array location
561 * is used as a "heightmap"
562 * The heightmap then needs to be converted back into the "feat" format.
564 * grd=level at which fractal turns on. smaller gives more mazelike caves
565 * roug=roughness level. 16=normal. higher values make things more convoluted
566 * small values are good for smooth walls.
567 * size=length of the side of the square cave system.
569 void generate_hmap(POSITION y0, POSITION x0, POSITION xsiz, POSITION ysiz, int grd, int roug, int cutoff)
571 POSITION xhsize, yhsize, xsize, ysize, maxsize;
574 * fixed point variables- these are stored as 256 x normal value
575 * this gives 8 binary places of fractional part + 8 places of normal part
578 u16b xstep, xhstep, ystep, yhstep;
579 u16b xstep2, xhstep2, ystep2, yhstep2;
580 u16b i, j, ii, jj, diagsize, xxsize, yysize;
582 /* Cache for speed */
585 /* redefine size so can change the value if out of range */
589 /* Paranoia about size of the system of caves */
590 if (xsize > 254) xsize = 254;
591 if (xsize < 4) xsize = 4;
592 if (ysize > 254) ysize = 254;
593 if (ysize < 4) ysize = 4;
595 /* get offsets to middle of array */
599 /* fix rounding problem */
603 /* get limits of region */
604 fill_data.xmin = x0 - xhsize;
605 fill_data.ymin = y0 - yhsize;
606 fill_data.xmax = x0 + xhsize;
607 fill_data.ymax = y0 + yhsize;
609 /* Store cutoff in global for quick access */
610 fill_data.c1 = cutoff;
613 * Scale factor for middle points:
614 * About sqrt(2) * 256 - correct for a square lattice
615 * approximately correct for everything else.
619 /* maximum of xsize and ysize */
620 maxsize = (xsize > ysize) ? xsize : ysize;
622 /* Clear the section */
623 for (i = 0; i <= xsize; i++)
625 for (j = 0; j <= ysize; j++)
627 /* -1 is a flag for "not done yet" */
628 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].feat = -1;
629 /* Clear icky flag because may be redoing the cave */
630 cave[(int)(fill_data.ymin + j)][(int)(fill_data.xmin + i)].info &= ~(CAVE_ICKY);
634 /* Boundaries are walls */
635 cave[fill_data.ymin][fill_data.xmin].feat = (s16b)maxsize;
636 cave[fill_data.ymax][fill_data.xmin].feat = (s16b)maxsize;
637 cave[fill_data.ymin][fill_data.xmax].feat = (s16b)maxsize;
638 cave[fill_data.ymax][fill_data.xmax].feat = (s16b)maxsize;
640 /* Set the middle square to be an open area. */
641 cave[y0][x0].feat = 0;
643 /* Initialize the step sizes */
644 xstep = xhstep = xsize * 256;
645 ystep = yhstep = ysize * 256;
646 xxsize = xsize * 256;
647 yysize = ysize * 256;
650 * Fill in the rectangle with fractal height data -
651 * like the 'plasma fractal' in fractint.
653 while ((xhstep > 256) || (yhstep > 256))
655 /* Halve the step sizes */
661 /* cache well used values */
662 xstep2 = xstep / 256;
663 ystep2 = ystep / 256;
665 xhstep2 = xhstep / 256;
666 yhstep2 = yhstep / 256;
668 /* middle top to bottom. */
669 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
671 for (j = 0; j <= yysize; j += ystep)
673 /* cache often used values */
674 ii = i / 256 + fill_data.xmin;
675 jj = j / 256 + fill_data.ymin;
678 if (cave[jj][ii].feat == -1)
682 /* If greater than 'grid' level then is random */
683 store_height(ii, jj, randint1(maxsize));
687 /* Average of left and right points +random bit */
689 (cave[jj][fill_data.xmin + (i - xhstep) / 256].feat
690 + cave[jj][fill_data.xmin + (i + xhstep) / 256].feat) / 2
691 + (randint1(xstep2) - xhstep2) * roug / 16);
698 /* middle left to right. */
699 for (j = yhstep; j <= yysize - yhstep; j += ystep)
701 for (i = 0; i <= xxsize; i += xstep)
703 /* cache often used values */
704 ii = i / 256 + fill_data.xmin;
705 jj = j / 256 + fill_data.ymin;
708 if (cave[jj][ii].feat == -1)
712 /* If greater than 'grid' level then is random */
713 store_height(ii, jj, randint1(maxsize));
717 /* Average of up and down points +random bit */
719 (cave[fill_data.ymin + (j - yhstep) / 256][ii].feat
720 + cave[fill_data.ymin + (j + yhstep) / 256][ii].feat) / 2
721 + (randint1(ystep2) - yhstep2) * roug / 16);
728 for (i = xhstep; i <= xxsize - xhstep; i += xstep)
730 for (j = yhstep; j <= yysize - yhstep; j += ystep)
732 /* cache often used values */
733 ii = i / 256 + fill_data.xmin;
734 jj = j / 256 + fill_data.ymin;
737 if (cave[jj][ii].feat == -1)
741 /* If greater than 'grid' level then is random */
742 store_height(ii, jj, randint1(maxsize));
746 /* Cache reused values. */
747 xm = fill_data.xmin + (i - xhstep) / 256;
748 xp = fill_data.xmin + (i + xhstep) / 256;
749 ym = fill_data.ymin + (j - yhstep) / 256;
750 yp = fill_data.ymin + (j + yhstep) / 256;
753 * Average over all four corners + scale by diagsize to
754 * reduce the effect of the square grid on the shape of the fractal
757 (cave[ym][xm].feat + cave[yp][xm].feat
758 + cave[ym][xp].feat + cave[yp][xp].feat) / 4
759 + (randint1(xstep2) - xhstep2) * (diagsize / 16) / 256 * roug);
768 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)
771 * function used to convert from height-map back to the
772 * normal angband cave format
774 if (cave[y][x].info & CAVE_ICKY)
781 /* Show that have looked at this square */
782 cave[y][x].info|= (CAVE_ICKY);
784 /* Use cutoffs c1-c3 to allocate regions of floor /water/ lava etc. */
785 if (cave[y][x].feat <= c1)
787 /* 25% of the time use the other tile : it looks better this way */
788 if (randint1(100) < 75)
790 cave[y][x].feat = (s16b)feat1;
791 cave[y][x].info &= ~(CAVE_MASK);
792 cave[y][x].info |= info1;
797 cave[y][x].feat = (s16b)feat2;
798 cave[y][x].info &= ~(CAVE_MASK);
799 cave[y][x].info |= info2;
803 else if (cave[y][x].feat <= c2)
805 /* 25% of the time use the other tile : it looks better this way */
806 if (randint1(100) < 75)
808 cave[y][x].feat = (s16b)feat2;
809 cave[y][x].info &= ~(CAVE_MASK);
810 cave[y][x].info |= info2;
815 cave[y][x].feat = (s16b)feat1;
816 cave[y][x].info &= ~(CAVE_MASK);
817 cave[y][x].info |= info1;
821 else if (cave[y][x].feat <= c3)
823 cave[y][x].feat = (s16b)feat3;
824 cave[y][x].info &= ~(CAVE_MASK);
825 cave[y][x].info |= info3;
828 /* if greater than cutoff then is a wall */
831 place_outer_bold(y, x);
841 * Quick and nasty fill routine used to find the connected region
842 * of floor in the middle of the cave
844 static void cave_fill(POSITION y, POSITION x)
855 /* Enqueue that entry */
860 /* Now process the queue */
861 while (flow_head != flow_tail)
863 /* Extract the next entry */
864 ty = temp_y[flow_head];
865 tx = temp_x[flow_head];
867 /* Forget that entry */
868 if (++flow_head == TEMP_MAX) flow_head = 0;
870 /* Add the "children" */
871 for (d = 0; d < 8; d++)
873 int old_head = flow_tail;
879 /* Paranoia Don't leave the cave */
880 if (!in_bounds(j, i))
882 /* affect boundary */
883 cave[j][i].info |= CAVE_ICKY;
887 /* If within bounds */
888 else if ((i > fill_data.xmin) && (i < fill_data.xmax)
889 && (j > fill_data.ymin) && (j < fill_data.ymax))
891 /* If not a wall or floor done before */
892 if (hack_isnt_wall(j, i,
893 fill_data.c1, fill_data.c2, fill_data.c3,
894 fill_data.feat1, fill_data.feat2, fill_data.feat3,
895 fill_data.info1, fill_data.info2, fill_data.info3))
897 /* Enqueue that entry */
898 temp_y[flow_tail] = (byte_hack)j;
899 temp_x[flow_tail] = (byte_hack)i;
901 /* Advance the queue */
902 if (++flow_tail == TEMP_MAX) flow_tail = 0;
904 /* Hack -- Overflow by forgetting new entry */
905 if (flow_tail == flow_head)
907 flow_tail = old_head;
911 /* keep tally of size of cave system */
912 (fill_data.amount)++;
918 /* affect boundary */
919 cave[j][i].info |= CAVE_ICKY;
926 bool generate_fracave(POSITION y0, POSITION x0, POSITION xsize, POSITION ysize, int cutoff, bool light, bool room)
928 POSITION x, y, xhsize, yhsize;
931 /* offsets to middle from corner */
937 * select region connected to center of cave system
938 * this gets rid of alot of isolated one-sqaures that
939 * can make teleport traps instadeaths...
943 fill_data.c1 = cutoff;
947 /* features to fill with */
948 fill_data.feat1 = floor_type[randint0(100)];
949 fill_data.feat2 = floor_type[randint0(100)];
950 fill_data.feat3 = floor_type[randint0(100)];
952 fill_data.info1 = CAVE_FLOOR;
953 fill_data.info2 = CAVE_FLOOR;
954 fill_data.info3 = CAVE_FLOOR;
956 /* number of filled squares */
957 fill_data.amount = 0;
959 cave_fill((byte)y0, (byte)x0);
961 /* if tally too small, try again */
962 if (fill_data.amount < 10)
964 /* too small - clear area and try again later */
965 for (x = 0; x <= xsize; ++x)
967 for (y = 0; y <= ysize; ++y)
969 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
970 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
977 * Do boundarys-check to see if they are next to a filled region
978 * If not then they are set to normal granite
979 * If so then they are marked as room walls.
981 for (i = 0; i <= xsize; ++i)
984 if ((cave[0 + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
986 /* Next to a 'filled' region? - set to be room walls */
987 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
988 if (light) cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_GLOW);
989 cave[y0 + 0 - yhsize][x0 + i - xhsize].info |= (CAVE_ROOM);
990 place_outer_bold(y0 + 0 - yhsize, x0 + i - xhsize);
994 /* set to be normal granite */
995 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
998 /* bottom boundary */
999 if ((cave[ysize + y0 - yhsize][i + x0 - xhsize].info & CAVE_ICKY) && (room))
1001 /* Next to a 'filled' region? - set to be room walls */
1002 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1003 if (light) cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_GLOW);
1004 cave[y0 + ysize - yhsize][x0 + i - xhsize].info|=(CAVE_ROOM);
1005 place_outer_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1009 /* set to be normal granite */
1010 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1013 /* clear the icky flag-don't need it any more */
1014 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1015 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1018 /* Do the left and right boundaries minus the corners (done above) */
1019 for (i = 1; i < ysize; ++i)
1022 if ((cave[i + y0 - yhsize][0 + x0 - xhsize].info & CAVE_ICKY) && room)
1025 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1026 if (light) cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_GLOW);
1027 cave[y0 + i - yhsize][x0 + 0 - xhsize].info |= (CAVE_ROOM);
1028 place_outer_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1033 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1035 /* right boundary */
1036 if ((cave[i + y0 - yhsize][xsize + x0 - xhsize].info & CAVE_ICKY) && room)
1039 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1040 if (light) cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_GLOW);
1041 cave[y0 + i - yhsize][x0 + xsize - xhsize].info |= (CAVE_ROOM);
1042 place_outer_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1047 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1050 /* clear icky flag -done with it */
1051 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
1052 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
1056 /* Do the rest: convert back to the normal format */
1057 for (x = 1; x < xsize; ++x)
1059 for (y = 1; y < ysize; ++y)
1061 if (is_floor_bold(y0 + y - yhsize, x0 + x - xhsize) &&
1062 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
1064 /* Clear the icky flag in the filled region */
1065 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~CAVE_ICKY;
1067 /* Set appropriate flags */
1068 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
1069 if (room) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
1071 else if (is_outer_bold(y0 + y - yhsize, x0 + x - xhsize) &&
1072 (cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY))
1075 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
1076 if (light) cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_GLOW);
1079 cave[y0 + y - yhsize][x0 + x - xhsize].info |= (CAVE_ROOM);
1084 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1085 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ROOM);
1090 /* Clear the unconnected regions */
1091 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1092 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
1098 * XXX XXX XXX There is a slight problem when tunnels pierce the caves:
1099 * Extra doors appear inside the system. (Its not very noticeable though.)
1100 * This can be removed by "filling" from the outside in. This allows a separation
1101 * from _outer_ with _inner_. (Internal walls are _outer_ instead.)
1102 * The extra effort for what seems to be only a minor thing (even non-existant if you
1103 * think of the caves not as normal rooms, but as holes in the dungeon), doesn't seem
1111 #ifdef ALLOW_CAVERNS_AND_LAKES
1113 * Builds a cave system in the center of the dungeon.
1115 void build_cavern(void)
1117 int grd, roug, cutoff, xsize, ysize, x0, y0;
1120 light = done = FALSE;
1121 if ((dun_level <= randint1(50)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
1123 /* Make a cave the size of the dungeon */
1124 xsize = cur_wid - 1;
1125 ysize = cur_hgt - 1;
1129 /* Paranoia: make size even */
1135 /* testing values for these parameters: feel free to adjust */
1136 grd = randint1(4) + 4;
1138 /* want average of about 16 */
1139 roug = randint1(8) * randint1(4);
1145 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, cutoff);
1147 /* Convert to normal format+ clean up */
1148 done = generate_fracave(y0 + 1, x0 + 1, xsize, ysize, cutoff, light, FALSE);
1152 bool generate_lake(int y0, int x0, int xsize, int ysize, int c1, int c2, int c3, int type)
1154 int x, y, i, xhsize, yhsize;
1155 int feat1, feat2, feat3;
1157 /* offsets to middle from corner */
1161 /* Get features based on type */
1164 case LAKE_T_LAVA: /* Lava */
1165 feat1 = feat_deep_lava;
1166 feat2 = feat_shallow_lava;
1167 feat3 = floor_type[randint0(100)];
1169 case LAKE_T_WATER: /* Water */
1170 feat1 = feat_deep_water;
1171 feat2 = feat_shallow_water;
1172 feat3 = floor_type[randint0(100)];
1174 case LAKE_T_CAVE: /* Collapsed cave */
1175 feat1 = floor_type[randint0(100)];
1176 feat2 = floor_type[randint0(100)];
1177 feat3 = feat_rubble;
1179 case LAKE_T_EARTH_VAULT: /* Earth vault */
1180 feat1 = feat_rubble;
1181 feat2 = floor_type[randint0(100)];
1182 feat3 = feat_rubble;
1184 case LAKE_T_AIR_VAULT: /* Air vault */
1189 case LAKE_T_WATER_VAULT: /* Water vault */
1190 feat1 = feat_shallow_water;
1191 feat2 = feat_deep_water;
1192 feat3 = feat_shallow_water;
1194 case LAKE_T_FIRE_VAULT: /* Fire Vault */
1195 feat1 = feat_shallow_lava;
1196 feat2 = feat_deep_lava;
1197 feat3 = feat_shallow_lava;
1201 default: return FALSE;
1205 * select region connected to center of cave system
1206 * this gets rid of alot of isolated one-sqaures that
1207 * can make teleport traps instadeaths...
1215 /* features to fill with */
1216 fill_data.feat1 = feat1;
1217 fill_data.feat2 = feat2;
1218 fill_data.feat3 = feat3;
1220 fill_data.info1 = 0;
1221 fill_data.info2 = 0;
1222 fill_data.info3 = 0;
1224 /* number of filled squares */
1225 fill_data.amount = 0;
1227 /* select region connected to center of cave system
1228 * this gets rid of alot of isolated one-sqaures that
1229 * can make teleport traps instadeaths... */
1230 cave_fill((byte)y0, (byte)x0);
1232 /* if tally too small, try again */
1233 if (fill_data.amount < 10)
1235 /* too small -clear area and try again later */
1236 for (x = 0; x <= xsize; ++x)
1238 for (y = 0; y <= ysize; ++y)
1240 place_floor_bold(y0 + y - yhsize, x0 + x - xhsize);
1241 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY);
1247 /* Do boundarys- set to normal granite */
1248 for (i = 0; i <= xsize; ++i)
1250 place_extra_bold(y0 + 0 - yhsize, x0 + i - xhsize);
1251 place_extra_bold(y0 + ysize - yhsize, x0 + i - xhsize);
1253 /* clear the icky flag-don't need it any more */
1254 cave[y0 + 0 - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1255 cave[y0 + ysize - yhsize][x0 + i - xhsize].info &= ~(CAVE_ICKY);
1258 /* Do the left and right boundaries minus the corners (done above) */
1260 for (i = 1; i < ysize; ++i)
1262 place_extra_bold(y0 + i - yhsize, x0 + 0 - xhsize);
1263 place_extra_bold(y0 + i - yhsize, x0 + xsize - xhsize);
1265 /* clear icky flag -done with it */
1266 cave[y0 + i - yhsize][x0 + 0 - xhsize].info &= ~(CAVE_ICKY);
1267 cave[y0 + i - yhsize][x0 + xsize - xhsize].info &= ~(CAVE_ICKY);
1271 /* Do the rest: convert back to the normal format */
1272 for (x = 1; x < xsize; ++x)
1274 for (y = 1; y < ysize; ++y)
1276 /* Fill unconnected regions with granite */
1277 if ((!(cave[y0 + y - yhsize][x0 + x - xhsize].info & CAVE_ICKY)) ||
1278 is_outer_bold(y0 + y - yhsize, x0 + x - xhsize))
1279 place_extra_bold(y0 + y - yhsize, x0 + x - xhsize);
1281 /* turn off icky flag (no longer needed.) */
1282 cave[y0 + y - yhsize][x0 + x - xhsize].info &= ~(CAVE_ICKY | CAVE_ROOM);
1285 if (cave_have_flag_bold(y0 + y - yhsize, x0 + x - xhsize, FF_LAVA))
1287 if (!(d_info[dungeon_type].flags1 & DF1_DARKNESS)) cave[y0 + y - yhsize][x0 + x - xhsize].info |= CAVE_GLOW;
1297 * makes a lake/collapsed cave system in the center of the dungeon
1299 void build_lake(int type)
1301 int grd, roug, xsize, ysize, x0, y0;
1305 /* paranoia - exit if lake type out of range. */
1306 if ((type < LAKE_T_LAVA) || (type > LAKE_T_FIRE_VAULT))
1308 msg_format("Invalid lake type (%d)", type);
1312 /* Make the size of the dungeon */
1313 xsize = cur_wid - 1;
1314 ysize = cur_hgt - 1;
1318 /* Paranoia: make size even */
1324 /* testing values for these parameters: feel free to adjust */
1325 grd = randint1(3) + 4;
1327 /* want average of about 16 */
1328 roug = randint1(8) * randint1(4);
1330 /* Make up size of various componants */
1334 /* Deep water/lava */
1335 c1 = randint0(c3 / 2) + randint0(c3 / 2) - 5;
1337 /* Shallow boundary */
1341 generate_hmap(y0 + 1, x0 + 1, xsize, ysize, grd, roug, c3);
1343 /* Convert to normal format+ clean up */
1344 done = generate_lake(y0 + 1, x0 + 1, xsize, ysize, c1, c2, c3, type);
1347 #endif /* ALLOW_CAVERNS_AND_LAKES */
1352 * Routine that fills the empty areas of a room with treasure and monsters.
1354 void fill_treasure(int x1, int x2, int y1, int y2, int difficulty)
1356 int x, y, cx, cy, size;
1359 /* center of room:*/
1363 /* Rough measure of size of vault= sum of lengths of sides */
1364 size = abs(x2 - x1) + abs(y2 - y1);
1366 for (x = x1; x <= x2; x++)
1368 for (y = y1; y <= y2; y++)
1370 /* Thing added based on distance to center of vault
1371 * Difficulty is 1-easy to 10-hard */
1372 value = ((((s32b)(distance(cx, cy, x, y))) * 100) / size) + randint1(10) - difficulty;
1374 /* hack- empty square part of the time */
1375 if ((randint1(100) - difficulty * 3) > 50) value = 20;
1377 /* if floor, shallow water and lava */
1378 if (is_floor_bold(y, x) ||
1379 (cave_have_flag_bold(y, x, FF_PLACE) && cave_have_flag_bold(y, x, FF_DROP)))
1381 /* The smaller 'value' is, the better the stuff */
1384 /* Meanest monster + treasure */
1385 monster_level = base_level + 40;
1386 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1387 monster_level = base_level;
1388 object_level = base_level + 20;
1389 place_object(y, x, AM_GOOD);
1390 object_level = base_level;
1394 /* Mean monster +treasure */
1395 monster_level = base_level + 20;
1396 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1397 monster_level = base_level;
1398 object_level = base_level + 10;
1399 place_object(y, x, AM_GOOD);
1400 object_level = base_level;
1402 else if (value < 10)
1405 monster_level = base_level + 9;
1406 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1407 monster_level = base_level;
1409 else if (value < 17)
1411 /* Intentional Blank space */
1414 * (Want some of the vault to be empty
1415 * so have room for group monsters.
1416 * This is used in the hack above to lower
1417 * the density of stuff in the vault.)
1420 else if (value < 23)
1422 /* Object or trap */
1423 if (randint0(100) < 25)
1425 place_object(y, x, 0L);
1432 else if (value < 30)
1434 /* Monster and trap */
1435 monster_level = base_level + 5;
1436 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1437 monster_level = base_level;
1440 else if (value < 40)
1442 /* Monster or object */
1443 if (randint0(100) < 50)
1445 monster_level = base_level + 3;
1446 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1447 monster_level = base_level;
1449 if (randint0(100) < 50)
1451 object_level = base_level + 7;
1452 place_object(y, x, 0L);
1453 object_level = base_level;
1456 else if (value < 50)
1465 /* 20% monster, 40% trap, 20% object, 20% blank space */
1466 if (randint0(100) < 20)
1468 place_monster(y, x, (PM_ALLOW_SLEEP | PM_ALLOW_GROUP));
1470 else if (randint0(100) < 50)
1474 else if (randint0(100) < 50)
1476 place_object(y, x, 0L);
1488 * Overlay a rectangular room given its bounds
1489 * This routine is used by build_room_vault
1490 * The area inside the walls is not touched:
1491 * only granite is removed- normal walls stay
1493 void build_room(int x1, int x2, int y1, int y2)
1495 int x, y, i, xsize, ysize, temp;
1497 /* Check if rectangle has no width */
1498 if ((x1 == x2) || (y1 == y2)) return;
1503 /* Swap boundaries if in wrong order */
1511 /* Swap boundaries if in wrong order */
1517 /* get total widths */
1522 /* Top and bottom boundaries */
1523 for (i = 0; i <= xsize; i++)
1525 place_outer_noperm_bold(y1, x1 + i);
1526 cave[y1][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
1527 place_outer_noperm_bold(y2, x1 + i);
1528 cave[y2][x1 + i].info |= (CAVE_ROOM | CAVE_ICKY);
1531 /* Left and right boundaries */
1532 for (i = 1; i < ysize; i++)
1534 place_outer_noperm_bold(y1 + i, x1);
1535 cave[y1 + i][x1].info|=(CAVE_ROOM | CAVE_ICKY);
1536 place_outer_noperm_bold(y1 + i, x2);
1537 cave[y1 + i][x2].info|=(CAVE_ROOM | CAVE_ICKY);
1541 for (x = 1; x < xsize; x++)
1543 for (y = 1; y < ysize; y++)
1545 if (is_extra_bold(y1+y, x1+x))
1547 /* clear the untouched region */
1548 place_floor_bold(y1 + y, x1 + x);
1549 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
1553 /* make it a room- but don't touch */
1554 cave[y1 + y][x1 + x].info |= (CAVE_ROOM | CAVE_ICKY);
1563 * maze vault -- rectangular labyrinthine rooms
1565 * maze vault uses two routines:
1566 * r_visit - a recursive routine that builds the labyrinth
1567 * build_maze_vault - a driver routine that calls r_visit and adds
1568 * monsters, traps and treasure
1570 * The labyrinth is built by creating a spanning tree of a graph.
1571 * The graph vertices are at
1572 * (x, y) = (2j + x1, 2k + y1) j = 0,...,m-1 k = 0,...,n-1
1573 * and the edges are the vertical and horizontal nearest neighbors.
1575 * The spanning tree is created by performing a suitably randomized
1576 * depth-first traversal of the graph. The only adjustable parameter
1577 * is the randint0(3) below; it governs the relative density of
1578 * twists and turns in the labyrinth: smaller number, more twists.
1580 void r_visit(int y1, int x1, int y2, int x2, int node, int dir, int *visited)
1582 int i, j, m, n, temp, x, y, adj[4];
1584 /* dimensions of vertex array */
1585 m = (x2 - x1) / 2 + 1;
1586 n = (y2 - y1) / 2 + 1;
1588 /* mark node visited and set it to a floor */
1590 x = 2 * (node % m) + x1;
1591 y = 2 * (node / m) + y1;
1592 place_floor_bold(y, x);
1594 /* setup order of adjacent node visits */
1597 /* pick a random ordering */
1598 for (i = 0; i < 4; i++)
1600 for (i = 0; i < 4; i++)
1611 /* pick a random ordering with dir first */
1613 for (i = 1; i < 4; i++)
1615 for (i = 1; i < 4; i++)
1617 j = 1 + randint0(3);
1624 for (i = 0; i < 4; i++)
1629 /* (0,+) - check for bottom boundary */
1630 if ((node / m < n - 1) && (visited[node + m] == 0))
1632 place_floor_bold(y + 1, x);
1633 r_visit(y1, x1, y2, x2, node + m, dir, visited);
1637 /* (0,-) - check for top boundary */
1638 if ((node / m > 0) && (visited[node - m] == 0))
1640 place_floor_bold(y - 1, x);
1641 r_visit(y1, x1, y2, x2, node - m, dir, visited);
1645 /* (+,0) - check for right boundary */
1646 if ((node % m < m - 1) && (visited[node + 1] == 0))
1648 place_floor_bold(y, x + 1);
1649 r_visit(y1, x1, y2, x2, node + 1, dir, visited);
1653 /* (-,0) - check for left boundary */
1654 if ((node % m > 0) && (visited[node - 1] == 0))
1656 place_floor_bold(y, x - 1);
1657 r_visit(y1, x1, y2, x2, node - 1, dir, visited);
1664 void build_maze_vault(POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault)
1666 POSITION y, x, dy, dx;
1667 POSITION y1, x1, y2, x2;
1668 int m, n, num_vertices, *visited;
1672 msg_print_wizard(CHEAT_DUNGEON, _("迷路ランダムVaultを生成しました。", "Maze Vault."));
1674 /* Choose lite or dark */
1675 light = ((dun_level <= randint1(25)) && is_vault && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
1677 /* Pick a random room size - randomized by calling routine */
1686 /* generate the room */
1687 for (y = y1 - 1; y <= y2 + 1; y++)
1689 for (x = x1 - 1; x <= x2 + 1; x++)
1691 c_ptr = &cave[y][x];
1692 c_ptr->info |= CAVE_ROOM;
1693 if (is_vault) c_ptr->info |= CAVE_ICKY;
1694 if ((x == x1 - 1) || (x == x2 + 1) || (y == y1 - 1) || (y == y2 + 1))
1696 place_outer_grid(c_ptr);
1700 place_extra_grid(c_ptr);
1704 place_inner_grid(c_ptr);
1706 if (light) c_ptr->info |= (CAVE_GLOW);
1710 /* dimensions of vertex array */
1713 num_vertices = m * n;
1715 /* initialize array of visited vertices */
1716 C_MAKE(visited, num_vertices, int);
1718 /* traverse the graph to create a spaning tree, pick a random root */
1719 r_visit(y1, x1, y2, x2, randint0(num_vertices), 0, visited);
1721 /* Fill with monsters and treasure, low difficulty */
1722 if (is_vault) fill_treasure(x1, x2, y1, y2, randint1(5));
1724 C_KILL(visited, num_vertices, int);
1728 /* Build a town/ castle by using a recursive algorithm.
1729 * Basically divide each region in a probalistic way to create
1730 * smaller regions. When the regions get too small stop.
1732 * The power variable is a measure of how well defended a region is.
1733 * This alters the possible choices.
1735 void build_recursive_room(int x1, int y1, int x2, int y2, int power)
1741 /* Temp variables */
1747 if ((power < 3) && (xsize > 12) && (ysize > 12))
1749 /* Need outside wall +keep */
1756 /* Make rooms + subdivide */
1757 if ((randint1(10) > 2) && (xsize < 8) && (ysize < 8))
1763 choice = randint1(2) + 1;
1768 /* Mostly subdivide */
1769 choice = randint1(3) + 1;
1773 /* Based on the choice made above, do something */
1781 /* top and bottom */
1782 for (x = x1; x <= x2; x++)
1784 place_outer_bold(y1, x);
1785 place_outer_bold(y2, x);
1788 /* left and right */
1789 for (y = y1 + 1; y < y2; y++)
1791 place_outer_bold(y, x1);
1792 place_outer_bold(y, x2);
1795 /* Make a couple of entrances */
1798 /* left and right */
1799 y = randint1(ysize) + y1;
1800 place_floor_bold(y, x1);
1801 place_floor_bold(y, x2);
1805 /* top and bottom */
1806 x = randint1(xsize) + x1;
1807 place_floor_bold(y1, x);
1808 place_floor_bold(y2, x);
1811 /* Select size of keep */
1812 t1 = randint1(ysize / 3) + y1;
1813 t2 = y2 - randint1(ysize / 3);
1814 t3 = randint1(xsize / 3) + x1;
1815 t4 = x2 - randint1(xsize / 3);
1817 /* Do outside areas */
1819 /* Above and below keep */
1820 build_recursive_room(x1 + 1, y1 + 1, x2 - 1, t1, power + 1);
1821 build_recursive_room(x1 + 1, t2, x2 - 1, y2, power + 1);
1823 /* Left and right of keep */
1824 build_recursive_room(x1 + 1, t1 + 1, t3, t2 - 1, power + 3);
1825 build_recursive_room(t4, t1 + 1, x2 - 1, t2 - 1, power + 3);
1827 /* Make the keep itself: */
1840 /* Try to build a room */
1841 if ((xsize < 3) || (ysize < 3))
1843 for (y = y1; y < y2; y++)
1845 for (x = x1; x < x2; x++)
1847 place_inner_bold(y, x);
1855 /* Make outside walls */
1856 /* top and bottom */
1857 for (x = x1 + 1; x <= x2 - 1; x++)
1859 place_inner_bold(y1 + 1, x);
1860 place_inner_bold(y2 - 1, x);
1863 /* left and right */
1864 for (y = y1 + 1; y <= y2 - 1; y++)
1866 place_inner_bold(y, x1 + 1);
1867 place_inner_bold(y, x2 - 1);
1871 y = randint1(ysize - 3) + y1 + 1;
1876 place_floor_bold(y, x1 + 1);
1881 place_floor_bold(y, x2 - 1);
1884 /* Build the room */
1885 build_recursive_room(x1 + 2, y1 + 2, x2 - 2, y2 - 2, power + 3);
1890 /* Try and divide vertically */
1894 for (y = y1; y < y2; y++)
1896 for (x = x1; x < x2; x++)
1898 place_inner_bold(y, x);
1904 t1 = randint1(xsize - 2) + x1 + 1;
1905 build_recursive_room(x1, y1, t1, y2, power - 2);
1906 build_recursive_room(t1 + 1, y1, x2, y2, power - 2);
1911 /* Try and divide horizontally */
1915 for (y = y1; y < y2; y++)
1917 for (x = x1; x < x2; x++)
1919 place_inner_bold(y, x);
1925 t1 = randint1(ysize - 2) + y1 + 1;
1926 build_recursive_room(x1, y1, x2, t1, power - 2);
1927 build_recursive_room(x1, t1 + 1, x2, y2, power - 2);
1935 * Add outer wall to a floored region
1936 * Note: no range checking is done so must be inside dungeon
1937 * This routine also stomps on doors
1939 void add_outer_wall(int x, int y, int light, int x1, int y1, int x2, int y2)
1942 feature_type *f_ptr;
1945 if (!in_bounds(y, x)) return;
1947 c_ptr = &cave[y][x];
1949 /* hack- check to see if square has been visited before
1950 * if so, then exit (use room flag to do this) */
1951 if (c_ptr->info & CAVE_ROOM) return;
1954 c_ptr->info |= CAVE_ROOM;
1956 f_ptr = &f_info[c_ptr->feat];
1958 if (is_floor_bold(y, x))
1960 for (i = -1; i <= 1; i++)
1962 for (j = -1; j <= 1; j++)
1964 if ((x + i >= x1) && (x + i <= x2) &&
1965 (y + j >= y1) && (y + j <= y2))
1967 add_outer_wall(x + i, y + j, light, x1, y1, x2, y2);
1968 if (light) c_ptr->info |= CAVE_GLOW;
1973 else if (is_extra_bold(y, x))
1975 /* Set bounding walls */
1976 place_outer_bold(y, x);
1977 if (light) c_ptr->info |= CAVE_GLOW;
1979 else if (permanent_wall(f_ptr))
1981 /* Set bounding walls */
1982 if (light) c_ptr->info |= CAVE_GLOW;
1988 * Hacked distance formula - gives the 'wrong' answer.
1989 * Used to build crypts
1991 int dist2(int x1, int y1, int x2, int y2, int h1, int h2, int h3, int h4)
1997 /* Basically this works by taking the normal pythagorean formula
1998 * and using an expansion to express this in a way without the
1999 * square root. This approximate formula is then perturbed to give
2000 * the distorted results. (I found this by making a mistake when I was
2001 * trying to fix the circular rooms.)
2004 /* h1-h4 are constants that describe the metric */
2005 if (dx >= 2 * dy) return (dx + (dy * h1) / h2);
2006 if (dy >= 2 * dx) return (dy + (dx * h1) / h2);
2007 return (((dx + dy) * 128) / 181 +
2008 (dx * dx / (dy * h3) + dy * dy / (dx * h3)) * h4);
2009 /* 128/181 is approx. 1/sqrt(2) */
2015 /* Create a new floor room with optional light */
2016 void generate_room_floor(int y1, int x1, int y2, int x2, int light)
2022 for (y = y1; y <= y2; y++)
2024 for (x = x1; x <= x2; x++)
2027 c_ptr = &cave[y][x];
2028 place_floor_grid(c_ptr);
2029 c_ptr->info |= (CAVE_ROOM);
2030 if (light) c_ptr->info |= (CAVE_GLOW);
2035 void generate_fill_perm_bold(int y1, int x1, int y2, int x2)
2039 for (y = y1; y <= y2; y++)
2041 for (x = x1; x <= x2; x++)
2044 place_inner_perm_bold(y, x);
2051 * @brief 与えられた部屋型IDに応じて部屋の生成処理分岐を行い結果を返す / Attempt to build a room of the given type at the given block
2053 * @note that we restrict the number of "crowded" rooms to reduce the chance of overflowing the monster list during level creation.
2054 * @return 部屋の精製に成功した場合 TRUE を返す。
2056 static bool room_build(int typ)
2061 /* Build an appropriate room */
2062 case ROOM_T_NORMAL: return build_type1();
2063 case ROOM_T_OVERLAP: return build_type2();
2064 case ROOM_T_CROSS: return build_type3();
2065 case ROOM_T_INNER_FEAT: return build_type4();
2066 case ROOM_T_NEST: return build_type5();
2067 case ROOM_T_PIT: return build_type6();
2068 case ROOM_T_LESSER_VAULT: return build_type7();
2069 case ROOM_T_GREATER_VAULT: return build_type8();
2070 case ROOM_T_FRACAVE: return build_type9();
2071 case ROOM_T_RANDOM_VAULT: return build_type10();
2072 case ROOM_T_OVAL: return build_type11();
2073 case ROOM_T_CRYPT: return build_type12();
2074 case ROOM_T_TRAP_PIT: return build_type13();
2075 case ROOM_T_TRAP: return build_type14();
2076 case ROOM_T_GLASS: return build_type15();
2077 case ROOM_T_ARCADE: return build_type16();
2078 case ROOM_T_FIXED: return build_type17();
2086 * @brief 指定した部屋の生成確率を別の部屋に加算し、指定した部屋の生成率を0にする
2087 * @param dst 確率を移す先の部屋種ID
2088 * @param src 確率を与える元の部屋種ID
2090 #define MOVE_PLIST(dst, src) (prob_list[dst] += prob_list[src], prob_list[src] = 0)
2093 * @brief 部屋生成処理のメインルーチン(Sangbandを経由してOangbandからの実装を引用) / Generate rooms in dungeon. Build bigger rooms at first. [from SAngband (originally from OAngband)]
2094 * @return 部屋生成に成功した場合 TRUE を返す。
2096 bool generate_rooms(void)
2102 int prob_list[ROOM_T_MAX];
2103 int rooms_built = 0;
2104 int area_size = 100 * (cur_hgt*cur_wid) / (MAX_HGT*MAX_WID);
2105 int level_index = MIN(10, div_round(dun_level, 10));
2107 /* Number of each type of room on this level */
2108 s16b room_num[ROOM_T_MAX];
2110 /* Limit number of rooms */
2111 int dun_rooms = DUN_ROOMS_MAX * area_size / 100;
2113 /* Assume normal cave */
2114 room_info_type *room_info_ptr = room_info_normal;
2117 * Initialize probability list.
2119 for (i = 0; i < ROOM_T_MAX; i++)
2121 /* No rooms allowed above their minimum depth. */
2122 if (dun_level < room_info_ptr[i].min_level)
2128 prob_list[i] = room_info_ptr[i].prob[level_index];
2133 * XXX -- Various dungeon types and options.
2136 /*! @details ダンジョンにBEGINNER、CHAMELEON、SMALLESTいずれのフラグもなく、かつ「常に通常でない部屋を生成する」フラグがONならば、GRATER_VAULTのみを生成対象とする。 / Ironman sees only Greater Vaults */
2137 if (ironman_rooms && !((d_info[dungeon_type].flags1 & (DF1_BEGINNER | DF1_CHAMELEON | DF1_SMALLEST))))
2139 for (i = 0; i < ROOM_T_MAX; i++)
2141 if (i == ROOM_T_GREATER_VAULT) prob_list[i] = 1;
2142 else prob_list[i] = 0;
2146 /*! @details ダンジョンにNO_VAULTフラグがあるならば、LESSER_VAULT / GREATER_VAULT/ RANDOM_VAULTを除外 / Forbidden vaults */
2147 else if (d_info[dungeon_type].flags1 & DF1_NO_VAULT)
2149 prob_list[ROOM_T_LESSER_VAULT] = 0;
2150 prob_list[ROOM_T_GREATER_VAULT] = 0;
2151 prob_list[ROOM_T_RANDOM_VAULT] = 0;
2154 /*! @details ダンジョンにNO_CAVEフラグがある場合、FRACAVEの生成枠がNORMALに与えられる。CRIPT、OVALの生成枠がINNER_Fに与えられる。/ NO_CAVE dungeon (Castle)*/
2155 if (d_info[dungeon_type].flags1 & DF1_NO_CAVE)
2157 MOVE_PLIST(ROOM_T_NORMAL, ROOM_T_FRACAVE);
2158 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_CRYPT);
2159 MOVE_PLIST(ROOM_T_INNER_FEAT, ROOM_T_OVAL);
2162 /*! @details ダンジョンにCAVEフラグがある場合、NORMALの生成枠がFRACAVEに与えられる。/ CAVE dungeon (Orc cave etc.) */
2163 else if (d_info[dungeon_type].flags1 & DF1_CAVE)
2165 MOVE_PLIST(ROOM_T_FRACAVE, ROOM_T_NORMAL);
2168 /*! @details ダンジョンの基本地形が最初から渓谷かアリーナ型の場合 FRACAVE は生成から除外。 / No caves when a (random) cavern exists: they look bad */
2169 else if (dun->cavern || dun->empty_level)
2171 prob_list[ROOM_T_FRACAVE] = 0;
2174 /*! @details ダンジョンに最初からGLASS_ROOMフラグがある場合、GLASS を生成から除外。/ Forbidden glass rooms */
2175 if (!(d_info[dungeon_type].flags1 & DF1_GLASS_ROOM))
2177 prob_list[ROOM_T_GLASS] = 0;
2180 /*! @details ARCADEは同フラグがダンジョンにないと生成されない。 / Forbidden glass rooms */
2181 if (!(d_info[dungeon_type].flags1 & DF1_ARCADE))
2183 prob_list[ROOM_T_ARCADE] = 0;
2187 * Initialize number of rooms,
2188 * And calcurate total probability.
2190 for (total_prob = 0, i = 0; i < ROOM_T_MAX; i++)
2193 total_prob += prob_list[i];
2197 * Prepare the number of rooms, of all types, we should build
2200 for (i = dun_rooms; i > 0; i--)
2203 int rand = randint0(total_prob);
2205 /* Get room_type randomly */
2206 for (room_type = 0; room_type < ROOM_T_MAX; room_type++)
2208 if (rand < prob_list[room_type]) break;
2209 else rand -= prob_list[room_type];
2213 if (room_type >= ROOM_T_MAX) room_type = ROOM_T_NORMAL;
2215 /* Increase the number of rooms of that type we should build. */
2216 room_num[room_type]++;
2222 case ROOM_T_LESSER_VAULT:
2223 case ROOM_T_TRAP_PIT:
2231 case ROOM_T_GREATER_VAULT:
2232 case ROOM_T_RANDOM_VAULT:
2241 * Build each type of room one by one until we cannot build any more.
2242 * [from SAngband (originally from OAngband)]
2246 /* Assume no remaining rooms */
2249 for (i = 0; i < ROOM_T_MAX; i++)
2251 /* What type of room are we building now? */
2252 int room_type = room_build_order[i];
2254 /* Go next if none available */
2255 if (!room_num[room_type]) continue;
2257 /* Use up one unit */
2258 room_num[room_type]--;
2260 /* Build the room. */
2261 if (room_build(room_type))
2263 /* Increase the room built count. */
2266 /* Mark as there was some remaining rooms */
2273 case ROOM_T_TRAP_PIT:
2275 /* Avoid too many monsters */
2278 room_num[ROOM_T_PIT] = 0;
2279 room_num[ROOM_T_NEST] = 0;
2280 room_num[ROOM_T_TRAP_PIT] = 0;
2286 /* Avoid double-town */
2287 room_num[ROOM_T_ARCADE] = 0;
2293 /* End loop if no room remain */
2297 /*! @details 部屋生成数が2未満の場合生成失敗を返す */
2298 if (rooms_built < 2)
2300 msg_format_wizard(CHEAT_DUNGEON, _("部屋数が2未満でした。生成を再試行します。", "Number of rooms was under 2. Retry."), rooms_built);
2304 msg_format_wizard(CHEAT_DUNGEON, _("このダンジョンの部屋数は %d です。", "Number of Rooms: %d"), rooms_built);