<ClCompile Include="..\..\src\room\cave-filler.c" />\r
<ClCompile Include="..\..\src\room\room-generator.c" />\r
<ClCompile Include="..\..\src\room\room-info-table.c" />\r
+ <ClCompile Include="..\..\src\room\rooms-maze-vault.c" />\r
<ClCompile Include="..\..\src\room\treasure-deployment.c" />\r
<ClCompile Include="..\..\src\save\floor-writer.c" />\r
<ClCompile Include="..\..\src\save\info-writer.c" />\r
<ClInclude Include="..\..\src\room\room-generator.h" />\r
<ClInclude Include="..\..\src\room\room-info-table.h" />\r
<ClInclude Include="..\..\src\room\room-types.h" />\r
+ <ClInclude Include="..\..\src\room\rooms-maze-vault.h" />\r
<ClInclude Include="..\..\src\room\treasure-deployment.h" />\r
<ClInclude Include="..\..\src\save\floor-writer.h" />\r
<ClInclude Include="..\..\src\save\info-writer.h" />\r
<ClCompile Include="..\..\src\room\treasure-deployment.c">
<Filter>room</Filter>
</ClCompile>
+ <ClCompile Include="..\..\src\room\rooms-maze-vault.c">
+ <Filter>room</Filter>
+ </ClCompile>
</ItemGroup>
<ItemGroup>
<ClInclude Include="..\..\src\combat\shoot.h">
<ClInclude Include="..\..\src\room\treasure-deployment.h">
<Filter>room</Filter>
</ClInclude>
+ <ClInclude Include="..\..\src\room\rooms-maze-vault.h">
+ <Filter>room</Filter>
+ </ClInclude>
</ItemGroup>
<ItemGroup>
<None Include="..\..\src\wall.bmp" />
room/rooms.c room/rooms.h \
room/rooms-city.c room/rooms-city.h \
room/rooms-fractal.c room/rooms-fractal.h \
+ room/rooms-maze-vault.c room/rooms-maze-vault.h \
room/rooms-normal.c room/rooms-normal.h \
room/rooms-special.c room/rooms-special.h \
room/rooms-trap.c room/rooms-trap.h \
#include "player/player-status.h"
#include "room/lake-types.h"
#include "room/room-generator.h"
+#include "room/rooms-maze-vault.h"
#include "room/rooms.h"
#include "system/dungeon-data-definition.h"
#include "system/floor-type-definition.h"
--- /dev/null
+#include "room/rooms-maze-vault.h"
+#include "dungeon/dungeon-flag-types.h"
+#include "dungeon/dungeon.h"
+#include "game-option/cheat-types.h"
+#include "grid/grid.h"
+#include "room/treasure-deployment.h"
+#include "system/floor-type-definition.h"
+#include "wizard/wizard-messages.h"
+
+/*
+ * maze vault -- rectangular labyrinthine rooms
+ *
+ * maze vault uses two routines:
+ * r_visit - a recursive routine that builds the labyrinth
+ * build_maze_vault - a driver routine that calls r_visit and adds
+ * monsters, traps and treasure
+ *
+ * The labyrinth is built by creating a spanning tree of a graph.
+ * The graph vertices are at
+ * (x, y) = (2j + x1, 2k + y1) j = 0,...,m-1 k = 0,...,n-1
+ * and the edges are the vertical and horizontal nearest neighbors.
+ *
+ * The spanning tree is created by performing a suitably randomized
+ * depth-first traversal of the graph. The only adjustable parameter
+ * is the randint0(3) below; it governs the relative density of
+ * twists and turns in the labyrinth: smaller number, more twists.
+ */
+void r_visit(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2, int node, DIRECTION dir, int *visited)
+{
+ int adj[4];
+ int m = (x2 - x1) / 2 + 1;
+ int n = (y2 - y1) / 2 + 1;
+ visited[node] = 1;
+ int x = 2 * (node % m) + x1;
+ int y = 2 * (node / m) + y1;
+ place_bold(player_ptr, y, x, GB_FLOOR);
+
+ if (one_in_(3)) {
+ for (int i = 0; i < 4; i++)
+ adj[i] = i;
+
+ for (int i = 0; i < 4; i++) {
+ int j = randint0(4);
+ int temp = adj[i];
+ adj[i] = adj[j];
+ adj[j] = temp;
+ }
+
+ dir = adj[0];
+ } else {
+ adj[0] = dir;
+ for (int i = 1; i < 4; i++)
+ adj[i] = i;
+
+ for (int i = 1; i < 4; i++) {
+ int j = 1 + randint0(3);
+ int temp = adj[i];
+ adj[i] = adj[j];
+ adj[j] = temp;
+ }
+ }
+
+ for (int i = 0; i < 4; i++) {
+ switch (adj[i]) {
+ case 0:
+ /* (0,+) - check for bottom boundary */
+ if ((node / m < n - 1) && (visited[node + m] == 0)) {
+ place_bold(player_ptr, y + 1, x, GB_FLOOR);
+ r_visit(player_ptr, y1, x1, y2, x2, node + m, dir, visited);
+ }
+ break;
+ case 1:
+ /* (0,-) - check for top boundary */
+ if ((node / m > 0) && (visited[node - m] == 0)) {
+ place_bold(player_ptr, y - 1, x, GB_FLOOR);
+ r_visit(player_ptr, y1, x1, y2, x2, node - m, dir, visited);
+ }
+ break;
+ case 2:
+ /* (+,0) - check for right boundary */
+ if ((node % m < m - 1) && (visited[node + 1] == 0)) {
+ place_bold(player_ptr, y, x + 1, GB_FLOOR);
+ r_visit(player_ptr, y1, x1, y2, x2, node + 1, dir, visited);
+ }
+ break;
+ case 3:
+ /* (-,0) - check for left boundary */
+ if ((node % m > 0) && (visited[node - 1] == 0)) {
+ place_bold(player_ptr, y, x - 1, GB_FLOOR);
+ r_visit(player_ptr, y1, x1, y2, x2, node - 1, dir, visited);
+ }
+ }
+ }
+}
+
+void build_maze_vault(player_type *player_ptr, POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault)
+{
+ msg_print_wizard(player_ptr, CHEAT_DUNGEON, _("迷路ランダムVaultを生成しました。", "Maze Vault."));
+ floor_type *floor_ptr = player_ptr->current_floor_ptr;
+ bool light = ((floor_ptr->dun_level <= randint1(25)) && is_vault && !(d_info[floor_ptr->dungeon_idx].flags1 & DF1_DARKNESS));
+ POSITION dy = ysize / 2 - 1;
+ POSITION dx = xsize / 2 - 1;
+ POSITION y1 = y0 - dy;
+ POSITION x1 = x0 - dx;
+ POSITION y2 = y0 + dy;
+ POSITION x2 = x0 + dx;
+ for (POSITION y = y1 - 1; y <= y2 + 1; y++) {
+ for (POSITION x = x1 - 1; x <= x2 + 1; x++) {
+ grid_type *g_ptr;
+ g_ptr = &floor_ptr->grid_array[y][x];
+ g_ptr->info |= CAVE_ROOM;
+ if (is_vault)
+ g_ptr->info |= CAVE_ICKY;
+ if ((x == x1 - 1) || (x == x2 + 1) || (y == y1 - 1) || (y == y2 + 1)) {
+ place_grid(player_ptr, g_ptr, GB_OUTER);
+ } else if (!is_vault) {
+ place_grid(player_ptr, g_ptr, GB_EXTRA);
+ } else {
+ place_grid(player_ptr, g_ptr, GB_INNER);
+ }
+
+ if (light)
+ g_ptr->info |= (CAVE_GLOW);
+ }
+ }
+
+ int m = dx + 1;
+ int n = dy + 1;
+ int num_vertices = m * n;
+
+ int *visited;
+ C_MAKE(visited, num_vertices, int);
+ r_visit(player_ptr, y1, x1, y2, x2, randint0(num_vertices), 0, visited);
+ if (is_vault)
+ fill_treasure(player_ptr, x1, x2, y1, y2, randint1(5));
+
+ C_KILL(visited, num_vertices, int);
+}
--- /dev/null
+#pragma once
+
+#include "system/angband.h"
+
+void r_visit(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2, int node, DIRECTION dir, int *visited);
+void build_maze_vault(player_type *player_ptr, POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault);
#include "object-enchant/item-apply-magic.h"
#include "room/cave-filler.h"
#include "room/lake-types.h"
+#include "room/rooms-maze-vault.h"
#include "room/rooms.h"
#include "room/treasure-deployment.h"
#include "store/store-util.h"
}
/*
- * maze vault -- rectangular labyrinthine rooms
- *
- * maze vault uses two routines:
- * r_visit - a recursive routine that builds the labyrinth
- * build_maze_vault - a driver routine that calls r_visit and adds
- * monsters, traps and treasure
- *
- * The labyrinth is built by creating a spanning tree of a graph.
- * The graph vertices are at
- * (x, y) = (2j + x1, 2k + y1) j = 0,...,m-1 k = 0,...,n-1
- * and the edges are the vertical and horizontal nearest neighbors.
- *
- * The spanning tree is created by performing a suitably randomized
- * depth-first traversal of the graph. The only adjustable parameter
- * is the randint0(3) below; it governs the relative density of
- * twists and turns in the labyrinth: smaller number, more twists.
- */
-void r_visit(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2, int node, DIRECTION dir, int *visited)
-{
- int adj[4];
- int m = (x2 - x1) / 2 + 1;
- int n = (y2 - y1) / 2 + 1;
- visited[node] = 1;
- int x = 2 * (node % m) + x1;
- int y = 2 * (node / m) + y1;
- place_bold(player_ptr, y, x, GB_FLOOR);
-
- if (one_in_(3)) {
- for (int i = 0; i < 4; i++)
- adj[i] = i;
-
- for (int i = 0; i < 4; i++) {
- int j = randint0(4);
- int temp = adj[i];
- adj[i] = adj[j];
- adj[j] = temp;
- }
-
- dir = adj[0];
- } else {
- adj[0] = dir;
- for (int i = 1; i < 4; i++)
- adj[i] = i;
-
- for (int i = 1; i < 4; i++) {
- int j = 1 + randint0(3);
- int temp = adj[i];
- adj[i] = adj[j];
- adj[j] = temp;
- }
- }
-
- for (int i = 0; i < 4; i++) {
- switch (adj[i]) {
- case 0:
- /* (0,+) - check for bottom boundary */
- if ((node / m < n - 1) && (visited[node + m] == 0)) {
- place_bold(player_ptr, y + 1, x, GB_FLOOR);
- r_visit(player_ptr, y1, x1, y2, x2, node + m, dir, visited);
- }
- break;
- case 1:
- /* (0,-) - check for top boundary */
- if ((node / m > 0) && (visited[node - m] == 0)) {
- place_bold(player_ptr, y - 1, x, GB_FLOOR);
- r_visit(player_ptr, y1, x1, y2, x2, node - m, dir, visited);
- }
- break;
- case 2:
- /* (+,0) - check for right boundary */
- if ((node % m < m - 1) && (visited[node + 1] == 0)) {
- place_bold(player_ptr, y, x + 1, GB_FLOOR);
- r_visit(player_ptr, y1, x1, y2, x2, node + 1, dir, visited);
- }
- break;
- case 3:
- /* (-,0) - check for left boundary */
- if ((node % m > 0) && (visited[node - 1] == 0)) {
- place_bold(player_ptr, y, x - 1, GB_FLOOR);
- r_visit(player_ptr, y1, x1, y2, x2, node - 1, dir, visited);
- }
- }
- }
-}
-
-void build_maze_vault(player_type *player_ptr, POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault)
-{
- msg_print_wizard(player_ptr, CHEAT_DUNGEON, _("迷路ランダムVaultを生成しました。", "Maze Vault."));
- floor_type *floor_ptr = player_ptr->current_floor_ptr;
- bool light = ((floor_ptr->dun_level <= randint1(25)) && is_vault && !(d_info[floor_ptr->dungeon_idx].flags1 & DF1_DARKNESS));
- POSITION dy = ysize / 2 - 1;
- POSITION dx = xsize / 2 - 1;
- POSITION y1 = y0 - dy;
- POSITION x1 = x0 - dx;
- POSITION y2 = y0 + dy;
- POSITION x2 = x0 + dx;
- for (POSITION y = y1 - 1; y <= y2 + 1; y++) {
- for (POSITION x = x1 - 1; x <= x2 + 1; x++) {
- grid_type *g_ptr;
- g_ptr = &floor_ptr->grid_array[y][x];
- g_ptr->info |= CAVE_ROOM;
- if (is_vault)
- g_ptr->info |= CAVE_ICKY;
- if ((x == x1 - 1) || (x == x2 + 1) || (y == y1 - 1) || (y == y2 + 1)) {
- place_grid(player_ptr, g_ptr, GB_OUTER);
- } else if (!is_vault) {
- place_grid(player_ptr, g_ptr, GB_EXTRA);
- } else {
- place_grid(player_ptr, g_ptr, GB_INNER);
- }
-
- if (light)
- g_ptr->info |= (CAVE_GLOW);
- }
- }
-
- int m = dx + 1;
- int n = dy + 1;
- int num_vertices = m * n;
-
- int *visited;
- C_MAKE(visited, num_vertices, int);
- r_visit(player_ptr, y1, x1, y2, x2, randint0(num_vertices), 0, visited);
- if (is_vault)
- fill_treasure(player_ptr, x1, x2, y1, y2, randint1(5));
-
- 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.
void build_lake(player_type *player_ptr, int type);
void build_cavern(player_type *player_ptr);
-void build_maze_vault(player_type *player_ptr, POSITION x0, POSITION y0, POSITION xsize, POSITION ysize, bool is_vault);
bool find_space(player_type *player_ptr, POSITION *y, POSITION *x, POSITION height, POSITION width);
void build_small_room(player_type *player_ptr, POSITION x0, POSITION y0);
void add_outer_wall(player_type *player_ptr, POSITION x, POSITION y, int light, POSITION x1, POSITION y1, POSITION x2, POSITION y2);
POSITION dist2(POSITION x1, POSITION y1, POSITION x2, POSITION y2, POSITION h1, POSITION h2, POSITION h3, POSITION h4);
void build_recursive_room(player_type *player_ptr, POSITION x1, POSITION y1, POSITION x2, POSITION y2, int power);
void build_room(player_type *player_ptr, POSITION x1, POSITION x2, POSITION y1, POSITION y2);
-void r_visit(player_type *player_ptr, POSITION y1, POSITION x1, POSITION y2, POSITION x2, int node, DIRECTION dir, int *visited);
OSDN Git Service
