ViewVC Help
View File | Revision Log | Show Annotations | Download File
/cvs/deliantra/server/random_maps/square_spiral.C
(Generate patch)

Comparing deliantra/server/random_maps/square_spiral.C (file contents):
Revision 1.10 by root, Sun Jul 1 05:00:19 2007 UTC vs.
Revision 1.15 by root, Tue Apr 15 18:43:11 2008 UTC

1/* 1/*
2 * This file is part of Crossfire TRT, the Roguelike Realtime MORPG. 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 * 3 *
4 * Copyright (©) 2005,2006,2007 Marc Alexander Lehmann / Robin Redeker / the Crossfire TRT team 4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team
6 * Copyright (©) 1992,2007 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
7 * 7 *
8 * Crossfire TRT is free software: you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by 9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or 10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version. 11 * (at your option) any later version.
12 * 12 *
13 * This program is distributed in the hope that it will be useful, 13 * This program is distributed in the hope that it will be useful,
… …
16 * GNU General Public License for more details. 16 * GNU General Public License for more details.
17 * 17 *
18 * You should have received a copy of the GNU General Public License 18 * You should have received a copy of the GNU General Public License
19 * along with this program. If not, see <http://www.gnu.org/licenses/>. 19 * along with this program. If not, see <http://www.gnu.org/licenses/>.
20 * 20 *
21 * The authors can be reached via e-mail to <crossfire@schmorp.de> 21 * The authors can be reached via e-mail to <support@deliantra.net>
22 */ 22 */
23 23
24/* peterm@langmuir.eecs.berkeley.edu: this function generates a random 24/* peterm@langmuir.eecs.berkeley.edu: this function generates a random
25snake-type layout. 25snake-type layout.
26 26
… …
30a char value of 0 represents a blank space: a '#' is 30a char value of 0 represents a blank space: a '#' is
31a wall. 31a wall.
32 32
33*/ 33*/
34 34
35#include <global.h>
35 36
36#include <stdio.h>
37#include <global.h>
38#include <time.h>
39
40#include <maze_gen.h>
41#include <room_gen.h>
42#include <random_map.h> 37#include "random_map.h"
43#include <sproto.h>
44#include <rproto.h> 38#include "rproto.h"
45
46
47char **map_gen_onion (int xsize, int ysize, int option, int layers);
48
49 39
50/* These are some helper functions which help with 40/* These are some helper functions which help with
51 manipulating a centered onion and turning it into 41 manipulating a centered onion and turning it into
52 a square spiral */ 42 a square spiral */
43void
44make_square_spiral_layout (Layout maze, int options)
45{
46 /* generate and allocate a doorless, centered onion */
47 map_gen_onion (maze, RMOPT_CENTERED | RMOPT_NO_DOORS, 0);
53 48
54/* this starts from within a centered onion layer (or between two layers), 49 int xsize = maze->w;
55 and looks up until it finds a wall, and then looks right until it 50 int ysize = maze->h;
56 finds a vertical wall, i.e., the corner. It sets cx and cy to that.
57 it also starts from cx and cy. */
58
59void
60find_top_left_corner (char **maze, int *cx, int *cy)
61{
62 --(*cy);
63
64 /* find the top wall. */
65 while (maze[*cx][*cy] == 0)
66 --(*cy);
67
68 /* proceed right until a corner is detected */
69 while (maze[*cx][*cy + 1] == 0)
70 ++(*cx);
71
72 /* cx and cy should now be the top-right corner of the onion layer */
73}
74
75
76char **
77make_square_spiral_layout (int xsize, int ysize, int options)
78{
79 int i, j;
80 int cx, cy;
81 int tx, ty;
82
83 /* generate and allocate a doorless, centered onion */
84 char **maze = map_gen_onion (xsize, ysize, RMOPT_CENTERED | RMOPT_NO_DOORS, 0);
85 51
86 /* find the layout center. */ 52 /* find the layout center. */
87 cx = 0; 53 int cx = 0;
88 cy = 0; 54 int cy = 0;
89 for (i = 0; i < xsize; i++) 55 for (int i = 0; i < xsize; i++)
90 for (j = 0; j < ysize; j++) 56 for (int j = 0; j < ysize; j++)
91 if (maze[i][j] == 'C') 57 if (maze[i][j] == 'C')
92 { 58 {
93 cx = i; 59 cx = i;
94 cy = j; 60 cy = j;
61 break;
95 } 62 }
96 63
97 tx = cx; 64 int tx = cx;
98 ty = cy; 65 int ty = cy;
99 for (;;) 66 for (;;)
100 { 67 {
101 find_top_left_corner (maze, &tx, &ty); 68 /* this starts from within a centered onion layer (or between two layers),
69 and looks up until it finds a wall, and then looks right until it
70 finds a vertical wall, i.e., the corner. It sets tx and ty to that.
71 it also starts from tx and ty. */
72 --ty;
102 73
74 /* find the top wall. */
75 while (maze[tx][ty] != '#')
76 --ty;
77
78 /* proceed right until a corner is detected */
79 while (maze[tx][ty + 1] != '#')
80 ++tx;
81
82 /* tx and ty should now be the top-right corner of the onion layer */
103 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2) 83 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2)
104 break; 84 break;
105 85
106 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */ 86 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */
107 87
108 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */ 88 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */
109 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */ 89 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */
110 90
111 /* walk left until we find the top-left corner */ 91 /* walk left until we find the top-left corner */
112 while ((tx > 2) && maze[tx - 1][ty]) 92 while (tx > 2 && maze[tx - 1][ty])
113 tx--; 93 --tx;
114 94
115 make_wall (maze, tx - 1, ty, 0); /* make a horizontal wall with a door */ 95 make_wall (maze, tx - 1, ty, 0); /* make a horizontal wall with a door */
116 96
117 /* walk down until we find the bottom-left corner */ 97 /* walk down until we find the bottom-left corner */
118 while (((ty + 1) < ysize) && maze[tx][ty + 1]) 98 while (ty + 1 < ysize && maze[tx][ty + 1])
119 ty++; 99 ++ty;
120 100
121 make_wall (maze, tx, ty + 1, 1); /* make a vertical wall with a door */ 101 make_wall (maze, tx, ty + 1, 1); /* make a vertical wall with a door */
122 102
123 /* walk rightuntil we find the bottom-right corner */ 103 /* walk rightuntil we find the bottom-right corner */
124 while (((tx + 1) < xsize) && maze[tx + 1][ty]) 104 while (tx + 1 < xsize && maze[tx + 1][ty])
125 tx++; 105 ++tx;
126 106
127 make_wall (maze, tx + 1, ty, 0); /* make a horizontal wall with a door */ 107 make_wall (maze, tx + 1, ty, 0); /* make a horizontal wall with a door */
128 tx++; /* set up for next layer. */ 108 ++tx; /* set up for next layer. */
129 } 109 }
130 110
131 /* place the exits. */ 111 /* place the exits. */
132 112
133 if (rndm (2)) 113 if (rndm (2))
… …
138 else 118 else
139 { 119 {
140 maze[cx][cy] = '<'; 120 maze[cx][cy] = '<';
141 maze[xsize - 2][1] = '>'; 121 maze[xsize - 2][1] = '>';
142 } 122 }
143
144 return maze;
145} 123}
146 124

Diff Legend

– Removed lines
+ Added lines
< Changed lines
> Changed lines