#include "grid.h"
#include "rooms.h"
+#include "rooms-city.h"
+#include "rooms-fractal.h"
#include "rooms-normal.h"
#include "rooms-pitnest.h"
+#include "rooms-special.h"
+#include "rooms-trap.h"
#include "rooms-vault.h"
+#include "trap.h"
+
+#include "monster.h"
+
/*!
* 各部屋タイプの生成比定義
* appear above their minimum depth. Tiny levels will not have space\n
* for all the rooms you ask for.\n
*/
+
+#if 1
+
static room_info_type room_info_normal[ROOM_T_MAX] =
{
/* Depth */
/* 0 10 20 30 40 50 60 70 80 90 100 min limit */
-
{{999,900,800,700,600,500,400,300,200,100, 0}, 0}, /*NORMAL */
{{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 1}, /*OVERLAP */
{{ 1, 10, 20, 30, 40, 50, 60, 70, 80, 90,100}, 3}, /*CROSS */
{{ 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 8}, 20}, /*TRAP */
{{ 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 2}, 40}, /*GLASS */
{{ 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3}, 1}, /*ARCADE */
+ {{ 1, 8, 16, 24, 32, 40, 48, 56, 64, 72, 80}, 1}, /*FIX */
+};
+
+#endif
+
+#if 0
+static room_info_type room_info_normal[ROOM_T_MAX] =
+{
+/*デバッグ用配列*/
+{ {999, 900, 800, 700, 600, 500, 400, 300, 200, 100, 0}, 0}, /*NORMAL */
+{ { 1, 10, 20, 30, 40, 50, 60, 70, 80, 90, 0}, 1 }, /*OVERLAP */
+{ { 1, 10, 20, 30, 40, 50, 60, 70, 80, 90, 0}, 3 }, /*CROSS */
+{ { 1, 10, 20, 30, 40, 50, 60, 70, 80, 90, 0}, 3 }, /*INNER_F */
+{ { 0, 1, 1, 1, 2, 3, 5, 6, 8, 10, 0}, 10 }, /*NEST */
+{ { 0, 1, 1, 2, 3, 4, 6, 8, 10, 13, 0}, 10 }, /*PIT */
+{ { 0, 1, 1, 1, 2, 2, 3, 5, 6, 8, 0}, 10 }, /*LESSER_V */
+{ { 0, 0, 1, 1, 1, 2, 2, 2, 3, 3, 0}, 20 }, /*GREATER_V*/
+{ { 0,100,200,300,400,500,600,700,800,900, 0}, 10 }, /*FRACAVE */
+{ { 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 0}, 10 }, /*RANDOM_V */
+{ { 0, 4, 8, 12, 16, 20, 24, 28, 32, 36, 0}, 3 }, /*OVAL */
+{ { 1, 6, 12, 18, 24, 30, 36, 42, 48, 54, 0}, 10 }, /*CRYPT */
+{ { 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 0}, 20 }, /*TRAP_PIT */
+{ { 0, 0, 1, 1, 1, 2, 3, 4, 5, 6, 0}, 20 }, /*TRAP */
+{ { 0, 0, 0, 0, 1, 1, 1, 2, 2, 2, 0}, 40 }, /*GLASS */
+{ { 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 0}, 1 }, /*ARCADE */
+{ { 20, 40, 60, 80,100,100,100,100,100,100,100}, 1 }, /*FIX */
};
+#endif
+
+
/*! 部屋の生成処理順 / Build rooms in descending order of difficulty. */
static byte room_build_order[ROOM_T_MAX] = {
ROOM_T_TRAP,
ROOM_T_GLASS,
ROOM_T_INNER_FEAT,
+ ROOM_T_FIXED,
ROOM_T_OVAL,
ROOM_T_CRYPT,
ROOM_T_OVERLAP,
};
/*!
- * @brief 鍵のかかったドアを配置する
- * @param y 配置したいフロアのY座標
- * @param x 配置したいフロアのX座標
- * @return なし
- */
-void place_locked_door(int y, int x)
-{
- if (d_info[dungeon_type].flags1 & DF1_NO_DOORS)
- {
- place_floor_bold(y, x);
- }
- else
- {
- set_cave_feat(y, x, feat_locked_door_random((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR));
- cave[y][x].info &= ~(CAVE_FLOOR);
- delete_monster(y, x);
- }
-}
-
-/*!
- * @brief 隠しドアを配置する
- * @param y 配置したいフロアのY座標
- * @param x 配置したいフロアのX座標
- * @param type DOOR_DEFAULT / DOOR_DOOR / DOOR_GLASS_DOOR / DOOR_CURTAIN のいずれか
- * @return なし
- */
-void place_secret_door(int y, int x, int type)
-{
- if (d_info[dungeon_type].flags1 & DF1_NO_DOORS)
- {
- place_floor_bold(y, x);
- }
- else
- {
- cave_type *c_ptr = &cave[y][x];
-
- if (type == DOOR_DEFAULT)
- {
- type = ((d_info[dungeon_type].flags1 & DF1_CURTAIN) &&
- one_in_((d_info[dungeon_type].flags1 & DF1_NO_CAVE) ? 16 : 256)) ? DOOR_CURTAIN :
- ((d_info[dungeon_type].flags1 & DF1_GLASS_DOOR) ? DOOR_GLASS_DOOR : DOOR_DOOR);
- }
-
- /* Create secret door */
- place_closed_door(y, x, type);
-
- if (type != DOOR_CURTAIN)
- {
- /* Hide by inner wall because this is used in rooms only */
- c_ptr->mimic = feat_wall_inner;
-
- /* Floor type terrain cannot hide a door */
- if (feat_supports_los(c_ptr->mimic) && !feat_supports_los(c_ptr->feat))
- {
- if (have_flag(f_info[c_ptr->mimic].flags, FF_MOVE) || have_flag(f_info[c_ptr->mimic].flags, FF_CAN_FLY))
- {
- c_ptr->feat = one_in_(2) ? c_ptr->mimic : floor_type[randint0(100)];
- }
- c_ptr->mimic = 0;
- }
- }
-
- c_ptr->info &= ~(CAVE_FLOOR);
- delete_monster(y, x);
- }
-}
-
-/*!
* @brief 1マスだけの部屋を作成し、上下左右いずれか一つに隠しドアを配置する。
* @param y0 配置したい中心のY座標
* @param x0 配置したい中心のX座標
* Note - this should be used only on allocated regions
* within another room.
*/
-static void build_small_room(int x0, int y0)
+void build_small_room(POSITION x0, POSITION y0)
{
- int x, y;
+ POSITION x, y;
for (y = y0 - 1; y <= y0 + 1; y++)
{
* @param y2 範囲の下端
* @return なし
*/
-static void check_room_boundary(int x1, int y1, int x2, int y2)
+static void check_room_boundary(POSITION x1, POSITION y1, POSITION x2, POSITION y2)
{
- int count, x, y;
+ int count;
+ POSITION x, y;
bool old_is_floor, new_is_floor;
-
-
- /* Initialize */
count = 0;
old_is_floor = get_is_floor(x1 - 1, y1);
* @param block_x 範囲の左端
* @return なし
*/
-static bool find_space_aux(int blocks_high, int blocks_wide, int block_y, int block_x)
+static bool find_space_aux(POSITION blocks_high, POSITION blocks_wide, POSITION block_y, POSITION block_x)
{
- int by1, bx1, by2, bx2, by, bx;
+ POSITION by1, bx1, by2, bx2, by, bx;
/* Itty-bitty rooms must shift about within their rectangle */
if (blocks_wide < 3)
}
/* Extract blocks */
- by1 = block_y + 0;
- bx1 = block_x + 0;
+ by1 = block_y;
+ bx1 = block_x;
by2 = block_y + blocks_high;
bx2 = block_x + blocks_wide;
bool find_space(POSITION *y, POSITION *x, POSITION height, POSITION width)
{
int candidates, pick;
- int by, bx, by1, bx1, by2, bx2;
- int block_y = 0, block_x = 0;
-
+ POSITION by, bx, by1, bx1, by2, bx2;
+ POSITION block_y = 0, block_x = 0;
/* Find out how many blocks we need. */
- int blocks_high = 1 + ((height - 1) / BLOCK_HGT);
- int blocks_wide = 1 + ((width - 1) / BLOCK_WID);
+ POSITION blocks_high = 1 + ((height - 1) / BLOCK_HGT);
+ POSITION blocks_wide = 1 + ((width - 1) / BLOCK_WID);
/* There are no way to allocate such huge space */
if (dun->row_rooms < blocks_high) return FALSE;
}
/* Extract blocks */
- by1 = block_y + 0;
- bx1 = block_x + 0;
+ by1 = block_y;
+ bx1 = block_x;
by2 = block_y + blocks_high;
bx2 = block_x + blocks_wide;
}
}
-
/*
* Hack- See if room will cut off a cavern.
*
*/
check_room_boundary(*x - width / 2 - 1, *y - height / 2 - 1, *x + (width - 1) / 2 + 1, *y + (height - 1) / 2 + 1);
-
/* Success. */
return TRUE;
}
-
-
-
-
-
/*
* Structure to hold all "fill" data
*/
struct fill_data_type
{
/* area size */
- int xmin;
- int ymin;
- int xmax;
- int ymax;
+ POSITION xmin;
+ POSITION ymin;
+ POSITION xmax;
+ POSITION ymax;
/* cutoffs */
int c1;
int c3;
/* features to fill with */
- int feat1;
- int feat2;
- int feat3;
+ FEAT_IDX feat1;
+ FEAT_IDX feat2;
+ FEAT_IDX feat3;
int info1;
int info2;
/* Store routine for the fractal cave generator */
/* this routine probably should be an inline function or a macro. */
-static void store_height(int x, int y, int val)
+static void store_height(POSITION x, POSITION y, FEAT_IDX val)
{
/* if on boundary set val > cutoff so walls are not as square */
if (((x == fill_data.xmin) || (y == fill_data.ymin) ||
- (x == fill_data.xmax) || (y == fill_data.ymax)) &&
- (val <= fill_data.c1)) val = fill_data.c1 + 1;
+ (x == fill_data.xmax) || (y == fill_data.ymax)) &&
+ (val <= fill_data.c1)) val = fill_data.c1 + 1;
/* store the value in height-map format */
- cave[y][x].feat = (s16b)val;
+ cave[y][x].feat = val;
return;
}
* small values are good for smooth walls.
* size=length of the side of the square cave system.
*/
-static void generate_hmap(int y0, int x0, int xsiz, int ysiz, int grd, int roug, int cutoff)
+void generate_hmap(POSITION y0, POSITION x0, POSITION xsiz, POSITION ysiz, int grd, int roug, int cutoff)
{
- int xhsize, yhsize, xsize, ysize, maxsize;
+ POSITION xhsize, yhsize, xsize, ysize, maxsize;
/*
* fixed point variables- these are stored as 256 x normal value
* this gives 8 binary places of fractional part + 8 places of normal part
*/
- u16b xstep, xhstep, ystep, yhstep;
- u16b xstep2, xhstep2, ystep2, yhstep2;
- u16b i, j, ii, jj, diagsize, xxsize, yysize;
+ POSITION xstep, xhstep, ystep, yhstep;
+ POSITION xstep2, xhstep2, ystep2, yhstep2;
+ POSITION i, j, ii, jj, diagsize, xxsize, yysize;
/* Cache for speed */
- u16b xm, xp, ym, yp;
+ POSITION xm, xp, ym, yp;
/* redefine size so can change the value if out of range */
xsize = xsiz;
}
-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)
+static bool hack_isnt_wall(POSITION y, POSITION x, int c1, int c2, int c3, FEAT_IDX feat1, FEAT_IDX feat2, FEAT_IDX feat3, BIT_FLAGS info1, BIT_FLAGS info2, BIT_FLAGS info3)
{
/*
* function used to convert from height-map back to the
/* 25% of the time use the other tile : it looks better this way */
if (randint1(100) < 75)
{
- cave[y][x].feat = (s16b)feat1;
+ cave[y][x].feat = feat1;
cave[y][x].info &= ~(CAVE_MASK);
cave[y][x].info |= info1;
return TRUE;
}
else
{
- cave[y][x].feat = (s16b)feat2;
+ cave[y][x].feat = feat2;
cave[y][x].info &= ~(CAVE_MASK);
cave[y][x].info |= info2;
return TRUE;
/* 25% of the time use the other tile : it looks better this way */
if (randint1(100) < 75)
{
- cave[y][x].feat = (s16b)feat2;
+ cave[y][x].feat = feat2;
cave[y][x].info &= ~(CAVE_MASK);
cave[y][x].info |= info2;
return TRUE;
}
else
{
- cave[y][x].feat = (s16b)feat1;
+ cave[y][x].feat = feat1;
cave[y][x].info &= ~(CAVE_MASK);
cave[y][x].info |= info1;
return TRUE;
}
else if (cave[y][x].feat <= c3)
{
- cave[y][x].feat = (s16b)feat3;
+ cave[y][x].feat = feat3;
cave[y][x].info &= ~(CAVE_MASK);
cave[y][x].info |= info3;
return TRUE;
static void cave_fill(POSITION y, POSITION x)
{
int i, j, d;
- int ty, tx;
+ POSITION ty, tx;
int flow_tail = 1;
int flow_head = 0;
temp_y[0] = y;
temp_x[0] = x;
-
/* Now process the queue */
while (flow_head != flow_tail)
{
}
-static bool generate_fracave(int y0, int x0, int xsize, int ysize, int cutoff, bool light, bool room)
+bool generate_fracave(POSITION y0, POSITION x0, POSITION xsize, POSITION ysize, int cutoff, bool light, bool room)
{
- int x, y, i, xhsize, yhsize;
+ POSITION x, y, xhsize, yhsize;
+ int i;
/* offsets to middle from corner */
xhsize = xsize / 2;
fill_data.c3 = 0;
/* features to fill with */
- fill_data.feat1 = floor_type[randint0(100)];
- fill_data.feat2 = floor_type[randint0(100)];
- fill_data.feat3 = floor_type[randint0(100)];
+ fill_data.feat1 = feat_ground_type[randint0(100)];
+ fill_data.feat2 = feat_ground_type[randint0(100)];
+ fill_data.feat3 = feat_ground_type[randint0(100)];
fill_data.info1 = CAVE_FLOOR;
fill_data.info2 = CAVE_FLOOR;
}
/*
- * XXX XXX XXX There is a slight problem when tunnels pierce the caves:
+ * There is a slight problem when tunnels pierce the caves:
* Extra doors appear inside the system. (Its not very noticeable though.)
* This can be removed by "filling" from the outside in. This allows a separation
* from _outer_ with _inner_. (Internal walls are _outer_ instead.)
}
-/*!
- * @brief タイプ9の部屋…フラクタルカーブによる洞窟生成 / Type 9 -- Driver routine to create fractal cave system
- * @return なし
- */
-static bool build_type9(void)
-{
- int grd, roug, cutoff;
- POSITION xsize, ysize, y0, x0;
-
- bool done, light, room;
-
- /* get size: note 'Evenness'*/
- xsize = randint1(22) * 2 + 6;
- ysize = randint1(15) * 2 + 6;
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&y0, &x0, ysize + 1, xsize + 1))
- {
- /* Limit to the minimum room size, and retry */
- xsize = 8;
- ysize = 8;
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&y0, &x0, ysize + 1, xsize + 1))
- {
- /*
- * Still no space?!
- * Try normal room
- */
- return build_type1();
- }
- }
-
- light = done = FALSE;
- room = TRUE;
-
- if ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
-
- while (!done)
- {
- /* Note: size must be even or there are rounding problems
- * This causes the tunnels not to connect properly to the room */
-
- /* testing values for these parameters feel free to adjust */
- grd = 1 << (randint0(4));
-
- /* want average of about 16 */
- roug = randint1(8) * randint1(4);
-
- /* about size/2 */
- cutoff = randint1(xsize / 4) + randint1(ysize / 4) +
- randint1(xsize / 4) + randint1(ysize / 4);
-
- /* make it */
- generate_hmap(y0, x0, xsize, ysize, grd, roug, cutoff);
-
- /* Convert to normal format + clean up */
- done = generate_fracave(y0, x0, xsize, ysize, cutoff, light, room);
- }
-
- return TRUE;
-}
-
#ifdef ALLOW_CAVERNS_AND_LAKES
/*
* Builds a cave system in the center of the dungeon.
*/
void build_cavern(void)
{
- int grd, roug, cutoff, xsize, ysize, x0, y0;
+ int grd, roug, cutoff;
+ POSITION xsize, ysize, x0, y0;
bool done, light;
light = done = FALSE;
}
}
-static bool generate_lake(int y0, int x0, int xsize, int ysize, int c1, int c2, int c3, int type)
+bool generate_lake(POSITION y0, POSITION x0, POSITION xsize, POSITION ysize, int c1, int c2, int c3, int type)
{
- int x, y, i, xhsize, yhsize;
- int feat1, feat2, feat3;
+ POSITION x, y, xhsize, yhsize;
+ int i;
+ FEAT_IDX feat1, feat2, feat3;
/* offsets to middle from corner */
xhsize = xsize / 2;
case LAKE_T_LAVA: /* Lava */
feat1 = feat_deep_lava;
feat2 = feat_shallow_lava;
- feat3 = floor_type[randint0(100)];
+ feat3 = feat_ground_type[randint0(100)];
break;
case LAKE_T_WATER: /* Water */
feat1 = feat_deep_water;
feat2 = feat_shallow_water;
- feat3 = floor_type[randint0(100)];
+ feat3 = feat_ground_type[randint0(100)];
break;
case LAKE_T_CAVE: /* Collapsed cave */
- feat1 = floor_type[randint0(100)];
- feat2 = floor_type[randint0(100)];
+ feat1 = feat_ground_type[randint0(100)];
+ feat2 = feat_ground_type[randint0(100)];
feat3 = feat_rubble;
break;
case LAKE_T_EARTH_VAULT: /* Earth vault */
feat1 = feat_rubble;
- feat2 = floor_type[randint0(100)];
+ feat2 = feat_ground_type[randint0(100)];
feat3 = feat_rubble;
break;
case LAKE_T_AIR_VAULT: /* Air vault */
#endif /* ALLOW_CAVERNS_AND_LAKES */
-/*
- * Routine used by the random vault creators to add a door to a location
- * Note that range checking has to be done in the calling routine.
- *
- * The doors must be INSIDE the allocated region.
- */
-static void add_door(int x, int y)
-{
- /* Need to have a wall in the center square */
- if (!is_outer_bold(y, x)) return;
-
- /* look at:
- * x#x
- * .#.
- * x#x
- *
- * where x=don't care
- * .=floor, #=wall
- */
-
- if (is_floor_bold(y-1,x) && is_floor_bold(y+1,x) &&
- (is_outer_bold(y, x - 1) && is_outer_bold(y, x + 1)))
- {
- /* secret door */
- place_secret_door(y, x, DOOR_DEFAULT);
-
- /* set boundarys so don't get wide doors */
- place_solid_bold(y, x - 1);
- place_solid_bold(y, x + 1);
- }
-
-
- /* look at:
- * x#x
- * .#.
- * x#x
- *
- * where x = don't care
- * .=floor, #=wall
- */
- if (is_outer_bold(y - 1, x) && is_outer_bold(y + 1, x) &&
- is_floor_bold(y,x-1) && is_floor_bold(y,x+1))
- {
- /* secret door */
- place_secret_door(y, x, DOOR_DEFAULT);
-
- /* set boundarys so don't get wide doors */
- place_solid_bold(y - 1, x);
- place_solid_bold(y + 1, x);
- }
-}
-
/*
* Routine that fills the empty areas of a room with treasure and monsters.
*/
-static void fill_treasure(int x1, int x2, int y1, int y2, int difficulty)
+void fill_treasure(POSITION x1, POSITION x2, POSITION y1, POSITION y2, int difficulty)
{
- int x, y, cx, cy, size;
+ POSITION x, y, cx, cy, size;
s32b value;
/* center of room:*/
}
-/*
- * This function creates a random vault that looks like a collection of bubbles.
- * It works by getting a set of coordinates that represent the center of each
- * bubble. The entire room is made by seeing which bubble center is closest. If
- * two centers are equidistant then the square is a wall, otherwise it is a floor.
- * The only exception is for squares really near a center, these are always floor.
- * (It looks better than without this check.)
- *
- * Note: If two centers are on the same point then this algorithm will create a
- * blank bubble filled with walls. - This is prevented from happening.
- */
-static void build_bubble_vault(int x0, int y0, int xsize, int ysize)
-{
- #define BUBBLENUM 10 /* number of bubbles */
-
- /* array of center points of bubbles */
- coord center[BUBBLENUM];
-
- int i, j, x, y;
- u16b min1, min2, temp;
- bool done;
-
- /* Offset from center to top left hand corner */
- int xhsize = xsize / 2;
- int yhsize = ysize / 2;
-
- msg_print_wizard(CHEAT_DUNGEON, _("泡型ランダムVaultを生成しました。", "Room Vault."));
-
- /* Allocate center of bubbles */
- center[0].x = (byte)randint1(xsize - 3) + 1;
- center[0].y = (byte)randint1(ysize - 3) + 1;
-
- for (i = 1; i < BUBBLENUM; i++)
- {
- done = FALSE;
-
- /* get center and check to see if it is unique */
- while (!done)
- {
- done = TRUE;
-
- x = randint1(xsize - 3) + 1;
- y = randint1(ysize - 3) + 1;
-
- for (j = 0; j < i; j++)
- {
- /* rough test to see if there is an overlap */
- if ((x == center[j].x) && (y == center[j].y)) done = FALSE;
- }
- }
-
- center[i].x = (byte_hack)x;
- center[i].y = (byte_hack)y;
- }
-
-
- /* Top and bottom boundaries */
- for (i = 0; i < xsize; i++)
- {
- int side_x = x0 - xhsize + i;
-
- place_outer_noperm_bold(y0 - yhsize + 0, side_x);
- cave[y0 - yhsize + 0][side_x].info |= (CAVE_ROOM | CAVE_ICKY);
- place_outer_noperm_bold(y0 - yhsize + ysize - 1, side_x);
- cave[y0 - yhsize + ysize - 1][side_x].info |= (CAVE_ROOM | CAVE_ICKY);
- }
-
- /* Left and right boundaries */
- for (i = 1; i < ysize - 1; i++)
- {
- int side_y = y0 - yhsize + i;
-
- place_outer_noperm_bold(side_y, x0 - xhsize + 0);
- cave[side_y][x0 - xhsize + 0].info |= (CAVE_ROOM | CAVE_ICKY);
- place_outer_noperm_bold(side_y, x0 - xhsize + xsize - 1);
- cave[side_y][x0 - xhsize + xsize - 1].info |= (CAVE_ROOM | CAVE_ICKY);
- }
-
- /* Fill in middle with bubbles */
- for (x = 1; x < xsize - 1; x++)
- {
- for (y = 1; y < ysize - 1; y++)
- {
- /* Get distances to two closest centers */
-
- /* initialize */
- min1 = (u16b)distance(x, y, center[0].x, center[0].y);
- min2 = (u16b)distance(x, y, center[1].x, center[1].y);
-
- if (min1 > min2)
- {
- /* swap if in wrong order */
- temp = min1;
- min1 = min2;
- min2 = temp;
- }
-
- /* Scan the rest */
- for (i = 2; i < BUBBLENUM; i++)
- {
- temp = (u16b)distance(x, y, center[i].x, center[i].y);
-
- if (temp < min1)
- {
- /* smallest */
- min2 = min1;
- min1 = temp;
- }
- else if (temp < min2)
- {
- /* second smallest */
- min2 = temp;
- }
- }
- if (((min2 - min1) <= 2) && (!(min1 < 3)))
- {
- /* Boundary at midpoint+ not at inner region of bubble */
- place_outer_noperm_bold(y0 - yhsize + y, x0 - xhsize + x);
- }
- else
- {
- /* middle of a bubble */
- place_floor_bold(y0 - yhsize + y, x0 - xhsize + x);
- }
-
- /* clean up rest of flags */
- cave[y0 - yhsize + y][x0 - xhsize + x].info |= (CAVE_ROOM | CAVE_ICKY);
- }
- }
-
- /* Try to add some random doors */
- for (i = 0; i < 500; i++)
- {
- x = randint1(xsize - 3) - xhsize + x0 + 1;
- y = randint1(ysize - 3) - yhsize + y0 + 1;
- add_door(x, y);
- }
-
- /* Fill with monsters and treasure, low difficulty */
- fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 2, y0 - yhsize + 1, y0 - yhsize + ysize - 2, randint1(5));
-}
-
/*
* Overlay a rectangular room given its bounds
* The area inside the walls is not touched:
* only granite is removed- normal walls stay
*/
-static void build_room(int x1, int x2, int y1, int y2)
+void build_room(POSITION x1, POSITION x2, POSITION y1, POSITION y2)
{
- int x, y, i, xsize, ysize, temp;
+ POSITION x, y, xsize, ysize;
+ int i, temp;
/* Check if rectangle has no width */
if ((x1 == x2) || (y1 == y2)) return;
- /* initialize */
if (x1 > x2)
{
/* Swap boundaries if in wrong order */
}
-/* Create a random vault that looks like a collection of overlapping rooms */
-
-static void build_room_vault(int x0, int y0, int xsize, int ysize)
-{
- int i, x1, x2, y1, y2, xhsize, yhsize;
-
- /* get offset from center */
- xhsize = xsize / 2;
- yhsize = ysize / 2;
-
- msg_print_wizard(CHEAT_DUNGEON, _("部屋型ランダムVaultを生成しました。", "Room Vault."));
-
- /* fill area so don't get problems with arena levels */
- for (x1 = 0; x1 < xsize; x1++)
- {
- int x = x0 - xhsize + x1;
-
- for (y1 = 0; y1 < ysize; y1++)
- {
- int y = y0 - yhsize + y1;
-
- place_extra_bold(y, x);
- cave[y][x].info &= (~CAVE_ICKY);
- }
- }
-
- /* add ten random rooms */
- for (i = 0; i < 10; i++)
- {
- x1 = randint1(xhsize) * 2 + x0 - xhsize;
- x2 = randint1(xhsize) * 2 + x0 - xhsize;
- y1 = randint1(yhsize) * 2 + y0 - yhsize;
- y2 = randint1(yhsize) * 2 + y0 - yhsize;
- build_room(x1, x2, y1, y2);
- }
-
- /* Add some random doors */
- for (i = 0; i < 500; i++)
- {
- x1 = randint1(xsize - 3) - xhsize + x0 + 1;
- y1 = randint1(ysize - 3) - yhsize + y0 + 1;
- add_door(x1, y1);
- }
-
- /* Fill with monsters and treasure, high difficulty */
- fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 2, y0 - yhsize + 1, y0 - yhsize + ysize - 2, randint1(5) + 5);
-}
-
-
-/* Create a random vault out of a fractal cave */
-static void build_cave_vault(int x0, int y0, int xsiz, int ysiz)
-{
- int grd, roug, cutoff, xhsize, yhsize, xsize, ysize, x, y;
- bool done, light, room;
-
- /* round to make sizes even */
- xhsize = xsiz / 2;
- yhsize = ysiz / 2;
- xsize = xhsize * 2;
- ysize = yhsize * 2;
-
- msg_print_wizard(CHEAT_DUNGEON, _("洞穴ランダムVaultを生成しました。", "Cave Vault."));
-
- light = done = FALSE;
- room = TRUE;
-
- while (!done)
- {
- /* testing values for these parameters feel free to adjust */
- grd = 1 << randint0(4);
-
- /* want average of about 16 */
- roug = randint1(8) * randint1(4);
-
- /* about size/2 */
- cutoff = randint1(xsize / 4) + randint1(ysize / 4) +
- randint1(xsize / 4) + randint1(ysize / 4);
-
- /* make it */
- generate_hmap(y0, x0, xsize, ysize, grd, roug, cutoff);
-
- /* Convert to normal format+ clean up */
- done = generate_fracave(y0, x0, xsize, ysize, cutoff, light, room);
- }
-
- /* Set icky flag because is a vault */
- for (x = 0; x <= xsize; x++)
- {
- for (y = 0; y <= ysize; y++)
- {
- cave[y0 - yhsize + y][x0 - xhsize + x].info |= CAVE_ICKY;
- }
- }
-
- /* Fill with monsters and treasure, low difficulty */
- fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 1, y0 - yhsize + 1, y0 - yhsize + ysize - 1, randint1(5));
-}
/*
* maze vault -- rectangular labyrinthine rooms
* is the randint0(3) below; it governs the relative density of
* twists and turns in the labyrinth: smaller number, more twists.
*/
-static void r_visit(int y1, int x1, int y2, int x2,
- int node, int dir, int *visited)
+void r_visit(POSITION y1, POSITION x1, POSITION y2, POSITION x2, int node, DIRECTION dir, int *visited)
{
int i, j, m, n, temp, x, y, adj[4];
}
-void build_maze_vault(int x0, int y0, int xsize, int ysize, bool is_vault)
+void build_maze_vault(POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault)
{
- int y, x, dy, dx;
- int y1, x1, y2, x2;
+ POSITION y, x, dy, dx;
+ POSITION y1, x1, y2, x2;
int m, n, num_vertices, *visited;
bool light;
cave_type *c_ptr;
}
-/* Build a "mini" checkerboard vault
+/* Build a town/ castle by using a recursive algorithm.
+ * Basically divide each region in a probalistic way to create
+ * smaller regions. When the regions get too small stop.
*
- * This is done by making a permanent wall maze and setting
- * the diagonal sqaures of the checker board to be granite.
- * The vault has two entrances on opposite sides to guarantee
- * a way to get in even if the vault abuts a side of the dungeon.
+ * The power variable is a measure of how well defended a region is.
+ * This alters the possible choices.
*/
-static void build_mini_c_vault(int x0, int y0, int xsize, int ysize)
+void build_recursive_room(POSITION x1, POSITION y1, POSITION x2, POSITION y2, int power)
{
- int dy, dx;
- int y1, x1, y2, x2, y, x, total;
- int m, n, num_vertices;
- int *visited;
-
- msg_print_wizard(CHEAT_DUNGEON, _("小型チェッカーランダムVaultを生成しました。", "Mini Checker Board Vault."));
-
- /* Pick a random room size */
- dy = ysize / 2 - 1;
- dx = xsize / 2 - 1;
+ POSITION xsize, ysize;
+ POSITION x, y;
+ int choice;
- y1 = y0 - dy;
- x1 = x0 - dx;
- y2 = y0 + dy;
- x2 = x0 + dx;
+ /* Temp variables */
+ int t1, t2, t3, t4;
+ xsize = x2 - x1;
+ ysize = y2 - y1;
- /* generate the room */
- for (x = x1 - 2; x <= x2 + 2; x++)
+ if ((power < 3) && (xsize > 12) && (ysize > 12))
{
- if (!in_bounds(y1-2,x)) break;
-
- cave[y1-2][x].info |= (CAVE_ROOM | CAVE_ICKY);
-
- place_outer_noperm_bold(y1-2, x);
+ /* Need outside wall +keep */
+ choice = 1;
}
-
- for (x = x1 - 2; x <= x2 + 2; x++)
- {
- if (!in_bounds(y2+2,x)) break;
-
- cave[y2+2][x].info |= (CAVE_ROOM | CAVE_ICKY);
-
- place_outer_noperm_bold(y2+2, x);
- }
-
- for (y = y1 - 2; y <= y2 + 2; y++)
- {
- if (!in_bounds(y,x1-2)) break;
-
- cave[y][x1-2].info |= (CAVE_ROOM | CAVE_ICKY);
-
- place_outer_noperm_bold(y, x1-2);
- }
-
- for (y = y1 - 2; y <= y2 + 2; y++)
- {
- if (!in_bounds(y,x2+2)) break;
-
- cave[y][x2+2].info |= (CAVE_ROOM | CAVE_ICKY);
-
- place_outer_noperm_bold(y, x2+2);
- }
-
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- cave_type *c_ptr = &cave[y][x];
-
- c_ptr->info |= (CAVE_ROOM | CAVE_ICKY);
-
- /* Permanent walls */
- place_inner_perm_grid(c_ptr);
- }
- }
-
-
- /* dimensions of vertex array */
- m = dx + 1;
- n = dy + 1;
- num_vertices = m * n;
-
- /* initialize array of visited vertices */
- C_MAKE(visited, num_vertices, int);
-
- /* traverse the graph to create a spannng tree, pick a random root */
- r_visit(y1, x1, y2, x2, randint0(num_vertices), 0, visited);
-
- /* Make it look like a checker board vault */
- for (x = x1; x <= x2; x++)
- {
- for (y = y1; y <= y2; y++)
- {
- total = x - x1 + y - y1;
- /* If total is odd- and is a floor then make a wall */
- if ((total % 2 == 1) && is_floor_bold(y, x))
- {
- place_inner_bold(y, x);
- }
- }
- }
-
- /* Make a couple of entrances */
- if (one_in_(2))
- {
- /* left and right */
- y = randint1(dy) + dy / 2;
- place_inner_bold(y1 + y, x1 - 1);
- place_inner_bold(y1 + y, x2 + 1);
- }
- else
- {
- /* top and bottom */
- x = randint1(dx) + dx / 2;
- place_inner_bold(y1 - 1, x1 + x);
- place_inner_bold(y2 + 1, x1 + x);
- }
-
- /* Fill with monsters and treasure, highest difficulty */
- fill_treasure(x1, x2, y1, y2, 10);
-
- C_KILL(visited, num_vertices, int);
-}
-
-
-/* Build a town/ castle by using a recursive algorithm.
- * Basically divide each region in a probalistic way to create
- * smaller regions. When the regions get too small stop.
- *
- * The power variable is a measure of how well defended a region is.
- * This alters the possible choices.
- */
-static void build_recursive_room(int x1, int y1, int x2, int y2, int power)
-{
- int xsize, ysize;
- int x, y;
- int choice;
-
- /* Temp variables */
- int t1, t2, t3, t4;
-
- xsize = x2 - x1;
- ysize = y2 - y1;
-
- if ((power < 3) && (xsize > 12) && (ysize > 12))
- {
- /* Need outside wall +keep */
- choice = 1;
- }
- else
+ else
{
if (power < 10)
{
}
-/* Build a castle */
-
-/* Driver routine: clear the region and call the recursive
-* room routine.
-*
-*This makes a vault that looks like a castle/ city in the dungeon.
-*/
-static void build_castle_vault(int x0, int y0, int xsize, int ysize)
-{
- int dy, dx;
- int y1, x1, y2, x2;
- int y, x;
-
- /* Pick a random room size */
- dy = ysize / 2 - 1;
- dx = xsize / 2 - 1;
-
- y1 = y0 - dy;
- x1 = x0 - dx;
- y2 = y0 + dy;
- x2 = x0 + dx;
-
- msg_print_wizard(CHEAT_DUNGEON, _("城型ランダムVaultを生成しました。", "Castle Vault"));
-
- /* generate the room */
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- cave[y][x].info |= (CAVE_ROOM | CAVE_ICKY);
- /* Make everything a floor */
- place_floor_bold(y, x);
- }
- }
-
- /* Make the castle */
- build_recursive_room(x1, y1, x2, y2, randint1(5));
-
- /* Fill with monsters and treasure, low difficulty */
- fill_treasure(x1, x2, y1, y2, randint1(3));
-}
-
-
/*
* Add outer wall to a floored region
* Note: no range checking is done so must be inside dungeon
* This routine also stomps on doors
*/
-static void add_outer_wall(int x, int y, int light, int x1, int y1, int x2, int y2)
+void add_outer_wall(POSITION x, POSITION y, int light, POSITION x1, POSITION y1, POSITION x2, POSITION y2)
{
cave_type *c_ptr;
feature_type *f_ptr;
* Hacked distance formula - gives the 'wrong' answer.
* Used to build crypts
*/
-static int dist2(int x1, int y1, int x2, int y2,
- int h1, int h2, int h3, int h4)
+POSITION dist2(POSITION x1, POSITION y1, POSITION x2, POSITION y2, POSITION h1, POSITION h2, POSITION h3, POSITION h4)
{
- int dx, dy;
+ POSITION dx, dy;
dx = abs(x2 - x1);
dy = abs(y2 - y1);
}
-/*
- * Build target vault.
- * This is made by two concentric "crypts" with perpendicular
- * walls creating the cross-hairs.
- */
-static void build_target_vault(int x0, int y0, int xsize, int ysize)
-{
- int rad, x, y;
-
- /* Make a random metric */
- int h1, h2, h3, h4;
- h1 = randint1(32) - 16;
- h2 = randint1(16);
- h3 = randint1(32);
- h4 = randint1(32) - 16;
- msg_print_wizard(CHEAT_DUNGEON, _("対称形ランダムVaultを生成しました。", "Elemental Vault"));
- /* work out outer radius */
- if (xsize > ysize)
- {
- rad = ysize / 2;
- }
- else
- {
- rad = xsize / 2;
- }
+/* Create a new floor room with optional light */
+void generate_room_floor(POSITION y1, POSITION x1, POSITION y2, POSITION x2, int light)
+{
+ POSITION y, x;
+
+ cave_type *c_ptr;
- /* Make floor */
- for (x = x0 - rad; x <= x0 + rad; x++)
+ for (y = y1; y <= y2; y++)
{
- for (y = y0 - rad; y <= y0 + rad; y++)
+ for (x = x1; x <= x2; x++)
{
- /* clear room flag */
- cave[y][x].info &= ~(CAVE_ROOM);
-
- /* Vault - so is "icky" */
- cave[y][x].info |= CAVE_ICKY;
-
- if (dist2(y0, x0, y, x, h1, h2, h3, h4) <= rad - 1)
- {
- /* inside- so is floor */
- place_floor_bold(y, x);
- }
- else
- {
- /* make granite outside so arena works */
- place_extra_bold(y, x);
- }
-
- /* proper boundary for arena */
- if (((y + rad) == y0) || ((y - rad) == y0) ||
- ((x + rad) == x0) || ((x - rad) == x0))
- {
- place_extra_bold(y, x);
- }
+ /* Point to grid */
+ c_ptr = &cave[y][x];
+ place_floor_grid(c_ptr);
+ c_ptr->info |= (CAVE_ROOM);
+ if (light) c_ptr->info |= (CAVE_GLOW);
}
}
+}
- /* Find visible outer walls and set to be FEAT_OUTER */
- add_outer_wall(x0, y0, FALSE, x0 - rad - 1, y0 - rad - 1,
- x0 + rad + 1, y0 + rad + 1);
+void generate_fill_perm_bold(POSITION y1, POSITION x1, POSITION y2, POSITION x2)
+{
+ POSITION y, x;
- /* Add inner wall */
- for (x = x0 - rad / 2; x <= x0 + rad / 2; x++)
+ for (y = y1; y <= y2; y++)
{
- for (y = y0 - rad / 2; y <= y0 + rad / 2; y++)
+ for (x = x1; x <= x2; x++)
{
- if (dist2(y0, x0, y, x, h1, h2, h3, h4) == rad / 2)
- {
- /* Make an internal wall */
- place_inner_bold(y, x);
- }
+ /* Point to grid */
+ place_inner_perm_bold(y, x);
}
}
+}
- /* Add perpendicular walls */
- for (x = x0 - rad; x <= x0 + rad; x++)
- {
- place_inner_bold(y0, x);
- }
-
- for (y = y0 - rad; y <= y0 + rad; y++)
- {
- place_inner_bold(y, x0);
- }
- /* Make inner vault */
- for (y = y0 - 1; y <= y0 + 1; y++)
- {
- place_inner_bold(y, x0 - 1);
- place_inner_bold(y, x0 + 1);
- }
- for (x = x0 - 1; x <= x0 + 1; x++)
+/*!
+ * @brief 与えられた部屋型IDに応じて部屋の生成処理分岐を行い結果を返す / Attempt to build a room of the given type at the given block
+ * @param type 部屋型ID
+ * @note that we restrict the number of "crowded" rooms to reduce the chance of overflowing the monster list during level creation.
+ * @return 部屋の精製に成功した場合 TRUE を返す。
+ */
+static bool room_build(EFFECT_ID typ)
+{
+ /* Build a room */
+ switch (typ)
{
- place_inner_bold(y0 - 1, x);
- place_inner_bold(y0 + 1, x);
+ /* Build an appropriate room */
+ case ROOM_T_NORMAL: return build_type1();
+ case ROOM_T_OVERLAP: return build_type2();
+ case ROOM_T_CROSS: return build_type3();
+ case ROOM_T_INNER_FEAT: return build_type4();
+ case ROOM_T_NEST: return build_type5();
+ case ROOM_T_PIT: return build_type6();
+ case ROOM_T_LESSER_VAULT: return build_type7();
+ case ROOM_T_GREATER_VAULT: return build_type8();
+ case ROOM_T_FRACAVE: return build_type9();
+ case ROOM_T_RANDOM_VAULT: return build_type10();
+ case ROOM_T_OVAL: return build_type11();
+ case ROOM_T_CRYPT: return build_type12();
+ case ROOM_T_TRAP_PIT: return build_type13();
+ case ROOM_T_TRAP: return build_type14();
+ case ROOM_T_GLASS: return build_type15();
+ case ROOM_T_ARCADE: return build_type16();
+ case ROOM_T_FIXED: return build_type17();
}
- place_floor_bold(y0, x0);
-
-
- /* Add doors to vault */
- /* get two distances so can place doors relative to centre */
- x = (rad - 2) / 4 + 1;
- y = rad / 2 + x;
-
- add_door(x0 + x, y0);
- add_door(x0 + y, y0);
- add_door(x0 - x, y0);
- add_door(x0 - y, y0);
- add_door(x0, y0 + x);
- add_door(x0, y0 + y);
- add_door(x0, y0 - x);
- add_door(x0, y0 - y);
-
- /* Fill with stuff - medium difficulty */
- fill_treasure(x0 - rad, x0 + rad, y0 - rad, y0 + rad, randint1(3) + 3);
+ /* Paranoia */
+ return FALSE;
}
+/*!
+ * @brief 指定した部屋の生成確率を別の部屋に加算し、指定した部屋の生成率を0にする
+ * @param dst 確率を移す先の部屋種ID
+ * @param src 確率を与える元の部屋種ID
+ */
+#define MOVE_PLIST(dst, src) (prob_list[dst] += prob_list[src], prob_list[src] = 0)
-#ifdef ALLOW_CAVERNS_AND_LAKES
-/*
- * This routine uses a modified version of the lake code to make a
- * distribution of some terrain type over the vault. This type
- * depends on the dungeon depth.
- *
- * Miniture rooms are then scattered across the vault.
+/*!
+ * @brief 部屋生成処理のメインルーチン(Sangbandを経由してOangbandからの実装を引用) / Generate rooms in dungeon. Build bigger rooms at first. [from SAngband (originally from OAngband)]
+ * @return 部屋生成に成功した場合 TRUE を返す。
*/
-static void build_elemental_vault(int x0, int y0, int xsiz, int ysiz)
+bool generate_rooms(void)
{
- int grd, roug;
- int c1, c2, c3;
- bool done = FALSE;
- int xsize, ysize, xhsize, yhsize, x, y, i;
- int type;
+ int i;
+ bool remain;
+ int crowded = 0;
+ int total_prob;
+ int prob_list[ROOM_T_MAX];
+ int rooms_built = 0;
+ int area_size = 100 * (cur_hgt*cur_wid) / (MAX_HGT*MAX_WID);
+ int level_index = MIN(10, div_round(dun_level, 10));
+
+ /* Number of each type of room on this level */
+ s16b room_num[ROOM_T_MAX];
- msg_print_wizard(CHEAT_DUNGEON, _("精霊界ランダムVaultを生成しました。", "Elemental Vault"));
+ /* Limit number of rooms */
+ int dun_rooms = DUN_ROOMS_MAX * area_size / 100;
- /* round to make sizes even */
- xhsize = xsiz / 2;
- yhsize = ysiz / 2;
- xsize = xhsize * 2;
- ysize = yhsize * 2;
+ /* Assume normal cave */
+ room_info_type *room_info_ptr = room_info_normal;
- if (dun_level < 25)
- {
- /* Earth vault (Rubble) */
- type = LAKE_T_EARTH_VAULT;
- }
- else if (dun_level < 50)
+ /*
+ * Initialize probability list.
+ */
+ for (i = 0; i < ROOM_T_MAX; i++)
{
- /* Air vault (Trees) */
- type = LAKE_T_AIR_VAULT;
+ /* No rooms allowed above their minimum depth. */
+ if (dun_level < room_info_ptr[i].min_level)
+ {
+ prob_list[i] = 0;
+ }
+ else
+ {
+ prob_list[i] = room_info_ptr[i].prob[level_index];
+ }
}
- else if (dun_level < 75)
+
+ /*
+ * XXX -- Various dungeon types and options.
+ */
+
+ /*! @details ダンジョンにBEGINNER、CHAMELEON、SMALLESTいずれのフラグもなく、
+ * かつ「常に通常でない部屋を生成する」フラグがONならば、
+ * GRATER_VAULTのみを生成対象とする。 / Ironman sees only Greater Vaults */
+ if (ironman_rooms && !((d_info[dungeon_type].flags1 & (DF1_BEGINNER | DF1_CHAMELEON | DF1_SMALLEST))))
{
- /* Water vault (shallow water) */
- type = LAKE_T_WATER_VAULT;
+ for (i = 0; i < ROOM_T_MAX; i++)
+ {
+ if (i == ROOM_T_GREATER_VAULT) prob_list[i] = 1;
+ else prob_list[i] = 0;
+ }
}
- else
+
+ /*! @details ダンジョンにNO_VAULTフラグがあるならば、LESSER_VAULT / GREATER_VAULT/ RANDOM_VAULTを除外 / Forbidden vaults */
+ else if (d_info[dungeon_type].flags1 & DF1_NO_VAULT)
{
- /* Fire vault (shallow lava) */
- type = LAKE_T_FIRE_VAULT;
+ prob_list[ROOM_T_LESSER_VAULT] = 0;
+ prob_list[ROOM_T_GREATER_VAULT] = 0;
+ prob_list[ROOM_T_RANDOM_VAULT] = 0;
}
- while (!done)
+ /*! @details ダンジョンにBEGINNERフラグがあるならば、FIXED_ROOMを除外 / Forbidden vaults */
+ if (d_info[dungeon_type].flags1 & DF1_BEGINNER)
{
- /* testing values for these parameters: feel free to adjust */
- grd = 1 << (randint0(3));
-
- /* want average of about 16 */
- roug = randint1(8) * randint1(4);
-
- /* Make up size of various componants */
- /* Floor */
- c3 = 2 * xsize / 3;
-
- /* Deep water/lava */
- c1 = randint0(c3 / 2) + randint0(c3 / 2) - 5;
-
- /* Shallow boundary */
- c2 = (c1 + c3) / 2;
-
- /* make it */
- generate_hmap(y0, x0, xsize, ysize, grd, roug, c3);
-
- /* Convert to normal format+ clean up */
- done = generate_lake(y0, x0, xsize, ysize, c1, c2, c3, type);
- }
-
- /* Set icky flag because is a vault */
- for (x = 0; x <= xsize; x++)
- {
- for (y = 0; y <= ysize; y++)
- {
- cave[y0 - yhsize + y][x0 - xhsize + x].info |= CAVE_ICKY;
- }
- }
-
- /* make a few rooms in the vault */
- for (i = 1; i <= (xsize * ysize) / 50; i++)
- {
- build_small_room(x0 + randint0(xsize - 4) - xsize / 2 + 2,
- y0 + randint0(ysize - 4) - ysize / 2 + 2);
- }
-
- /* Fill with monsters and treasure, low difficulty */
- fill_treasure(x0 - xhsize + 1, x0 - xhsize + xsize - 1,
- y0 - yhsize + 1, y0 - yhsize + ysize - 1, randint1(5));
-}
-#endif /* ALLOW_CAVERNS_AND_LAKES */
-
-
-/*!
- * @brief タイプ10の部屋…ランダム生成vault / Type 10 -- Random vaults
- * @return なし
- */
-static bool build_type10(void)
-{
- POSITION y0, x0, xsize, ysize, vtype;
-
- /* Get size */
- /* big enough to look good, small enough to be fairly common. */
- xsize = randint1(22) + 22;
- ysize = randint1(11) + 11;
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&y0, &x0, ysize + 1, xsize + 1)) return FALSE;
-
- /* Select type of vault */
-#ifdef ALLOW_CAVERNS_AND_LAKES
- do
- {
- vtype = randint1(15);
- }
- while ((d_info[dungeon_type].flags1 & DF1_NO_CAVE) &&
- ((vtype == 1) || (vtype == 3) || (vtype == 8) || (vtype == 9) || (vtype == 11)));
-#else /* ALLOW_CAVERNS_AND_LAKES */
- do
- {
- vtype = randint1(7);
- }
- while ((d_info[dungeon_type].flags1 & DF1_NO_CAVE) &&
- ((vtype == 1) || (vtype == 3)));
-#endif /* ALLOW_CAVERNS_AND_LAKES */
-
- switch (vtype)
- {
- /* Build an appropriate room */
- case 1: case 9: build_bubble_vault(x0, y0, xsize, ysize); break;
- case 2: case 10: build_room_vault(x0, y0, xsize, ysize); break;
- case 3: case 11: build_cave_vault(x0, y0, xsize, ysize); break;
- case 4: case 12: build_maze_vault(x0, y0, xsize, ysize, TRUE); break;
- case 5: case 13: build_mini_c_vault(x0, y0, xsize, ysize); break;
- case 6: case 14: build_castle_vault(x0, y0, xsize, ysize); break;
- case 7: case 15: build_target_vault(x0, y0, xsize, ysize); break;
-#ifdef ALLOW_CAVERNS_AND_LAKES
- case 8: build_elemental_vault(x0, y0, xsize, ysize); break;
-#endif /* ALLOW_CAVERNS_AND_LAKES */
- /* I know how to add a few more... give me some time. */
-
- /* Paranoia */
- default: return FALSE;
- }
-
- return TRUE;
-}
-
-
-/*!
- * @brief タイプ11の部屋…円形部屋の生成 / Type 11 -- Build an vertical oval room.
- * @return なし
- * @details
- * For every grid in the possible square, check the distance.\n
- * If it's less than the radius, make it a room square.\n
- *\n
- * When done fill from the inside to find the walls,\n
- */
-static bool build_type11(void)
-{
- POSITION rad, x, y, x0, y0;
- int light = FALSE;
-
- /* Occasional light */
- if ((randint1(dun_level) <= 15) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
-
- rad = randint0(9);
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&y0, &x0, rad * 2 + 1, rad * 2 + 1)) return FALSE;
-
- /* Make circular floor */
- for (x = x0 - rad; x <= x0 + rad; x++)
- {
- for (y = y0 - rad; y <= y0 + rad; y++)
- {
- if (distance(y0, x0, y, x) <= rad - 1)
- {
- /* inside- so is floor */
- place_floor_bold(y, x);
- }
- else if (distance(y0, x0, y, x) <= rad + 1)
- {
- /* make granite outside so arena works */
- place_extra_bold(y, x);
- }
- }
- }
-
- /* Find visible outer walls and set to be FEAT_OUTER */
- add_outer_wall(x0, y0, light, x0 - rad, y0 - rad, x0 + rad, y0 + rad);
-
- return TRUE;
-}
-
-
-/*!
- * @brief タイプ12の部屋…ドーム型部屋の生成 / Type 12 -- Build crypt room.
- * @return なし
- * @details
- * For every grid in the possible square, check the (fake) distance.\n
- * If it's less than the radius, make it a room square.\n
- *\n
- * When done fill from the inside to find the walls,\n
- */
-static bool build_type12(void)
-{
- POSITION rad, x, y, x0, y0;
- int light = FALSE;
- bool emptyflag = TRUE;
-
- /* Make a random metric */
- int h1, h2, h3, h4;
- h1 = randint1(32) - 16;
- h2 = randint1(16);
- h3 = randint1(32);
- h4 = randint1(32) - 16;
-
- /* Occasional light */
- if ((randint1(dun_level) <= 5) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS)) light = TRUE;
-
- rad = randint1(9);
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&y0, &x0, rad * 2 + 3, rad * 2 + 3)) return FALSE;
-
- /* Make floor */
- for (x = x0 - rad; x <= x0 + rad; x++)
- {
- for (y = y0 - rad; y <= y0 + rad; y++)
- {
- /* clear room flag */
- cave[y][x].info &= ~(CAVE_ROOM);
-
- if (dist2(y0, x0, y, x, h1, h2, h3, h4) <= rad - 1)
- {
- /* inside - so is floor */
- place_floor_bold(y, x);
- }
- else if (distance(y0, x0, y, x) < 3)
- {
- place_floor_bold(y, x);
- }
- else
- {
- /* make granite outside so arena works */
- place_extra_bold(y, x);
- }
-
- /* proper boundary for arena */
- if (((y + rad) == y0) || ((y - rad) == y0) ||
- ((x + rad) == x0) || ((x - rad) == x0))
- {
- place_extra_bold(y, x);
- }
- }
- }
-
- /* Find visible outer walls and set to be FEAT_OUTER */
- add_outer_wall(x0, y0, light, x0 - rad - 1, y0 - rad - 1,
- x0 + rad + 1, y0 + rad + 1);
-
- /* Check to see if there is room for an inner vault */
- for (x = x0 - 2; x <= x0 + 2; x++)
- {
- for (y = y0 - 2; y <= y0 + 2; y++)
- {
- if (!is_floor_bold(y, x))
- {
- /* Wall in the way */
- emptyflag = FALSE;
- }
- }
- }
-
- if (emptyflag && one_in_(2))
- {
- /* Build the vault */
- build_small_room(x0, y0);
-
- /* Place a treasure in the vault */
- place_object(y0, x0, 0L);
-
- /* Let's guard the treasure well */
- vault_monsters(y0, x0, randint0(2) + 3);
-
- /* Traps naturally */
- vault_traps(y0, x0, 4, 4, randint0(3) + 2);
- }
-
- return TRUE;
-}
-
-
-
-/*!
- * @brief タイプ14の部屋…特殊トラップ部屋の生成 / Type 14 -- trapped rooms
- * @return なし
- * @details
- * A special trap is placed at center of the room
- */
-static bool build_type14(void)
-{
- POSITION y, x, y2, x2, yval, xval;
- POSITION y1, x1, xsize, ysize;
-
- bool light;
-
- cave_type *c_ptr;
- s16b trap;
-
- /* Pick a room size */
- y1 = randint1(4);
- x1 = randint1(11);
- y2 = randint1(3);
- x2 = randint1(11);
-
- xsize = x1 + x2 + 1;
- ysize = y1 + y2 + 1;
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&yval, &xval, ysize + 2, xsize + 2)) return FALSE;
-
- /* Choose lite or dark */
- light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
-
-
- /* Get corner values */
- y1 = yval - ysize / 2;
- x1 = xval - xsize / 2;
- y2 = yval + (ysize - 1) / 2;
- x2 = xval + (xsize - 1) / 2;
-
-
- /* Place a full floor under the room */
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- c_ptr = &cave[y][x];
- place_floor_grid(c_ptr);
- c_ptr->info |= (CAVE_ROOM);
- if (light) c_ptr->info |= (CAVE_GLOW);
- }
- }
-
- /* Walls around the room */
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- c_ptr = &cave[y][x1 - 1];
- place_outer_grid(c_ptr);
- c_ptr = &cave[y][x2 + 1];
- place_outer_grid(c_ptr);
- }
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- c_ptr = &cave[y1 - 1][x];
- place_outer_grid(c_ptr);
- c_ptr = &cave[y2 + 1][x];
- place_outer_grid(c_ptr);
- }
-
- if (dun_level < 30 + randint1(30))
- trap = feat_trap_piranha;
- else
- trap = feat_trap_armageddon;
-
- /* Place a special trap */
- c_ptr = &cave[rand_spread(yval, ysize/4)][rand_spread(xval, xsize/4)];
- c_ptr->mimic = c_ptr->feat;
- c_ptr->feat = trap;
-
- msg_format_wizard(CHEAT_DUNGEON, _("%sの部屋が生成されました。", "Room of %s was generated."), f_name + f_info[trap].name);
-
- return TRUE;
-}
-
-
-/*
- * Helper function for "glass room"
- */
-static bool vault_aux_lite(MONRACE_IDX r_idx)
-{
- monster_race *r_ptr = &r_info[r_idx];
-
- /* Validate the monster */
- if (!vault_monster_okay(r_idx)) return FALSE;
-
- /* Require lite attack */
- if (!(r_ptr->flags4 & RF4_BR_LITE) && !(r_ptr->a_ability_flags1 & RF5_BA_LITE)) return FALSE;
-
- /* No wall passing monsters */
- if (r_ptr->flags2 & (RF2_PASS_WALL | RF2_KILL_WALL)) return FALSE;
-
- /* No disintegrating monsters */
- if (r_ptr->flags4 & RF4_BR_DISI) return FALSE;
-
- return TRUE;
-}
-
-/*
- * Helper function for "glass room"
- */
-static bool vault_aux_shards(MONRACE_IDX r_idx)
-{
- monster_race *r_ptr = &r_info[r_idx];
-
- /* Validate the monster */
- if (!vault_monster_okay(r_idx)) return FALSE;
-
- /* Require shards breath attack */
- if (!(r_ptr->flags4 & RF4_BR_SHAR)) return FALSE;
-
- return TRUE;
-}
-
-/*
- * Hack -- determine if a template is potion
- */
-static bool kind_is_potion(KIND_OBJECT_IDX k_idx)
-{
- return k_info[k_idx].tval == TV_POTION;
-}
-
-/*!
- * @brief タイプ15の部屋…ガラス部屋の生成 / Type 15 -- glass rooms
- * @return なし
- */
-static bool build_type15(void)
-{
- POSITION y, x, y2, x2, yval, xval;
- POSITION y1, x1, xsize, ysize;
- bool light;
-
- cave_type *c_ptr;
-
- /* Pick a room size */
- xsize = rand_range(9, 13);
- ysize = rand_range(9, 13);
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&yval, &xval, ysize + 2, xsize + 2)) return FALSE;
-
- /* Choose lite or dark */
- light = ((dun_level <= randint1(25)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS));
-
- /* Get corner values */
- y1 = yval - ysize / 2;
- x1 = xval - xsize / 2;
- y2 = yval + (ysize - 1) / 2;
- x2 = xval + (xsize - 1) / 2;
-
- /* Place a full floor under the room */
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- c_ptr = &cave[y][x];
- place_floor_grid(c_ptr);
- c_ptr->feat = feat_glass_floor;
- c_ptr->info |= (CAVE_ROOM);
- if (light) c_ptr->info |= (CAVE_GLOW);
- }
- }
-
- /* Walls around the room */
- for (y = y1 - 1; y <= y2 + 1; y++)
- {
- c_ptr = &cave[y][x1 - 1];
- place_outer_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- c_ptr = &cave[y][x2 + 1];
- place_outer_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
- for (x = x1 - 1; x <= x2 + 1; x++)
- {
- c_ptr = &cave[y1 - 1][x];
- place_outer_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- c_ptr = &cave[y2 + 1][x];
- place_outer_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
-
- switch (randint1(3))
- {
- case 1: /* 4 lite breathers + potion */
- {
- int dir1, dir2;
-
- /* Prepare allocation table */
- get_mon_num_prep(vault_aux_lite, NULL);
-
- /* Place fixed lite berathers */
- for (dir1 = 4; dir1 < 8; dir1++)
- {
- MONRACE_IDX r_idx = get_mon_num(dun_level);
-
- y = yval + 2 * ddy_ddd[dir1];
- x = xval + 2 * ddx_ddd[dir1];
- if (r_idx) place_monster_aux(0, y, x, r_idx, PM_ALLOW_SLEEP);
-
- /* Walls around the breather */
- for (dir2 = 0; dir2 < 8; dir2++)
- {
- c_ptr = &cave[y + ddy_ddd[dir2]][x + ddx_ddd[dir2]];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
- }
-
- /* Walls around the potion */
- for (dir1 = 0; dir1 < 4; dir1++)
- {
- y = yval + 2 * ddy_ddd[dir1];
- x = xval + 2 * ddx_ddd[dir1];
- c_ptr = &cave[y][x];
- place_inner_perm_grid(c_ptr);
- c_ptr->feat = feat_permanent_glass_wall;
- cave[yval + ddy_ddd[dir1]][xval + ddx_ddd[dir1]].info |= (CAVE_ICKY);
- }
-
- /* Glass door */
- dir1 = randint0(4);
- y = yval + 2 * ddy_ddd[dir1];
- x = xval + 2 * ddx_ddd[dir1];
- place_secret_door(y, x, DOOR_GLASS_DOOR);
- c_ptr = &cave[y][x];
- if (is_closed_door(c_ptr->feat)) c_ptr->mimic = feat_glass_wall;
-
- /* Place a potion */
- get_obj_num_hook = kind_is_potion;
- place_object(yval, xval, AM_NO_FIXED_ART);
- cave[yval][xval].info |= (CAVE_ICKY);
- }
- break;
-
- case 2: /* 1 lite breather + random object */
- {
- MONRACE_IDX r_idx;
- DIRECTION dir1;
-
- /* Pillars */
- c_ptr = &cave[y1 + 1][x1 + 1];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
-
- c_ptr = &cave[y1 + 1][x2 - 1];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
-
- c_ptr = &cave[y2 - 1][x1 + 1];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
-
- c_ptr = &cave[y2 - 1][x2 - 1];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
-
- /* Prepare allocation table */
- get_mon_num_prep(vault_aux_lite, NULL);
-
- r_idx = get_mon_num(dun_level);
- if (r_idx) place_monster_aux(0, yval, xval, r_idx, 0L);
-
- /* Walls around the breather */
- for (dir1 = 0; dir1 < 8; dir1++)
- {
- c_ptr = &cave[yval + ddy_ddd[dir1]][xval + ddx_ddd[dir1]];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
-
- /* Curtains around the breather */
- for (y = yval - 1; y <= yval + 1; y++)
- {
- place_closed_door(y, xval - 2, DOOR_CURTAIN);
- place_closed_door(y, xval + 2, DOOR_CURTAIN);
- }
- for (x = xval - 1; x <= xval + 1; x++)
- {
- place_closed_door(yval - 2, x, DOOR_CURTAIN);
- place_closed_door(yval + 2, x, DOOR_CURTAIN);
- }
-
- /* Place an object */
- place_object(yval, xval, AM_NO_FIXED_ART);
- cave[yval][xval].info |= (CAVE_ICKY);
- }
- break;
-
- case 3: /* 4 shards breathers + 2 potions */
- {
- int dir1;
-
- /* Walls around the potion */
- for (y = yval - 2; y <= yval + 2; y++)
- {
- c_ptr = &cave[y][xval - 3];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- c_ptr = &cave[y][xval + 3];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
- for (x = xval - 2; x <= xval + 2; x++)
- {
- c_ptr = &cave[yval - 3][x];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- c_ptr = &cave[yval + 3][x];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
- for (dir1 = 4; dir1 < 8; dir1++)
- {
- c_ptr = &cave[yval + 2 * ddy_ddd[dir1]][xval + 2 * ddx_ddd[dir1]];
- place_inner_grid(c_ptr);
- c_ptr->feat = feat_glass_wall;
- }
-
- /* Prepare allocation table */
- get_mon_num_prep(vault_aux_shards, NULL);
-
- /* Place shard berathers */
- for (dir1 = 4; dir1 < 8; dir1++)
- {
- MONRACE_IDX r_idx = get_mon_num(dun_level);
-
- y = yval + ddy_ddd[dir1];
- x = xval + ddx_ddd[dir1];
- if (r_idx) place_monster_aux(0, y, x, r_idx, 0L);
- }
-
- /* Place two potions */
- if (one_in_(2))
- {
- get_obj_num_hook = kind_is_potion;
- place_object(yval, xval - 1, AM_NO_FIXED_ART);
- get_obj_num_hook = kind_is_potion;
- place_object(yval, xval + 1, AM_NO_FIXED_ART);
- }
- else
- {
- get_obj_num_hook = kind_is_potion;
- place_object(yval - 1, xval, AM_NO_FIXED_ART);
- get_obj_num_hook = kind_is_potion;
- place_object(yval + 1, xval, AM_NO_FIXED_ART);
- }
-
- for (y = yval - 2; y <= yval + 2; y++)
- for (x = xval - 2; x <= xval + 2; x++)
- cave[y][x].info |= (CAVE_ICKY);
-
- }
- break;
- }
-
- msg_print_wizard(CHEAT_DUNGEON, _("ガラスの部屋が生成されました。", "Glass room was generated."));
-
- return TRUE;
-}
-
-
-/* Create a new floor room with optional light */
-void generate_room_floor(int y1, int x1, int y2, int x2, int light)
-{
- int y, x;
-
- cave_type *c_ptr;
-
- for (y = y1; y <= y2; y++)
- {
- for (x = x1; x <= x2; x++)
- {
- /* Point to grid */
- c_ptr = &cave[y][x];
- place_floor_grid(c_ptr);
- c_ptr->info |= (CAVE_ROOM);
- if (light) c_ptr->info |= (CAVE_GLOW);
- }
- }
-}
-
-void generate_fill_perm_bold(int y1, int x1, int y2, int x2)
-{
- int y, x;
-
- for (y = y1; y <= y2; y++)
- {
- for (x = x1; x <= x2; x++)
- {
- /* Point to grid */
- place_inner_perm_bold(y, x);
- }
- }
-}
-
-/* Minimum & maximum town size */
-#define MIN_TOWN_WID ((MAX_WID / 3) / 2)
-#define MIN_TOWN_HGT ((MAX_HGT / 3) / 2)
-#define MAX_TOWN_WID ((MAX_WID / 3) * 2 / 3)
-#define MAX_TOWN_HGT ((MAX_HGT / 3) * 2 / 3)
-
-/* Struct for build underground buildings */
-typedef struct
-{
- int y0, x0; /* North-west corner (relative) */
- int y1, x1; /* South-east corner (relative) */
-}
-ugbldg_type;
-
-ugbldg_type *ugbldg;
-
-/*
- * Precalculate buildings' location of underground arcade
- */
-static bool precalc_ugarcade(int town_hgt, int town_wid, int n)
-{
- int i, y, x, center_y, center_x, tmp, attempt = 10000;
- int max_bldg_hgt = 3 * town_hgt / MAX_TOWN_HGT;
- int max_bldg_wid = 5 * town_wid / MAX_TOWN_WID;
- ugbldg_type *cur_ugbldg;
- bool **ugarcade_used, abort;
-
- /* Allocate "ugarcade_used" array (2-dimension) */
- C_MAKE(ugarcade_used, town_hgt, bool *);
- C_MAKE(*ugarcade_used, town_hgt * town_wid, bool);
- for (y = 1; y < town_hgt; y++) ugarcade_used[y] = *ugarcade_used + y * town_wid;
-
- /* Calculate building locations */
- for (i = 0; i < n; i++)
- {
- cur_ugbldg = &ugbldg[i];
- (void)WIPE(cur_ugbldg, ugbldg_type);
-
- do
- {
- /* Find the "center" of the store */
- center_y = rand_range(2, town_hgt - 3);
- center_x = rand_range(2, town_wid - 3);
-
- /* Determine the store boundaries */
- tmp = center_y - randint1(max_bldg_hgt);
- cur_ugbldg->y0 = MAX(tmp, 1);
- tmp = center_x - randint1(max_bldg_wid);
- cur_ugbldg->x0 = MAX(tmp, 1);
- tmp = center_y + randint1(max_bldg_hgt);
- cur_ugbldg->y1 = MIN(tmp, town_hgt - 2);
- tmp = center_x + randint1(max_bldg_wid);
- cur_ugbldg->x1 = MIN(tmp, town_wid - 2);
-
- /* Scan this building's area */
- for (abort = FALSE, y = cur_ugbldg->y0; (y <= cur_ugbldg->y1) && !abort; y++)
- {
- for (x = cur_ugbldg->x0; x <= cur_ugbldg->x1; x++)
- {
- if (ugarcade_used[y][x])
- {
- abort = TRUE;
- break;
- }
- }
- }
-
- attempt--;
- }
- while (abort && attempt); /* Accept this building if no overlapping */
-
- /* Failed to generate underground arcade */
- if (!attempt) break;
-
- /*
- * Mark to ugarcade_used[][] as "used"
- * Note: Building-adjacent grids are included for preventing
- * connected bulidings.
- */
- for (y = cur_ugbldg->y0 - 1; y <= cur_ugbldg->y1 + 1; y++)
- {
- for (x = cur_ugbldg->x0 - 1; x <= cur_ugbldg->x1 + 1; x++)
- {
- ugarcade_used[y][x] = TRUE;
- }
- }
- }
-
- /* Free "ugarcade_used" array (2-dimension) */
- C_KILL(*ugarcade_used, town_hgt * town_wid, bool);
- C_KILL(ugarcade_used, town_hgt, bool *);
-
- /* If i < n, generation is not allowed */
- return i == n;
-}
-
-/*!
- * @brief タイプ16の部屋…地下都市生成のサブルーチン / Actually create buildings
- * @return なし
- * @param ltcy 生成基準Y座標
- * @param ltcx 生成基準X座標
- * @param stotes[] 生成する店舗のリスト
- * @param n 生成する店舗の数
- * @note
- * Note: ltcy and ltcx indicate "left top corner".
- */
-static void build_stores(int ltcy, int ltcx, int stores[], int n)
-{
- int i, y, x;
- IDX j;
- ugbldg_type *cur_ugbldg;
-
- for (i = 0; i < n; i++)
- {
- cur_ugbldg = &ugbldg[i];
-
- /* Generate new room */
- generate_room_floor(
- ltcy + cur_ugbldg->y0 - 2, ltcx + cur_ugbldg->x0 - 2,
- ltcy + cur_ugbldg->y1 + 2, ltcx + cur_ugbldg->x1 + 2,
- FALSE);
- }
-
- for (i = 0; i < n; i++)
- {
- cur_ugbldg = &ugbldg[i];
-
- /* Build an invulnerable rectangular building */
- generate_fill_perm_bold(
- ltcy + cur_ugbldg->y0, ltcx + cur_ugbldg->x0,
- ltcy + cur_ugbldg->y1, ltcx + cur_ugbldg->x1);
-
- /* Pick a door direction (S,N,E,W) */
- switch (randint0(4))
- {
- /* Bottom side */
- case 0:
- y = cur_ugbldg->y1;
- x = rand_range(cur_ugbldg->x0, cur_ugbldg->x1);
- break;
-
- /* Top side */
- case 1:
- y = cur_ugbldg->y0;
- x = rand_range(cur_ugbldg->x0, cur_ugbldg->x1);
- break;
-
- /* Right side */
- case 2:
- y = rand_range(cur_ugbldg->y0, cur_ugbldg->y1);
- x = cur_ugbldg->x1;
- break;
-
- /* Left side */
- default:
- y = rand_range(cur_ugbldg->y0, cur_ugbldg->y1);
- x = cur_ugbldg->x0;
- break;
- }
-
- for (j = 0; j < max_f_idx; j++)
- {
- if (have_flag(f_info[j].flags, FF_STORE))
- {
- if (f_info[j].subtype == stores[i]) break;
- }
- }
-
- /* Clear previous contents, add a store door */
- if (j < max_f_idx)
- {
- cave_set_feat(ltcy + y, ltcx + x, j);
-
- /* Init store */
- store_init(NO_TOWN, stores[i]);
- }
- }
-}
-
-
-/*!
- * @brief タイプ16の部屋…地下都市の生成 / Type 16 -- Underground Arcade
- * @return なし
- * @details
- * Town logic flow for generation of new town\n
- * Originally from Vanilla 3.0.3\n
- *\n
- * We start with a fully wiped cave of normal floors.\n
- *\n
- * Note that town_gen_hack() plays games with the R.N.G.\n
- *\n
- * This function does NOT do anything about the owners of the stores,\n
- * nor the contents thereof. It only handles the physical layout.\n
- */
-static bool build_type16(void)
-{
- int stores[] =
- {
- STORE_GENERAL, STORE_ARMOURY, STORE_WEAPON, STORE_TEMPLE,
- STORE_ALCHEMIST, STORE_MAGIC, STORE_BLACK, STORE_BOOK,
- };
- int n = sizeof stores / sizeof (int);
- POSITION i, y, x, y1, x1, yval, xval;
- int town_hgt = rand_range(MIN_TOWN_HGT, MAX_TOWN_HGT);
- int town_wid = rand_range(MIN_TOWN_WID, MAX_TOWN_WID);
- bool prevent_bm = FALSE;
-
- /* Hack -- If already exist black market, prevent building */
- for (y = 0; (y < cur_hgt) && !prevent_bm; y++)
- {
- for (x = 0; x < cur_wid; x++)
- {
- if (cave[y][x].feat == FF_STORE)
- {
- prevent_bm = (f_info[cave[y][x].feat].subtype == STORE_BLACK);
- break;
- }
- }
- }
- for (i = 0; i < n; i++)
- {
- if ((stores[i] == STORE_BLACK) && prevent_bm) stores[i] = stores[--n];
- }
- if (!n) return FALSE;
-
- /* Allocate buildings array */
- C_MAKE(ugbldg, n, ugbldg_type);
-
- /* If cannot build stores, abort */
- if (!precalc_ugarcade(town_hgt, town_wid, n))
- {
- /* Free buildings array */
- C_KILL(ugbldg, n, ugbldg_type);
- return FALSE;
- }
-
- /* Find and reserve some space in the dungeon. Get center of room. */
- if (!find_space(&yval, &xval, town_hgt + 4, town_wid + 4))
- {
- /* Free buildings array */
- C_KILL(ugbldg, n, ugbldg_type);
- return FALSE;
- }
-
- /* Get top left corner */
- y1 = yval - (town_hgt / 2);
- x1 = xval - (town_wid / 2);
-
- /* Generate new room */
- generate_room_floor(
- y1 + town_hgt / 3, x1 + town_wid / 3,
- y1 + town_hgt * 2 / 3, x1 + town_wid * 2 / 3, FALSE);
-
- /* Build stores */
- build_stores(y1, x1, stores, n);
-
- msg_print_wizard(CHEAT_DUNGEON, _("地下街を生成しました", "Underground arcade was generated."));
-
- /* Free buildings array */
- C_KILL(ugbldg, n, ugbldg_type);
-
- return TRUE;
-}
-
-
-/*!
- * @brief 与えられた部屋型IDに応じて部屋の生成処理分岐を行い結果を返す / Attempt to build a room of the given type at the given block
- * @param type 部屋型ID
- * @note that we restrict the number of "crowded" rooms to reduce the chance of overflowing the monster list during level creation.
- * @return 部屋の精製に成功した場合 TRUE を返す。
- */
-static bool room_build(int typ)
-{
- /* Build a room */
- switch (typ)
- {
- /* Build an appropriate room */
- case ROOM_T_NORMAL: return build_type1();
- case ROOM_T_OVERLAP: return build_type2();
- case ROOM_T_CROSS: return build_type3();
- case ROOM_T_INNER_FEAT: return build_type4();
- case ROOM_T_NEST: return build_type5();
- case ROOM_T_PIT: return build_type6();
- case ROOM_T_LESSER_VAULT: return build_type7();
- case ROOM_T_GREATER_VAULT: return build_type8();
- case ROOM_T_FRACAVE: return build_type9();
- case ROOM_T_RANDOM_VAULT: return build_type10();
- case ROOM_T_OVAL: return build_type11();
- case ROOM_T_CRYPT: return build_type12();
- case ROOM_T_TRAP_PIT: return build_type13();
- case ROOM_T_TRAP: return build_type14();
- case ROOM_T_GLASS: return build_type15();
- case ROOM_T_ARCADE: return build_type16();
- }
-
- /* Paranoia */
- return FALSE;
-}
-
-/*!
- * @brief 指定した部屋の生成確率を別の部屋に加算し、指定した部屋の生成率を0にする
- * @param dst 確率を移す先の部屋種ID
- * @param src 確率を与える元の部屋種ID
- */
-#define MOVE_PLIST(dst, src) (prob_list[dst] += prob_list[src], prob_list[src] = 0)
-
-/*!
- * @brief 部屋生成処理のメインルーチン(Sangbandを経由してOangbandからの実装を引用) / Generate rooms in dungeon. Build bigger rooms at first. [from SAngband (originally from OAngband)]
- * @return 部屋生成に成功した場合 TRUE を返す。
- */
-bool generate_rooms(void)
-{
- int i;
- bool remain;
- int crowded = 0;
- int total_prob;
- int prob_list[ROOM_T_MAX];
- int rooms_built = 0;
- int area_size = 100 * (cur_hgt*cur_wid) / (MAX_HGT*MAX_WID);
- int level_index = MIN(10, div_round(dun_level, 10));
-
- /* Number of each type of room on this level */
- s16b room_num[ROOM_T_MAX];
-
- /* Limit number of rooms */
- int dun_rooms = DUN_ROOMS_MAX * area_size / 100;
-
- /* Assume normal cave */
- room_info_type *room_info_ptr = room_info_normal;
-
- /*
- * Initialize probability list.
- */
- for (i = 0; i < ROOM_T_MAX; i++)
- {
- /* No rooms allowed above their minimum depth. */
- if (dun_level < room_info_ptr[i].min_level)
- {
- prob_list[i] = 0;
- }
- else
- {
- prob_list[i] = room_info_ptr[i].prob[level_index];
- }
- }
-
- /*
- * XXX -- Various dungeon types and options.
- */
-
- /*! @details ダンジョンにBEGINNER、CHAMELEON、SMALLESTいずれのフラグもなく、かつ「常に通常でない部屋を生成する」フラグがONならば、GRATER_VAULTのみを生成対象とする。 / Ironman sees only Greater Vaults */
- if (ironman_rooms && !((d_info[dungeon_type].flags1 & (DF1_BEGINNER | DF1_CHAMELEON | DF1_SMALLEST))))
- {
- for (i = 0; i < ROOM_T_MAX; i++)
- {
- if (i == ROOM_T_GREATER_VAULT) prob_list[i] = 1;
- else prob_list[i] = 0;
- }
- }
-
- /*! @details ダンジョンにNO_VAULTフラグがあるならば、LESSER_VAULT / GREATER_VAULT/ RANDOM_VAULTを除外 / Forbidden vaults */
- else if (d_info[dungeon_type].flags1 & DF1_NO_VAULT)
- {
- prob_list[ROOM_T_LESSER_VAULT] = 0;
- prob_list[ROOM_T_GREATER_VAULT] = 0;
- prob_list[ROOM_T_RANDOM_VAULT] = 0;
+ prob_list[ROOM_T_FIXED] = 0;
}
/*! @details ダンジョンにNO_CAVEフラグがある場合、FRACAVEの生成枠がNORMALに与えられる。CRIPT、OVALの生成枠がINNER_Fに与えられる。/ NO_CAVE dungeon (Castle)*/
OSDN Git Service
