3 * @brief ダンジョンの生成 / Dungeon generation
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 * Note that Level generation is *not* an important bottleneck,\n
13 * though it can be annoyingly slow on older machines... Thus\n
14 * we emphasize "simplicity" and "correctness" over "speed".\n
16 * This entire file is only needed for generating levels.\n
17 * This may allow smart compilers to only load it when needed.\n
19 * Consider the "v_info.txt" file for vault generation.\n
21 * In this file, we use the "special" granite and perma-wall sub-types,\n
22 * where "basic" is normal, "inner" is inside a room, "outer" is the\n
23 * outer wall of a room, and "solid" is the outer wall of the dungeon\n
24 * or any walls that may not be pierced by corridors. Thus the only\n
25 * wall type that may be pierced by a corridor is the "outer granite"\n
26 * type. The "basic granite" type yields the "actual" corridors.\n
28 * Note that we use the special "solid" granite wall type to prevent\n
29 * multiple corridors from piercing a wall in two adjacent locations,\n
30 * which would be messy, and we use the special "outer" granite wall\n
31 * to indicate which walls "surround" rooms, and may thus be "pierced"\n
32 * by corridors entering or leaving the room.\n
34 * Note that a tunnel which attempts to leave a room near the "edge"\n
35 * of the dungeon in a direction toward that edge will cause "silly"\n
36 * wall piercings, but will have no permanently incorrect effects,\n
37 * as long as the tunnel can *eventually* exit from another side.\n
38 * And note that the wall may not come back into the room by the\n
39 * hole it left through, so it must bend to the left or right and\n
40 * then optionally re-enter the room (at least 2 grids away). This\n
41 * is not a problem since every room that is large enough to block\n
42 * the passage of tunnels is also large enough to allow the tunnel\n
43 * to pierce the room itself several times.\n
45 * Note that no two corridors may enter a room through adjacent grids,\n
46 * they must either share an entryway or else use entryways at least\n
47 * two grids apart. This prevents "large" (or "silly") doorways.\n
49 * To create rooms in the dungeon, we first divide the dungeon up\n
50 * into "blocks" of 11x11 grids each, and require that all rooms\n
51 * occupy a rectangular group of blocks. As long as each room type\n
52 * reserves a sufficient number of blocks, the room building routines\n
53 * will not need to check bounds. Note that most of the normal rooms\n
54 * actually only use 23x11 grids, and so reserve 33x11 grids.\n
56 * Note that the use of 11x11 blocks (instead of the old 33x11 blocks)\n
57 * allows more variability in the horizontal placement of rooms, and\n
58 * at the same time has the disadvantage that some rooms (two thirds\n
59 * of the normal rooms) may be "split" by panel boundaries. This can\n
60 * induce a situation where a player is in a room and part of the room\n
61 * is off the screen. It may be annoying enough to go back to 33x11\n
62 * blocks to prevent this visual situation.\n
64 * Note that the dungeon generation routines are much different (2.7.5)\n
65 * and perhaps "DUN_ROOMS" should be less than 50.\n
67 * Note that it is possible to create a room which is only\n
68 * connected to itself, because the "tunnel generation" code allows a\n
69 * tunnel to leave a room, wander around, and then re-enter the room.\n
71 * Note that it is possible to create a set of rooms which\n
72 * are only connected to other rooms in that set, since there is nothing\n
73 * explicit in the code to prevent this from happening. But this is less\n
74 * likely than the "isolated room" problem, because each room attempts to\n
75 * connect to another room, in a giant cycle, thus requiring at least two\n
76 * bizarre occurances to create an isolated section of the dungeon.\n
78 * Note that (2.7.9) monster pits have been split into monster "nests"\n
79 * and monster "pits". The "nests" have a collection of monsters of a\n
80 * given type strewn randomly around the room (jelly, animal, or undead),\n
81 * while the "pits" have a collection of monsters of a given type placed\n
82 * around the room in an organized manner (orc, troll, giant, dragon, or\n
83 * demon). Note that both "nests" and "pits" are now "level dependant",\n
84 * and both make 16 "expensive" calls to the "get_mon_num()" function.\n
86 * Note that the cave grid flags changed in a rather drastic manner\n
87 * for Angband 2.8.0 (and 2.7.9+), in particular, dungeon terrain\n
88 * features, such as doors and stairs and traps and rubble and walls,\n
89 * are all handled as a set of 64 possible "terrain features", and\n
90 * not as "fake" objects (440-479) as in pre-2.8.0 versions.\n
92 * The 64 new "dungeon features" will also be used for "visual display"\n
93 * but we must be careful not to allow, for example, the user to display\n
94 * hidden traps in a different way from floors, or secret doors in a way\n
95 * different from granite walls, or even permanent granite in a different\n
96 * way from granite. \n
100 #include "generate.h"
103 #include "floor-streams.h"
114 * Dungeon generation data -- see "cave_gen()"
120 * @brief 上下左右の外壁数をカウントする / Count the number of walls adjacent to the given grid.
124 * @note Assumes "in_bounds(y, x)"
125 * @details We count only granite walls and permanent walls.
127 static int next_to_walls(POSITION y, POSITION x)
131 if (in_bounds(y + 1, x) && is_extra_bold(y + 1, x)) k++;
132 if (in_bounds(y - 1, x) && is_extra_bold(y - 1, x)) k++;
133 if (in_bounds(y, x + 1) && is_extra_bold(y, x + 1)) k++;
134 if (in_bounds(y, x - 1) && is_extra_bold(y, x - 1)) k++;
140 * @brief alloc_stairs()の補助として指定の位置に階段を生成できるかの判定を行う / Helper function for alloc_stairs(). Is this a good location for stairs?
143 * @param walls 最低減隣接させたい外壁の数
144 * @return 階段を生成して問題がないならばTRUEを返す。
146 static bool alloc_stairs_aux(POSITION y, POSITION x, int walls)
148 cave_type *c_ptr = &cave[y][x];
150 /* Require "naked" floor grid */
151 if (!is_floor_grid(c_ptr)) return FALSE;
152 if (pattern_tile(y, x)) return FALSE;
153 if (c_ptr->o_idx || c_ptr->m_idx) return FALSE;
155 /* Require a certain number of adjacent walls */
156 if (next_to_walls(y, x) < walls) return FALSE;
163 * @brief 外壁に隣接させて階段を生成する / Places some staircases near walls
164 * @param feat 配置したい地形ID
165 * @param num 配置したい階段の数
166 * @param walls 最低減隣接させたい外壁の数
167 * @return 規定数通りに生成に成功したらTRUEを返す。
169 static bool alloc_stairs(IDX feat, int num, int walls)
174 feature_type *f_ptr = &f_info[feat];
176 if (have_flag(f_ptr->flags, FF_LESS))
178 /* No up stairs in town or in ironman mode */
179 if (ironman_downward || !dun_level) return TRUE;
181 if (dun_level > d_info[dungeon_type].mindepth)
182 shaft_num = (randint1(num+1))/2;
184 else if (have_flag(f_ptr->flags, FF_MORE))
186 QUEST_IDX q_idx = quest_number(dun_level);
188 /* No downstairs on quest levels */
189 if (dun_level > 1 && q_idx)
191 monster_race *r_ptr = &r_info[quest[q_idx].r_idx];
193 /* The quest monster(s) is still alive? */
194 if (!(r_ptr->flags1 & RF1_UNIQUE) || 0 < r_ptr->max_num)
198 /* No downstairs at the bottom */
199 if (dun_level >= d_info[dungeon_type].maxdepth) return TRUE;
201 if ((dun_level < d_info[dungeon_type].maxdepth-1) && !quest_number(dun_level+1))
202 shaft_num = (randint1(num)+1)/2;
209 /* Place "num" stairs */
210 for (i = 0; i < num; i++)
220 for (y = 1; y < cur_hgt - 1; y++)
222 for (x = 1; x < cur_wid - 1; x++)
224 if (alloc_stairs_aux(y, x, walls))
226 /* A valid space found */
232 /* No valid place! */
235 /* There are exactly no place! */
236 if (walls <= 0) return FALSE;
238 /* Decrease walls limit, and try again */
243 /* Choose a random one */
244 pick = randint1(candidates);
246 for (y = 1; y < cur_hgt - 1; y++)
248 for (x = 1; x < cur_wid - 1; x++)
250 if (alloc_stairs_aux(y, x, walls))
254 /* Is this a picked one? */
263 /* Clear possible garbage of hidden trap */
266 /* Clear previous contents, add stairs */
267 c_ptr->feat = (i < shaft_num) ? feat_state(feat, FF_SHAFT) : feat;
269 /* No longer "FLOOR" */
270 c_ptr->info &= ~(CAVE_FLOOR);
280 * @brief フロア上のランダム位置に各種オブジェクトを配置する / Allocates some objects (using "place" and "type")
281 * @param set 配置したい地形の種類
282 * @param typ 配置したいオブジェクトの種類
284 * @return 規定数通りに生成に成功したらTRUEを返す。
286 static void alloc_object(int set, EFFECT_ID typ, int num)
288 POSITION y = 0, x = 0;
293 /* A small level has few objects. */
294 num = num * cur_hgt * cur_wid / (MAX_HGT*MAX_WID) +1;
296 /* Place some objects */
297 for (k = 0; k < num; k++)
299 /* Pick a "legal" spot */
300 while (dummy < SAFE_MAX_ATTEMPTS)
306 y = randint0(cur_hgt);
307 x = randint0(cur_wid);
311 /* Require "naked" floor grid */
312 if (!is_floor_grid(c_ptr) || c_ptr->o_idx || c_ptr->m_idx) continue;
314 /* Avoid player location */
315 if (player_bold(y, x)) continue;
317 /* Check for "room" */
318 room = (cave[y][x].info & CAVE_ROOM) ? TRUE : FALSE;
320 /* Require corridor? */
321 if ((set == ALLOC_SET_CORR) && room) continue;
324 if ((set == ALLOC_SET_ROOM) && !room) continue;
330 if (dummy >= SAFE_MAX_ATTEMPTS)
332 msg_print_wizard(CHEAT_DUNGEON, _("アイテムの配置に失敗しました。", "Failed to place object."));
337 /* Place something */
340 case ALLOC_TYP_RUBBLE:
343 cave[y][x].info &= ~(CAVE_FLOOR);
350 cave[y][x].info &= ~(CAVE_FLOOR);
360 case ALLOC_TYP_OBJECT:
362 place_object(y, x, 0L);
373 * @brief クエストに関わるモンスターの配置を行う / Place quest monsters
374 * @return 成功したならばTRUEを返す
376 bool place_quest_monsters(void)
380 /* Handle the quest monster placements */
381 for (i = 0; i < max_q_idx; i++)
387 if (quest[i].status != QUEST_STATUS_TAKEN ||
388 (quest[i].type != QUEST_TYPE_KILL_LEVEL &&
389 quest[i].type != QUEST_TYPE_RANDOM) ||
390 quest[i].level != dun_level ||
391 dungeon_type != quest[i].dungeon ||
392 (quest[i].flags & QUEST_FLAG_PRESET))
398 r_ptr = &r_info[quest[i].r_idx];
400 /* Hack -- "unique" monsters must be "unique" */
401 if ((r_ptr->flags1 & RF1_UNIQUE) &&
402 (r_ptr->cur_num >= r_ptr->max_num)) continue;
404 mode = (PM_NO_KAGE | PM_NO_PET);
406 if (!(r_ptr->flags1 & RF1_FRIENDS))
407 mode |= PM_ALLOW_GROUP;
409 for (j = 0; j < (quest[i].max_num - quest[i].cur_num); j++)
413 for (k = 0; k < SAFE_MAX_ATTEMPTS; k++)
415 POSITION x = 0, y = 0;
418 /* Find an empty grid */
419 for (l = SAFE_MAX_ATTEMPTS; l > 0; l--)
424 y = randint0(cur_hgt);
425 x = randint0(cur_wid);
428 f_ptr = &f_info[c_ptr->feat];
430 if (!have_flag(f_ptr->flags, FF_MOVE) && !have_flag(f_ptr->flags, FF_CAN_FLY)) continue;
431 if (!monster_can_enter(y, x, r_ptr, 0)) continue;
432 if (distance(y, x, p_ptr->y, p_ptr->x) < 10) continue;
433 if (c_ptr->info & CAVE_ICKY) continue;
437 /* Failed to place */
438 if (!l) return FALSE;
440 /* Try to place the monster */
441 if (place_monster_aux(0, y, x, quest[i].r_idx, mode))
448 /* Failure - Try again */
453 /* Failed to place */
454 if (k == SAFE_MAX_ATTEMPTS) return FALSE;
463 * @brief マスにフロア端用の永久壁を配置する / Set boundary mimic and add "solid" perma-wall
464 * @param c_ptr 永久壁を廃止したいマス構造体の参照ポインタ
467 static void set_bound_perm_wall(cave_type *c_ptr)
469 if (bound_walls_perm)
471 /* Clear boundary mimic */
476 feature_type *f_ptr = &f_info[c_ptr->feat];
478 /* Hack -- Decline boundary walls with known treasure */
479 if ((have_flag(f_ptr->flags, FF_HAS_GOLD) || have_flag(f_ptr->flags, FF_HAS_ITEM)) &&
480 !have_flag(f_ptr->flags, FF_SECRET))
481 c_ptr->feat = feat_state(c_ptr->feat, FF_ENSECRET);
483 /* Set boundary mimic */
484 c_ptr->mimic = c_ptr->feat;
487 /* Add "solid" perma-wall */
488 place_solid_perm_grid(c_ptr);
492 * @brief フロアに洞窟や湖を配置する / Generate various caverns and lakes
493 * @details There were moved from cave_gen().
496 static void gen_caverns_and_lakes(void)
498 #ifdef ALLOW_CAVERNS_AND_LAKES
499 /* Possible "destroyed" level */
500 if ((dun_level > 30) && one_in_(DUN_DEST*2) && (small_levels) && (d_info[dungeon_type].flags1 & DF1_DESTROY))
502 dun->destroyed = TRUE;
504 /* extra rubble around the place looks cool */
505 build_lake(one_in_(2) ? LAKE_T_CAVE : LAKE_T_EARTH_VAULT);
508 /* Make a lake some of the time */
509 if (one_in_(LAKE_LEVEL) && !dun->empty_level && !dun->destroyed &&
510 (d_info[dungeon_type].flags1 & DF1_LAKE_MASK))
513 if (d_info[dungeon_type].flags1 & DF1_LAKE_WATER) count += 3;
514 if (d_info[dungeon_type].flags1 & DF1_LAKE_LAVA) count += 3;
515 if (d_info[dungeon_type].flags1 & DF1_LAKE_RUBBLE) count += 3;
516 if (d_info[dungeon_type].flags1 & DF1_LAKE_TREE) count += 3;
518 if (d_info[dungeon_type].flags1 & DF1_LAKE_LAVA)
521 if ((dun_level > 80) && (randint0(count) < 2)) dun->laketype = LAKE_T_LAVA;
525 if (!dun->laketype && (dun_level > 80) && one_in_(count)) dun->laketype = LAKE_T_FIRE_VAULT;
529 if ((d_info[dungeon_type].flags1 & DF1_LAKE_WATER) && !dun->laketype)
532 if ((dun_level > 50) && randint0(count) < 2) dun->laketype = LAKE_T_WATER;
536 if (!dun->laketype && (dun_level > 50) && one_in_(count)) dun->laketype = LAKE_T_WATER_VAULT;
540 if ((d_info[dungeon_type].flags1 & DF1_LAKE_RUBBLE) && !dun->laketype)
543 if ((dun_level > 35) && (randint0(count) < 2)) dun->laketype = LAKE_T_CAVE;
546 /* Lake of rubble2 */
547 if (!dun->laketype && (dun_level > 35) && one_in_(count)) dun->laketype = LAKE_T_EARTH_VAULT;
552 if ((dun_level > 5) && (d_info[dungeon_type].flags1 & DF1_LAKE_TREE) && !dun->laketype) dun->laketype = LAKE_T_AIR_VAULT;
556 msg_print_wizard(CHEAT_DUNGEON, _("湖を生成します。", "Lake on the level."));
557 build_lake(dun->laketype);
561 if ((dun_level > DUN_CAVERN) && !dun->empty_level &&
562 (d_info[dungeon_type].flags1 & DF1_CAVERN) &&
563 !dun->laketype && !dun->destroyed && (randint1(1000) < dun_level))
567 /* make a large fractal cave in the middle of the dungeon */
569 msg_print_wizard(CHEAT_DUNGEON, _("洞窟を生成。", "Cavern on level."));
572 #endif /* ALLOW_CAVERNS_AND_LAKES */
574 /* Hack -- No destroyed "quest" levels */
575 if (quest_number(dun_level)) dun->destroyed = FALSE;
580 * @brief ダンジョン生成のメインルーチン / Generate a new dungeon level
581 * @details Note that "dun_body" adds about 4000 bytes of memory to the stack.
582 * @return ダンジョン生成が全て無事に成功したらTRUEを返す。
584 static bool cave_gen(void)
593 dun->destroyed = FALSE;
594 dun->empty_level = FALSE;
598 /* Fill the arrays of floors and walls in the good proportions */
599 set_floor_and_wall(dungeon_type);
601 /* Prepare allocation table */
602 get_mon_num_prep(get_monster_hook(), NULL);
604 /* Randomize the dungeon creation values */
605 dun_tun_rnd = rand_range(DUN_TUN_RND_MIN, DUN_TUN_RND_MAX);
606 dun_tun_chg = rand_range(DUN_TUN_CHG_MIN, DUN_TUN_CHG_MAX);
607 dun_tun_con = rand_range(DUN_TUN_CON_MIN, DUN_TUN_CON_MAX);
608 dun_tun_pen = rand_range(DUN_TUN_PEN_MIN, DUN_TUN_PEN_MAX);
609 dun_tun_jct = rand_range(DUN_TUN_JCT_MIN, DUN_TUN_JCT_MAX);
611 /* Actual maximum number of rooms on this level */
612 dun->row_rooms = cur_hgt / BLOCK_HGT;
613 dun->col_rooms = cur_wid / BLOCK_WID;
615 /* Initialize the room table */
616 for (y = 0; y < dun->row_rooms; y++)
618 for (x = 0; x < dun->col_rooms; x++)
620 dun->room_map[y][x] = FALSE;
627 /* Empty arena levels */
628 if (ironman_empty_levels || ((d_info[dungeon_type].flags1 & DF1_ARENA) && (empty_levels && one_in_(EMPTY_LEVEL))))
630 dun->empty_level = TRUE;
631 msg_print_wizard(CHEAT_DUNGEON, _("アリーナレベルを生成。", "Arena level."));
634 if (dun->empty_level)
636 /* Start with floors */
637 for (y = 0; y < cur_hgt; y++)
639 for (x = 0; x < cur_wid; x++)
641 place_floor_bold(y, x);
645 /* Special boundary walls -- Top and bottom */
646 for (x = 0; x < cur_wid; x++)
648 place_extra_bold(0, x);
649 place_extra_bold(cur_hgt - 1, x);
652 /* Special boundary walls -- Left and right */
653 for (y = 1; y < (cur_hgt - 1); y++)
655 place_extra_bold(y, 0);
656 place_extra_bold(y, cur_wid - 1);
661 /* Start with walls */
662 for (y = 0; y < cur_hgt; y++)
664 for (x = 0; x < cur_wid; x++)
666 place_extra_bold(y, x);
672 /* Generate various caverns and lakes */
673 gen_caverns_and_lakes();
677 if (d_info[dungeon_type].flags1 & DF1_MAZE)
679 build_maze_vault(cur_wid/2-1, cur_hgt/2-1, cur_wid-4, cur_hgt-4, FALSE);
681 /* Place 3 or 4 down stairs near some walls */
682 if (!alloc_stairs(feat_down_stair, rand_range(2, 3), 3)) return FALSE;
684 /* Place 1 or 2 up stairs near some walls */
685 if (!alloc_stairs(feat_up_stair, 1, 3)) return FALSE;
688 /* Build some rooms */
691 int tunnel_fail_count = 0;
694 * Build each type of room in turn until we cannot build any more.
696 if (!generate_rooms()) return FALSE;
699 /* Make a hole in the dungeon roof sometimes at level 1 */
702 while (one_in_(DUN_MOS_DEN))
704 place_trees(randint1(cur_wid - 2), randint1(cur_hgt - 2));
708 /* Destroy the level if necessary */
709 if (dun->destroyed) destroy_level();
711 /* Hack -- Add some rivers */
712 if (one_in_(3) && (randint1(dun_level) > 5))
714 IDX feat1 = 0, feat2 = 0;
716 /* Choose water or lava */
717 if ((randint1(MAX_DEPTH * 2) - 1 > dun_level) && (d_info[dungeon_type].flags1 & DF1_WATER_RIVER))
719 feat1 = feat_deep_water;
720 feat2 = feat_shallow_water;
722 else if (d_info[dungeon_type].flags1 & DF1_LAVA_RIVER)
724 feat1 = feat_deep_lava;
725 feat2 = feat_shallow_lava;
731 feature_type *f_ptr = &f_info[feat1];
733 /* Only add river if matches lake type or if have no lake at all */
734 if (((dun->laketype == LAKE_T_LAVA) && have_flag(f_ptr->flags, FF_LAVA)) ||
735 ((dun->laketype == LAKE_T_WATER) && have_flag(f_ptr->flags, FF_WATER)) ||
738 add_river(feat1, feat2);
743 /* Hack -- Scramble the room order */
744 for (i = 0; i < dun->cent_n; i++)
747 int pick = rand_range(0, i);
751 dun->cent[i].y = dun->cent[pick].y;
752 dun->cent[i].x = dun->cent[pick].x;
753 dun->cent[pick].y = ty;
754 dun->cent[pick].x = tx;
757 /* Start with no tunnel doors */
760 /* Hack -- connect the first room to the last room */
761 y = dun->cent[dun->cent_n-1].y;
762 x = dun->cent[dun->cent_n-1].x;
764 /* Connect all the rooms together */
765 for (i = 0; i < dun->cent_n; i++)
769 /* Reset the arrays */
773 /* Connect the room to the previous room */
774 if (randint1(dun_level) > d_info[dungeon_type].tunnel_percent)
776 /* make cave-like tunnel */
777 (void)build_tunnel2(dun->cent[i].x, dun->cent[i].y, x, y, 2, 2);
781 /* make normal tunnel */
782 if (!build_tunnel(dun->cent[i].y, dun->cent[i].x, y, x)) tunnel_fail_count++;
785 if (tunnel_fail_count >= 2) return FALSE;
787 /* Turn the tunnel into corridor */
788 for (j = 0; j < dun->tunn_n; j++)
795 f_ptr = &f_info[c_ptr->feat];
797 /* Clear previous contents (if not a lake), add a floor */
798 if (!have_flag(f_ptr->flags, FF_MOVE) || (!have_flag(f_ptr->flags, FF_WATER) && !have_flag(f_ptr->flags, FF_LAVA)))
800 /* Clear mimic type */
803 place_floor_grid(c_ptr);
807 /* Apply the piercings that we found */
808 for (j = 0; j < dun->wall_n; j++)
815 /* Clear mimic type */
818 /* Clear previous contents, add up floor */
819 place_floor_grid(c_ptr);
821 /* Occasional doorway */
822 if ((randint0(100) < dun_tun_pen) && !(d_info[dungeon_type].flags1 & DF1_NO_DOORS))
824 /* Place a random door */
825 place_random_door(y, x, TRUE);
829 /* Remember the "previous" room */
834 /* Place intersection doors */
835 for (i = 0; i < dun->door_n; i++)
837 /* Extract junction location */
841 /* Try placing doors */
848 /* Place 3 or 4 down stairs near some walls */
849 if (!alloc_stairs(feat_down_stair, rand_range(3, 4), 3)) return FALSE;
851 /* Place 1 or 2 up stairs near some walls */
852 if (!alloc_stairs(feat_up_stair, rand_range(1, 2), 3)) return FALSE;
857 if (d_info[dungeon_type].stream2)
859 /* Hack -- Add some quartz streamers */
860 for (i = 0; i < DUN_STR_QUA; i++)
862 build_streamer(d_info[dungeon_type].stream2, DUN_STR_QC);
866 if (d_info[dungeon_type].stream1)
868 /* Hack -- Add some magma streamers */
869 for (i = 0; i < DUN_STR_MAG; i++)
871 build_streamer(d_info[dungeon_type].stream1, DUN_STR_MC);
876 /* Special boundary walls -- Top and bottom */
877 for (x = 0; x < cur_wid; x++)
879 set_bound_perm_wall(&cave[0][x]);
880 set_bound_perm_wall(&cave[cur_hgt - 1][x]);
883 /* Special boundary walls -- Left and right */
884 for (y = 1; y < (cur_hgt - 1); y++)
886 set_bound_perm_wall(&cave[y][0]);
887 set_bound_perm_wall(&cave[y][cur_wid - 1]);
890 /* Determine the character location */
891 if (!new_player_spot()) return FALSE;
893 if (!place_quest_monsters()) return FALSE;
900 /* Pick a base number of monsters */
901 i = d_info[dungeon_type].min_m_alloc_level;
903 /* To make small levels a bit more playable */
904 if (cur_hgt < MAX_HGT || cur_wid < MAX_WID)
906 int small_tester = i;
908 i = (i * cur_hgt) / MAX_HGT;
909 i = (i * cur_wid) / MAX_WID;
912 if (i > small_tester) i = small_tester;
913 else msg_format_wizard(CHEAT_DUNGEON,
914 _("モンスター数基本値を %d から %d に減らします", "Reduced monsters base from %d to %d"), small_tester, i);
920 /* Put some monsters in the dungeon */
921 for (i = i + k; i > 0; i--)
923 (void)alloc_monster(0, PM_ALLOW_SLEEP);
926 /* Place some traps in the dungeon */
927 alloc_object(ALLOC_SET_BOTH, ALLOC_TYP_TRAP, randint1(k));
929 /* Put some rubble in corridors (except NO_CAVE dungeon (Castle)) */
930 if (!(d_info[dungeon_type].flags1 & DF1_NO_CAVE)) alloc_object(ALLOC_SET_CORR, ALLOC_TYP_RUBBLE, randint1(k));
932 /* Mega Hack -- No object at first level of deeper dungeon */
933 if (p_ptr->enter_dungeon && dun_level > 1)
939 /* Put some objects in rooms */
940 alloc_object(ALLOC_SET_ROOM, ALLOC_TYP_OBJECT, randnor(DUN_AMT_ROOM, 3));
942 /* Put some objects/gold in the dungeon */
943 alloc_object(ALLOC_SET_BOTH, ALLOC_TYP_OBJECT, randnor(DUN_AMT_ITEM, 3));
944 alloc_object(ALLOC_SET_BOTH, ALLOC_TYP_GOLD, randnor(DUN_AMT_GOLD, 3));
946 /* Set back to default */
947 object_level = base_level;
949 /* Put the Guardian */
950 if (!alloc_guardian(TRUE)) return FALSE;
952 if (dun->empty_level && (!one_in_(DARK_EMPTY) || (randint1(100) > dun_level)) && !(d_info[dungeon_type].flags1 & DF1_DARKNESS))
955 for (y = 0; y < cur_hgt; y++)
957 for (x = 0; x < cur_wid; x++)
959 cave[y][x].info |= (CAVE_GLOW);
968 * @brief 闘技場用のアリーナ地形を作成する / Builds the arena after it is entered -KMW-
971 static void build_arena(void)
973 POSITION yval, y_height, y_depth, xval, x_left, x_right;
976 yval = SCREEN_HGT / 2;
977 xval = SCREEN_WID / 2;
978 y_height = yval - 10;
983 for (i = y_height; i <= y_height + 5; i++)
984 for (j = x_left; j <= x_right; j++)
986 place_extra_perm_bold(i, j);
987 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
989 for (i = y_depth; i >= y_depth - 5; i--)
990 for (j = x_left; j <= x_right; j++)
992 place_extra_perm_bold(i, j);
993 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
995 for (j = x_left; j <= x_left + 17; j++)
996 for (i = y_height; i <= y_depth; i++)
998 place_extra_perm_bold(i, j);
999 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1001 for (j = x_right; j >= x_right - 17; j--)
1002 for (i = y_height; i <= y_depth; i++)
1004 place_extra_perm_bold(i, j);
1005 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1008 place_extra_perm_bold(y_height+6, x_left+18);
1009 cave[y_height+6][x_left+18].info |= (CAVE_GLOW | CAVE_MARK);
1010 place_extra_perm_bold(y_depth-6, x_left+18);
1011 cave[y_depth-6][x_left+18].info |= (CAVE_GLOW | CAVE_MARK);
1012 place_extra_perm_bold(y_height+6, x_right-18);
1013 cave[y_height+6][x_right-18].info |= (CAVE_GLOW | CAVE_MARK);
1014 place_extra_perm_bold(y_depth-6, x_right-18);
1015 cave[y_depth-6][x_right-18].info |= (CAVE_GLOW | CAVE_MARK);
1019 cave[i][j].feat = f_tag_to_index("ARENA_GATE");
1020 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1025 * @brief 闘技場への入場処理 / Town logic flow for generation of arena -KMW-
1028 static void arena_gen(void)
1035 cur_hgt = SCREEN_HGT;
1036 cur_wid = SCREEN_WID;
1038 /* Start with solid walls */
1039 for (y = 0; y < MAX_HGT; y++)
1041 for (x = 0; x < MAX_WID; x++)
1043 /* Create "solid" perma-wall */
1044 place_solid_perm_bold(y, x);
1046 /* Illuminate and memorize the walls */
1047 cave[y][x].info |= (CAVE_GLOW | CAVE_MARK);
1051 /* Then place some floors */
1052 for (y = qy + 1; y < qy + SCREEN_HGT - 1; y++)
1054 for (x = qx + 1; x < qx + SCREEN_WID - 1; x++)
1056 /* Create empty floor */
1057 cave[y][x].feat = feat_floor;
1063 if(!place_monster_aux(0, p_ptr->y + 5, p_ptr->x, arena_info[p_ptr->arena_number].r_idx, (PM_NO_KAGE | PM_NO_PET)))
1065 p_ptr->exit_bldg = TRUE;
1066 p_ptr->arena_number++;
1067 msg_print(_("相手は欠場した。あなたの不戦勝だ。", "The enemy is unable appear. You won by default."));
1073 * @brief モンスター闘技場のフロア生成 / Builds the arena after it is entered -KMW-
1076 static void build_battle(void)
1078 POSITION yval, y_height, y_depth, xval, x_left, x_right;
1081 yval = SCREEN_HGT / 2;
1082 xval = SCREEN_WID / 2;
1083 y_height = yval - 10;
1084 y_depth = yval + 10;
1086 x_right = xval + 32;
1088 for (i = y_height; i <= y_height + 5; i++)
1089 for (j = x_left; j <= x_right; j++)
1091 place_extra_perm_bold(i, j);
1092 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1094 for (i = y_depth; i >= y_depth - 3; i--)
1095 for (j = x_left; j <= x_right; j++)
1097 place_extra_perm_bold(i, j);
1098 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1100 for (j = x_left; j <= x_left + 17; j++)
1101 for (i = y_height; i <= y_depth; i++)
1103 place_extra_perm_bold(i, j);
1104 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1106 for (j = x_right; j >= x_right - 17; j--)
1107 for (i = y_height; i <= y_depth; i++)
1109 place_extra_perm_bold(i, j);
1110 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1113 place_extra_perm_bold(y_height+6, x_left+18);
1114 cave[y_height+6][x_left+18].info |= (CAVE_GLOW | CAVE_MARK);
1115 place_extra_perm_bold(y_depth-4, x_left+18);
1116 cave[y_depth-4][x_left+18].info |= (CAVE_GLOW | CAVE_MARK);
1117 place_extra_perm_bold(y_height+6, x_right-18);
1118 cave[y_height+6][x_right-18].info |= (CAVE_GLOW | CAVE_MARK);
1119 place_extra_perm_bold(y_depth-4, x_right-18);
1120 cave[y_depth-4][x_right-18].info |= (CAVE_GLOW | CAVE_MARK);
1122 for (i = y_height + 1; i <= y_height + 5; i++)
1123 for (j = x_left + 20 + 2 * (y_height + 5 - i); j <= x_right - 20 - 2 * (y_height + 5 - i); j++)
1125 cave[i][j].feat = feat_permanent_glass_wall;
1130 cave[i][j].feat = f_tag_to_index("BUILDING_3");
1131 cave[i][j].info |= (CAVE_GLOW | CAVE_MARK);
1136 * @brief モンスター闘技場への導入処理 / Town logic flow for generation of arena -KMW-
1139 static void battle_gen(void)
1146 /* Start with solid walls */
1147 for (y = 0; y < MAX_HGT; y++)
1149 for (x = 0; x < MAX_WID; x++)
1151 /* Create "solid" perma-wall */
1152 place_solid_perm_bold(y, x);
1154 /* Illuminate and memorize the walls */
1155 cave[y][x].info |= (CAVE_GLOW | CAVE_MARK);
1159 /* Then place some floors */
1160 for (y = qy + 1; y < qy + SCREEN_HGT - 1; y++)
1162 for (x = qx + 1; x < qx + SCREEN_WID - 1; x++)
1164 /* Create empty floor */
1165 cave[y][x].feat = feat_floor;
1171 for(i = 0; i < 4; i++)
1173 place_monster_aux(0, p_ptr->y + 8 + (i/2)*4, p_ptr->x - 2 + (i%2)*4, battle_mon[i], (PM_NO_KAGE | PM_NO_PET));
1174 set_friendly(&m_list[cave[p_ptr->y+8+(i/2)*4][p_ptr->x-2+(i%2)*4].m_idx]);
1176 for(i = 1; i < m_max; i++)
1178 monster_type *m_ptr = &m_list[i];
1180 if (!m_ptr->r_idx) continue;
1182 /* Hack -- Detect monster */
1183 m_ptr->mflag2 |= (MFLAG2_MARK | MFLAG2_SHOW);
1184 update_monster(i, FALSE);
1189 * @brief 固定マップクエストのフロア生成 / Generate a quest level
1192 static void quest_gen(void)
1196 /* Start with perm walls */
1197 for (y = 0; y < cur_hgt; y++)
1199 for (x = 0; x < cur_wid; x++)
1201 place_solid_perm_bold(y, x);
1205 /* Set the quest level */
1206 base_level = quest[p_ptr->inside_quest].level;
1207 dun_level = base_level;
1208 object_level = base_level;
1209 monster_level = base_level;
1211 if (record_stair) do_cmd_write_nikki(NIKKI_TO_QUEST, p_ptr->inside_quest, NULL);
1213 /* Prepare allocation table */
1214 get_mon_num_prep(get_monster_hook(), NULL);
1216 init_flags = INIT_CREATE_DUNGEON;
1218 process_dungeon_file("q_info.txt", 0, 0, MAX_HGT, MAX_WID);
1222 * @brief ダンジョン時のランダムフロア生成 / Make a real level
1223 * @return フロアの生成に成功したらTRUE
1225 static bool level_gen(cptr *why)
1227 int level_height, level_width;
1229 if ((always_small_levels || ironman_small_levels ||
1230 (one_in_(SMALL_LEVEL) && small_levels) ||
1231 (d_info[dungeon_type].flags1 & DF1_BEGINNER) ||
1232 (d_info[dungeon_type].flags1 & DF1_SMALLEST)) &&
1233 !(d_info[dungeon_type].flags1 & DF1_BIG))
1235 if (d_info[dungeon_type].flags1 & DF1_SMALLEST)
1240 else if (d_info[dungeon_type].flags1 & DF1_BEGINNER)
1249 level_height = randint1(MAX_HGT/SCREEN_HGT);
1250 level_width = randint1(MAX_WID/SCREEN_WID);
1252 while ((level_height == MAX_HGT/SCREEN_HGT) && (level_width == MAX_WID/SCREEN_WID));
1255 cur_hgt = level_height * SCREEN_HGT;
1256 cur_wid = level_width * SCREEN_WID;
1258 /* Assume illegal panel */
1259 panel_row_min = cur_hgt;
1260 panel_col_min = cur_wid;
1262 msg_format_wizard(CHEAT_DUNGEON,
1263 _("小さなフロア: X:%d, Y:%d", "A 'small' dungeon level: X:%d, Y:%d."),
1272 /* Assume illegal panel */
1273 panel_row_min = cur_hgt;
1274 panel_col_min = cur_wid;
1277 /* Make a dungeon */
1280 *why = _("ダンジョン生成に失敗", "could not place player");
1287 * @brief フロアに存在する全マスの記憶状態を初期化する / Wipe all unnecessary flags after cave generation
1290 void wipe_generate_cave_flags(void)
1294 for (y = 0; y < cur_hgt; y++)
1296 for (x = 0; x < cur_wid; x++)
1298 /* Wipe unused flags */
1299 cave[y][x].info &= ~(CAVE_MASK);
1305 for (y = 1; y < cur_hgt - 1; y++)
1307 for (x = 1; x < cur_wid - 1; x++)
1309 /* There might be trap */
1310 cave[y][x].info |= CAVE_UNSAFE;
1317 * @brief フロアの全情報を初期化する / Clear and empty the cave
1320 void clear_cave(void)
1325 /* Very simplified version of wipe_o_list() */
1326 (void)C_WIPE(o_list, o_max, object_type);
1330 /* Very simplified version of wipe_m_list() */
1331 for (i = 1; i < max_r_idx; i++)
1332 r_info[i].cur_num = 0;
1333 (void)C_WIPE(m_list, m_max, monster_type);
1336 for (i = 0; i < MAX_MTIMED; i++) mproc_max[i] = 0;
1338 /* Pre-calc cur_num of pets in party_mon[] */
1339 precalc_cur_num_of_pet();
1342 /* Start with a blank cave */
1343 for (y = 0; y < MAX_HGT; y++)
1345 for (x = 0; x < MAX_WID; x++)
1347 cave_type *c_ptr = &cave[y][x];
1360 /* Mega-Hack -- no player yet */
1361 p_ptr->x = p_ptr->y = 0;
1363 /* Set the base level */
1364 base_level = dun_level;
1366 /* Reset the monster generation level */
1367 monster_level = base_level;
1369 /* Reset the object generation level */
1370 object_level = base_level;
1375 * ダンジョンのランダムフロアを生成する / Generates a random dungeon level -RAK-
1377 * @note Hack -- regenerate any "overflow" levels
1379 void generate_cave(void)
1383 /* Fill the arrays of floors and walls in the good proportions */
1384 set_floor_and_wall(dungeon_type);
1387 for (num = 0; TRUE; num++)
1393 /* Clear and empty the cave */
1396 /* Build the arena -KMW- */
1397 if (p_ptr->inside_arena)
1403 /* Build the battle -KMW- */
1404 else if (p_ptr->inside_battle)
1410 else if (p_ptr->inside_quest)
1415 /* Build the town */
1416 else if (!dun_level)
1418 /* Make the wilderness */
1419 if (p_ptr->wild_mode) wilderness_gen_small();
1420 else wilderness_gen();
1423 /* Build a real level */
1426 okay = level_gen(&why);
1430 /* Prevent object over-flow */
1431 if (o_max >= max_o_idx)
1433 why = _("アイテムが多すぎる", "too many objects");
1436 /* Prevent monster over-flow */
1437 else if (m_max >= max_m_idx)
1439 why = _("モンスターが多すぎる", "too many monsters");
1446 if (why) msg_format(_("生成やり直し(%s)", "Generation restarted (%s)"), why);
1452 /* Glow deep lava and building entrances */
1453 glow_deep_lava_and_bldg();
1456 p_ptr->enter_dungeon = FALSE;
1458 wipe_generate_cave_flags();
1462 * @brief 部屋間のトンネルを生成する / Constructs a tunnel between two points
1467 * @return 生成に成功したらTRUEを返す
1469 * This function must be called BEFORE any streamers are created,\n
1470 * since we use the special "granite wall" sub-types to keep track\n
1471 * of legal places for corridors to pierce rooms.\n
1473 * We use "door_flag" to prevent excessive construction of doors\n
1474 * along overlapping corridors.\n
1476 * We queue the tunnel grids to prevent door creation along a corridor\n
1477 * which intersects itself.\n
1479 * We queue the wall piercing grids to prevent a corridor from leaving\n
1480 * a room and then coming back in through the same entrance.\n
1482 * We "pierce" grids which are "outer" walls of rooms, and when we\n
1483 * do so, we change all adjacent "outer" walls of rooms into "solid"\n
1484 * walls so that no two corridors may use adjacent grids for exits.\n
1486 * The "solid" wall check prevents corridors from "chopping" the\n
1487 * corners of rooms off, as well as "silly" door placement, and\n
1488 * "excessively wide" room entrances.\n
1492 * inner -- inner room walls\n
1493 * outer -- outer room walls\n
1494 * solid -- solid room walls\n
1496 bool build_tunnel(POSITION row1, POSITION col1, POSITION row2, POSITION col2)
1499 POSITION tmp_row, tmp_col;
1500 POSITION row_dir, col_dir;
1501 POSITION start_row, start_col;
1502 int main_loop_count = 0;
1504 bool door_flag = FALSE;
1508 /* Save the starting location */
1512 /* Start out in the correct direction */
1513 correct_dir(&row_dir, &col_dir, row1, col1, row2, col2);
1515 /* Keep going until done (or bored) */
1516 while ((row1 != row2) || (col1 != col2))
1518 /* Mega-Hack -- Paranoia -- prevent infinite loops */
1519 if (main_loop_count++ > 2000) return FALSE;
1521 /* Allow bends in the tunnel */
1522 if (randint0(100) < dun_tun_chg)
1524 /* Acquire the correct direction */
1525 correct_dir(&row_dir, &col_dir, row1, col1, row2, col2);
1527 /* Random direction */
1528 if (randint0(100) < dun_tun_rnd)
1530 rand_dir(&row_dir, &col_dir);
1534 /* Get the next location */
1535 tmp_row = row1 + row_dir;
1536 tmp_col = col1 + col_dir;
1539 /* Extremely Important -- do not leave the dungeon */
1540 while (!in_bounds(tmp_row, tmp_col))
1542 /* Acquire the correct direction */
1543 correct_dir(&row_dir, &col_dir, row1, col1, row2, col2);
1545 /* Random direction */
1546 if (randint0(100) < dun_tun_rnd)
1548 rand_dir(&row_dir, &col_dir);
1551 /* Get the next location */
1552 tmp_row = row1 + row_dir;
1553 tmp_col = col1 + col_dir;
1557 /* Access the location */
1558 c_ptr = &cave[tmp_row][tmp_col];
1560 /* Avoid "solid" walls */
1561 if (is_solid_grid(c_ptr)) continue;
1563 /* Pierce "outer" walls of rooms */
1564 if (is_outer_grid(c_ptr))
1566 /* Acquire the "next" location */
1567 y = tmp_row + row_dir;
1568 x = tmp_col + col_dir;
1570 /* Hack -- Avoid outer/solid walls */
1571 if (is_outer_bold(y, x)) continue;
1572 if (is_solid_bold(y, x)) continue;
1574 /* Accept this location */
1575 row1 = (POSITION)tmp_row;
1576 col1 = (POSITION)tmp_col;
1578 /* Save the wall location */
1579 if (dun->wall_n < WALL_MAX)
1581 dun->wall[dun->wall_n].y = row1;
1582 dun->wall[dun->wall_n].x = col1;
1587 /* Forbid re-entry near this piercing */
1588 for (y = row1 - 1; y <= row1 + 1; y++)
1590 for (x = col1 - 1; x <= col1 + 1; x++)
1592 /* Convert adjacent "outer" walls as "solid" walls */
1593 if (is_outer_bold(y, x))
1595 /* Change the wall to a "solid" wall */
1596 place_solid_noperm_bold(y, x);
1602 /* Travel quickly through rooms */
1603 else if (c_ptr->info & (CAVE_ROOM))
1605 /* Accept the location */
1610 /* Tunnel through all other walls */
1611 else if (is_extra_grid(c_ptr) || is_inner_grid(c_ptr) || is_solid_grid(c_ptr))
1613 /* Accept this location */
1617 /* Save the tunnel location */
1618 if (dun->tunn_n < TUNN_MAX)
1620 dun->tunn[dun->tunn_n].y = row1;
1621 dun->tunn[dun->tunn_n].x = col1;
1626 /* Allow door in next grid */
1630 /* Handle corridor intersections or overlaps */
1633 /* Accept the location */
1637 /* Collect legal door locations */
1640 /* Save the door location */
1641 if (dun->door_n < DOOR_MAX)
1643 dun->door[dun->door_n].y = row1;
1644 dun->door[dun->door_n].x = col1;
1649 /* No door in next grid */
1653 /* Hack -- allow pre-emptive tunnel termination */
1654 if (randint0(100) >= dun_tun_con)
1656 /* Distance between row1 and start_row */
1657 tmp_row = row1 - start_row;
1658 if (tmp_row < 0) tmp_row = (-tmp_row);
1660 /* Distance between col1 and start_col */
1661 tmp_col = col1 - start_col;
1662 if (tmp_col < 0) tmp_col = (-tmp_col);
1664 /* Terminate the tunnel */
1665 if ((tmp_row > 10) || (tmp_col > 10)) break;
1675 * @brief トンネル生成のための基準点を指定する。
1676 * @param x 基準点を指定するX座標の参照ポインタ、適時値が修正される。
1677 * @param y 基準点を指定するY座標の参照ポインタ、適時値が修正される。
1678 * @param affectwall (調査中)
1681 * This routine adds the square to the tunnel\n
1682 * It also checks for SOLID walls - and returns a nearby\n
1683 * non-SOLID square in (x,y) so that a simple avoiding\n
1684 * routine can be used. The returned boolean value reflects\n
1685 * whether or not this routine hit a SOLID wall.\n
1687 * "affectwall" toggles whether or not this new square affects\n
1688 * the boundaries of rooms. - This is used by the catacomb\n
1690 * @todo 特に詳細な処理の意味を調査すべし
1692 static bool set_tunnel(POSITION *x, POSITION *y, bool affectwall)
1696 cave_type *c_ptr = &cave[*y][*x];
1698 if (!in_bounds(*y, *x)) return TRUE;
1700 if (is_inner_grid(c_ptr))
1705 if (is_extra_bold(*y, *x))
1707 /* Save the tunnel location */
1708 if (dun->tunn_n < TUNN_MAX)
1710 dun->tunn[dun->tunn_n].y = *y;
1711 dun->tunn[dun->tunn_n].x = *x;
1719 if (is_floor_bold(*y, *x))
1721 /* Don't do anything */
1725 if (is_outer_grid(c_ptr) && affectwall)
1727 /* Save the wall location */
1728 if (dun->wall_n < WALL_MAX)
1730 dun->wall[dun->wall_n].y = *y;
1731 dun->wall[dun->wall_n].x = *x;
1736 /* Forbid re-entry near this piercing */
1737 for (j = *y - 1; j <= *y + 1; j++)
1739 for (i = *x - 1; i <= *x + 1; i++)
1741 /* Convert adjacent "outer" walls as "solid" walls */
1742 if (is_outer_bold(j, i))
1744 /* Change the wall to a "solid" wall */
1745 place_solid_noperm_bold(j, i);
1750 /* Clear mimic type */
1751 cave[*y][*x].mimic = 0;
1753 place_floor_bold(*y, *x);
1758 if (is_solid_grid(c_ptr) && affectwall)
1760 /* cannot place tunnel here - use a square to the side */
1762 /* find usable square and return value in (x,y) */
1768 while ((i > 0) && is_solid_bold(*y + dy, *x + dx))
1770 dy = randint0(3) - 1;
1771 dx = randint0(3) - 1;
1773 if (!in_bounds(*y + dy, *x + dx))
1784 /* Failed for some reason: hack - ignore the solidness */
1785 place_outer_grid(c_ptr);
1790 /* Give new, acceptable coordinate. */
1802 * @brief 外壁を削って「カタコンベ状」の通路を作成する / This routine creates the catacomb-like tunnels by removing extra rock.
1807 * Note that this routine is only called on "even" squares - so it gives
1808 * a natural checkerboard pattern.
1810 static void create_cata_tunnel(POSITION x, POSITION y)
1817 set_tunnel(&x1, &y1, FALSE);
1821 set_tunnel(&x1, &y1, FALSE);
1825 set_tunnel(&x1, &y1, FALSE);
1829 set_tunnel(&x1, &y1, FALSE);
1834 * @brief トンネル生成処理(詳細調査中)/ This routine does the bulk of the work in creating the new types of tunnels.
1838 * It is designed to use very simple algorithms to go from (x1,y1) to (x2,y2)\n
1839 * It doesn't need to add any complexity - straight lines are fine.\n
1840 * The SOLID walls are avoided by a recursive algorithm which tries random ways\n
1841 * around the obstical until it works. The number of itterations is counted, and it\n
1842 * this gets too large the routine exits. This should stop any crashes - but may leave\n
1843 * small gaps in the tunnel where there are too many SOLID walls.\n
1845 * Type 1 tunnels are extremely simple - straight line from A to B. This is only used\n
1846 * as a part of the dodge SOLID walls algorithm.\n
1848 * Type 2 tunnels are made of two straight lines at right angles. When this is used with\n
1849 * short line segments it gives the "cavelike" tunnels seen deeper in the dungeon.\n
1851 * Type 3 tunnels are made of two straight lines like type 2, but with extra rock removed.\n
1852 * This, when used with longer line segments gives the "catacomb-like" tunnels seen near\n
1855 static void short_seg_hack(POSITION x1, POSITION y1, POSITION x2, POSITION y2, int type, int count, bool *fail)
1861 /* Check for early exit */
1862 if (!(*fail)) return;
1864 length = distance(x1, y1, x2, y2);
1868 if ((type == 1) && (length != 0))
1871 for (i = 0; i <= length; i++)
1873 x = x1 + i * (x2 - x1) / length;
1874 y = y1 + i * (y2 - y1) / length;
1875 if (!set_tunnel(&x, &y, TRUE))
1879 /* This isn't working - probably have an infinite loop */
1884 /* solid wall - so try to go around */
1885 short_seg_hack(x, y, x1 + (i - 1) * (x2 - x1) / length, y1 + (i - 1) * (y2 - y1) / length, 1, count, fail);
1886 short_seg_hack(x, y, x1 + (i + 1) * (x2 - x1) / length, y1 + (i + 1) * (y2 - y1) / length, 1, count, fail);
1890 else if ((type == 2) || (type == 3))
1894 for (i = x1; i <= x2; i++)
1898 if (!set_tunnel(&x, &y, TRUE))
1900 /* solid wall - so try to go around */
1901 short_seg_hack(x, y, i - 1, y1, 1, count, fail);
1902 short_seg_hack(x, y, i + 1, y1, 1, count, fail);
1904 if ((type == 3) && ((x + y) % 2))
1906 create_cata_tunnel(i, y1);
1912 for (i = x2; i <= x1; i++)
1916 if (!set_tunnel(&x, &y, TRUE))
1918 /* solid wall - so try to go around */
1919 short_seg_hack(x, y, i - 1, y1, 1, count, fail);
1920 short_seg_hack(x, y, i + 1, y1, 1, count, fail);
1922 if ((type == 3) && ((x + y) % 2))
1924 create_cata_tunnel(i, y1);
1931 for (i = y1; i <= y2; i++)
1935 if (!set_tunnel(&x, &y, TRUE))
1937 /* solid wall - so try to go around */
1938 short_seg_hack(x, y, x2, i - 1, 1, count, fail);
1939 short_seg_hack(x, y, x2, i + 1, 1, count, fail);
1941 if ((type == 3) && ((x + y) % 2))
1943 create_cata_tunnel(x2, i);
1949 for (i = y2; i <= y1; i++)
1953 if (!set_tunnel(&x, &y, TRUE))
1955 /* solid wall - so try to go around */
1956 short_seg_hack(x, y, x2, i - 1, 1, count, fail);
1957 short_seg_hack(x, y, x2, i + 1, 1, count, fail);
1959 if ((type == 3) && ((x + y) % 2))
1961 create_cata_tunnel(x2, i);
1970 * @brief 特定の壁(永久壁など)を避けながら部屋間の通路を作成する / This routine maps a path from (x1, y1) to (x2, y2) avoiding SOLID walls.
1974 * Permanent rock is ignored in this path finding- sometimes there is no\n
1975 * path around anyway -so there will be a crash if we try to find one.\n
1976 * This routine is much like the river creation routine in Zangband.\n
1977 * It works by dividing a line segment into two. The segments are divided\n
1978 * until they are less than "cutoff" - when the corresponding routine from\n
1979 * "short_seg_hack" is called.\n
1980 * Note it is VERY important that the "stop if hit another passage" logic\n
1981 * stays as is. Without this the dungeon turns into Swiss Cheese...\n
1983 bool build_tunnel2(POSITION x1, POSITION y1, POSITION x2, POSITION y2, int type, int cutoff)
1985 POSITION x3, y3, dx, dy;
1986 POSITION changex, changey;
1989 bool retval, firstsuccede;
1992 length = distance(x1, y1, x2, y2);
1994 if (length > cutoff)
1997 * Divide path in half and call routine twice.
2002 /* perturbation perpendicular to path */
2003 changex = (randint0(abs(dy) + 2) * 2 - abs(dy) - 1) / 2;
2004 changey = (randint0(abs(dx) + 2) * 2 - abs(dx) - 1) / 2;
2006 /* Work out "mid" ponit */
2007 x3 = x1 + dx + changex;
2008 y3 = y1 + dy + changey;
2010 /* See if in bounds - if not - do not perturb point */
2011 if (!in_bounds(y3, x3))
2017 c_ptr = &cave[y3][x3];
2018 if (is_solid_grid(c_ptr))
2020 /* move midpoint a bit to avoid problem. */
2026 while ((i > 0) && is_solid_bold(y3 + dy, x3 + dx))
2028 dy = randint0(3) - 1;
2029 dx = randint0(3) - 1;
2030 if (!in_bounds(y3 + dy, x3 + dx))
2040 /* Failed for some reason: hack - ignore the solidness */
2041 place_outer_bold(y3, x3);
2047 c_ptr = &cave[y3][x3];
2050 if (is_floor_grid(c_ptr))
2052 if (build_tunnel2(x1, y1, x3, y3, type, cutoff))
2054 if ((cave[y3][x3].info & CAVE_ROOM) || (randint1(100) > 95))
2056 /* do second half only if works + if have hit a room */
2057 retval = build_tunnel2(x3, y3, x2, y2, type, cutoff);
2061 /* have hit another tunnel - make a set of doors here */
2064 /* Save the door location */
2065 if (dun->door_n < DOOR_MAX)
2067 dun->door[dun->door_n].y = (POSITION)y3;
2068 dun->door[dun->door_n].x = (POSITION)x3;
2073 firstsuccede = TRUE;
2077 /* false- didn't work all the way */
2079 firstsuccede = FALSE;
2084 /* tunnel through walls */
2085 if (build_tunnel2(x1, y1, (POSITION)x3, (POSITION)y3, type, cutoff))
2087 retval = build_tunnel2((POSITION)x3, (POSITION)y3, x2, y2, type, cutoff);
2088 firstsuccede = TRUE;
2092 /* false- didn't work all the way */
2094 firstsuccede = FALSE;
2099 /* only do this if the first half has worked */
2100 set_tunnel(&x3, &y3, TRUE);
2102 /* return value calculated above */
2107 /* Do a short segment */
2109 short_seg_hack(x1, y1, x2, y2, type, 0, &retval);
2111 /* Hack - ignore return value so avoid infinite loops */