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

Comparing deliantra/server/random_maps/room_gen_spiral.C (file contents):
Revision 1.1 by elmex, Sun Aug 13 17:16:03 2006 UTC vs.
Revision 1.16 by root, Mon Oct 12 14:00:58 2009 UTC

1/* 1/*
2 CrossFire, A Multiplayer game for X-windows 2 * This file is part of Deliantra, the Roguelike Realtime MMORPG.
3 3 *
4 * Copyright (©) 2005,2006,2007,2008 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
4 Copyright (C) 1994 Mark Wedel 5 * Copyright (©) 1994,2007 Mark Wedel
5 Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992,2007 Frank Tore Johansen
6 7 *
7 This program is free software; you can redistribute it and/or modify 8 * Deliantra is free software: you can redistribute it and/or modify it under
8 it under the terms of the GNU General Public License as published by 9 * the terms of the Affero GNU General Public License as published by the
9 the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
10 (at your option) any later version. 11 * option) any later version.
11 12 *
12 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,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details. 16 * GNU General Public License for more details.
16 17 *
17 You should have received a copy of the GNU General Public License 18 * You should have received a copy of the Affero GNU General Public License
18 along with this program; if not, write to the Free Software 19 * and the GNU General Public License along with this program. If not, see
19 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
20 21 *
21 The author can be reached via e-mail to mark@pyramid.com 22 * The authors can be reached via e-mail to <support@deliantra.net>
22*/ 23 */
23
24 24
25/* The onion room generator: 25/* The onion room generator:
26Onion rooms are like this: 26Onion rooms are like this:
27 27
28char **map_gen_spiral(int xsize, int ysize, int option); 28char **map_gen_spiral(int xsize, int ysize, int option);
29
30
31*/ 29*/
30
32#include <global.h> 31#include <global.h>
33#include <random_map.h> 32#include <random_map.h>
34 33
35#define RANDOM_OPTIONS 0 /* Pick random options below */ 34#define RANDOM_OPTIONS 0 /* Pick random options below */
36#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly*/ 35#define REGULAR_SPIRAL 1 /* Regular spiral--distance increases constantly */
37#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */ 36#define FINE_SPIRAL 2 /* uses the min. separation: most coiling */
38#define FIT_SPIRAL 4 /* scale to a rectangular region, not square */ 37#define FIT_SPIRAL 4 /* scale to a rectangular region, not square */
39#define MAX_SPIRAL_OPT 8 /* this should be 2x the last real option */ 38#define MAX_SPIRAL_OPT 8 /* this should be 2x the last real option */
40#include <math.h> 39#include <math.h>
41 40
42#ifndef MIN 41#ifndef MIN
43#define MIN(x,y) (((x)<(y))? (x):(y)) 42# define MIN(x,y) (((x)<(y))? (x):(y))
44#endif 43#endif
45#ifndef MAX 44#ifndef MAX
46#define MAX(x,y) (((x)<(y))? (y):(x)) 45# define MAX(x,y) (((x)<(y))? (y):(x))
47#endif 46#endif
48 47
49#define MINDIST 3 48#define MINDIST 3
50 49
51#define MAX_FINE .454545 50#define MAX_FINE .454545
52 51
53extern int surround_check(char **maze,int i, int j, int xsize, int ysize); 52extern int surround_check (char **maze, int i, int j, int xsize, int ysize);
54 53
55char **map_gen_spiral(int xsize, int ysize, int option) { 54void
55map_gen_spiral (Layout maze, int option)
56{
56 int i,j; 57 int i, j;
57 float parm=0; 58 float parm = 0;
58 float x=0,y=0; 59 float x = 0, y = 0;
59 int ic,jc; 60 int ic, jc;
60 float SizeX,SizeY; 61 float SizeX, SizeY;
61 float xscale,yscale; 62 float xscale, yscale;
62
63 /* allocate that array, set it up */
64 char **maze = (char **)calloc(sizeof(char*),xsize);
65 for(i=0;i<xsize;i++) {
66 maze[i] = (char *) calloc(sizeof(char),ysize);
67 }
68 63
69 /* slightly easier to fill and then cut */ 64 /* slightly easier to fill and then cut */
70 for(i=0;i<xsize;i++) for(j=0;j<ysize;j++) maze[i][j] = '#'; 65 maze->clear ('#');
71 66
67 int xsize = maze->w;
68 int ysize = maze->h;
69
72 ic = xsize/2; 70 ic = xsize / 2;
73 jc = ysize/2; 71 jc = ysize / 2;
74 SizeX = xsize/2 - 2; 72 SizeX = xsize / 2 - 2;
75 SizeY = ysize/2 -2; 73 SizeY = ysize / 2 - 2;
76 74
77 /* select random options if necessary */ 75 /* select random options if necessary */
78 if(option==0) { 76 if (option == 0)
79 option=RANDOM()%MAX_SPIRAL_OPT; 77 option = rmg_rndm (MAX_SPIRAL_OPT);
80 }
81 78
82 /* the order in which these are evaluated matters*/ 79 /* the order in which these are evaluated matters */
83 80
84 /* the following two are mutually exclusive. 81 /* the following two are mutually exclusive.
85 pick one if they're both set. */ 82 pick one if they're both set. */
86 if((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL)) 83 if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
87 { 84 {
88 /* unset REGULAR_SPIRAL half the time */ 85 /* unset REGULAR_SPIRAL half the time */
89 if(RANDOM()%2 && (option & REGULAR_SPIRAL)) 86 if (rmg_rndm (2) && (option & REGULAR_SPIRAL))
90 option -= REGULAR_SPIRAL; 87 option -= REGULAR_SPIRAL;
91 else 88 else
92 option -= FIT_SPIRAL; 89 option -= FIT_SPIRAL;
93 } 90 }
94 91
95 xscale=yscale=MAX_FINE; /* fine spiral */ 92 xscale = yscale = MAX_FINE; /* fine spiral */
96 93
97 /* choose the spiral pitch */ 94 /* choose the spiral pitch */
98 if(! (option & FINE_SPIRAL) ) { 95 if (!(option & FINE_SPIRAL))
99 float pitch = (RANDOM() %5)/10. + 10./22.; 96 {
97 float pitch = (rmg_rndm (5)) / 10. + 10. / 22.;
98
100 xscale=yscale=pitch; 99 xscale = yscale = pitch;
101 } 100 }
102 101
103 if((option & FIT_SPIRAL) && (xsize!=ysize) ) { 102 if ((option & FIT_SPIRAL) && (xsize != ysize))
103 {
104 if (xsize > ysize)
104 if(xsize > ysize) xscale *= (float)xsize/(float)ysize; 105 xscale *= (float) xsize / (float) ysize;
106 else
105 else yscale *= (float)ysize/(float)xsize; 107 yscale *= (float) ysize / (float) xsize;
106 } 108 }
107 109
108 if(option & REGULAR_SPIRAL) { 110 if (option & REGULAR_SPIRAL)
111 {
109 float scale = MIN(xscale,yscale); 112 float scale = MIN (xscale, yscale);
113
110 xscale=yscale=scale; 114 xscale = yscale = scale;
111 } 115 }
112 116
113 /* cut out the spiral */ 117 /* cut out the spiral */
114 while( (fabs(x) < SizeX) && (fabs(y) < SizeY) ) 118 while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
115 { 119 {
116 x = parm * cos(parm)*xscale; 120 x = parm * cos (parm) * xscale;
117 y = parm * sin(parm)*yscale; 121 y = parm * sin (parm) * yscale;
118 maze[(int)(ic + x )][(int)(jc + y )]='\0'; 122 maze[int (ic + x)][int (jc + y)] = '\0';
119 parm+=0.01; 123 parm += 0.01;
120 }; 124 }
121 125
122maze[(int)(ic + x+0.5)][(int)(jc + y+0.5)]='<'; 126 maze[int (ic + x + 0.5)][int (jc + y + 0.5)] = '<';
123
124 127
125 /* cut out the center in a 2x2 and place the center and downexit */ 128 /* cut out the center in a 2x2 and place the center and downexit */
126 maze[ic][jc+1]='>'; 129 maze[ic][jc + 1] = '>';
127 maze[ic][jc]='C'; 130 maze[ic][jc] = 'C';
128
129
130 return maze;
131} 131}
132 132
133/* the following function connects disjoint spirals which may 133/* the following function connects disjoint spirals which may
134 result from the symmetrization process. */ 134 result from the symmetrization process. */
135void
135void connect_spirals(int xsize,int ysize,int sym, char **layout) { 136connect_spirals (int xsize, int ysize, int sym, char **layout)
136 137{
137 int i,j,ic=xsize/2,jc=ysize/2; 138 int i, j, ic = xsize / 2, jc = ysize / 2;
138 139
139 if(sym==X_SYM) { 140 if (sym == SYMMETRY_X)
141 {
140 layout[ic][jc] = 0; 142 layout[ic][jc] = 0;
143
141 /* go left from map center */ 144 /* go left from map center */
142 for(i=ic-1,j=jc; i>0 && layout[i][j]=='#' ;i--) 145 for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
143 layout[i][j]=0; 146 layout[i][j] = 0;
147
144 /* go right */ 148 /* go right */
145 for(i=ic+1,j=jc; i<xsize-1 && layout[i][j]=='#' ;i++) 149 for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
146 layout[i][j]=0; 150 layout[i][j] = 0;
147 } 151 }
148 152
149 if(sym==Y_SYM) { 153 if (sym == SYMMETRY_Y)
150 154 {
151 layout[ic][jc] = 0; 155 layout[ic][jc] = 0;
156
152 /* go up */ 157 /* go up */
153 for(i=ic,j=jc-1; j>0 && layout[i][j]=='#' ;j--) 158 for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
154 layout[i][j]=0; 159 layout[i][j] = 0;
160
155 /* go down */ 161 /* go down */
156 for(i=ic,j=jc+1; j<ysize-1 && layout[i][j]=='#' ;j++) 162 for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
157 layout[i][j]=0; 163 layout[i][j] = 0;
158 } 164 }
159 165
160 if(sym==XY_SYM) { 166 if (sym == SYMMETRY_XY)
167 {
161 /* go left from map center */ 168 /* go left from map center */
162 layout[ic][jc/2]=0; 169 layout[ic][jc / 2] = 0;
163 layout[ic/2][jc]=0; 170 layout[ic / 2][jc] = 0;
164 layout[ic][jc/2+jc]=0; 171 layout[ic][jc / 2 + jc] = 0;
165 layout[ic/2+ic][jc]=0; 172 layout[ic / 2 + ic][jc] = 0;
173
166 for(i=ic-1,j=jc/2; i>0 && layout[i][j]=='#' ;i--) { 174 for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
175 {
167 layout[i][j + jc]=0; 176 layout[i][j + jc] = 0;
168 layout[i][j]=0; 177 layout[i][j] = 0;
169 } 178 }
179
170 /* go right */ 180 /* go right */
171 for(i=ic+1,j=jc/2; i<xsize-1 && layout[i][j]=='#' ;i++) { 181 for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
182 {
172 layout[i][j+jc]=0; 183 layout[i][j + jc] = 0;
173 layout[i][j]=0; 184 layout[i][j] = 0;
174 } 185 }
186
175 /* go up */ 187 /* go up */
176 for(i=ic/2,j=jc-1; j>0 && layout[i][j]=='#' ;j--) { 188 for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
189 {
177 layout[i][j]=0; 190 layout[i][j] = 0;
178 layout[i+ic][j]=0; 191 layout[i + ic][j] = 0;
179 } 192 }
193
180 /* go down */ 194 /* go down */
181 for(i=ic/2,j=jc+1; j<ysize-1 && layout[i][j]=='#' ;j++) { 195 for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
196 {
182 layout[i][j]=0; 197 layout[i][j] = 0;
183 layout[i+ic][j]=0; 198 layout[i + ic][j] = 0;
184 } 199 }
185 200
186 } 201 }
187 202
188 /* get rid of bad doors. */ 203 /* get rid of bad doors. */
189 for(i=0;i<xsize;i++) 204 for (i = 0; i < xsize; i++)
190 for(j=0;j<ysize;j++) { 205 for (j = 0; j < ysize; j++)
191 if(layout[i][j]=='D') { /* remove bad door. */ 206 {
207 if (layout[i][j] == 'D')
208 { /* remove bad door. */
192 int si = surround_check(layout,i,j,xsize,ysize); 209 int si = surround_check (layout, i, j, xsize, ysize);
210
193 if(si!=3 && si!=12) { 211 if (si != 3 && si != 12)
212 {
194 layout[i][j]=0; 213 layout[i][j] = 0;
195 /* back up and recheck any nearby doors */ 214 /* back up and recheck any nearby doors */
196 i=0;j=0; 215 i = 0;
216 j = 0;
217 }
197 } 218 }
198 } 219 }
199 }
200
201
202
203} 220}
204 221

Diff Legend

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