server/random_maps/room_gen_spiral.C

/*
    CrossFire, A Multiplayer game for X-windows

    Copyright (C) 1994 Mark Wedel
    Copyright (C) 1992 Frank Tore Johansen

    This program is free software; you can redistribute it and/or modify
    it under the terms of the GNU General Public License as published by
    the Free Software Foundation; either version 2 of the License, or
    (at your option) any later version.

    This program is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
    GNU General Public License for more details.

    You should have received a copy of the GNU General Public License
    along with this program; if not, write to the Free Software
    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.

    The author can be reached via e-mail to mark@pyramid.com
*/


/*  The onion room generator:
Onion rooms are like this:

char **map_gen_spiral(int xsize, int ysize, int option);


*/
#include <global.h>
#include <random_map.h>

#define RANDOM_OPTIONS 0        /* Pick random options below */
#define REGULAR_SPIRAL 1        /* Regular spiral--distance increases constantly */
#define FINE_SPIRAL 2           /* uses the min. separation:  most coiling */
#define FIT_SPIRAL 4            /* scale to a rectangular region, not square */
#define MAX_SPIRAL_OPT 8        /* this should be 2x the last real option */
#include <math.h>

#ifndef MIN
# define MIN(x,y) (((x)<(y))? (x):(y))
#endif
#ifndef MAX
# define MAX(x,y) (((x)<(y))? (y):(x))
#endif

#define MINDIST 3

#define MAX_FINE .454545

extern int surround_check (char **maze, int i, int j, int xsize, int ysize);

char **
map_gen_spiral (int xsize, int ysize, int option)
{
  int i, j;
  float parm = 0;
  float x = 0, y = 0;
  int ic, jc;
  float SizeX, SizeY;
  float xscale, yscale;

  /* allocate that array, set it up */
  char **maze = (char **) calloc (sizeof (char *), xsize);

  for (i = 0; i < xsize; i++)
    {
      maze[i] = (char *) calloc (sizeof (char), ysize);
    }

  /* slightly easier to fill and then cut */
  for (i = 0; i < xsize; i++)
    for (j = 0; j < ysize; j++)
      maze[i][j] = '#';

  ic = xsize / 2;
  jc = ysize / 2;
  SizeX = xsize / 2 - 2;
  SizeY = ysize / 2 - 2;

  /* select random options if necessary */
  if (option == 0)
    {
      option = RANDOM () % MAX_SPIRAL_OPT;
    }

  /* the order in which these are evaluated matters */

  /* the following two are mutually exclusive.  
     pick one if they're both set. */
  if ((option & REGULAR_SPIRAL) && (option & FIT_SPIRAL))
    {
      /* unset REGULAR_SPIRAL half the time */
      if (RANDOM () % 2 && (option & REGULAR_SPIRAL))
        option -= REGULAR_SPIRAL;
      else
        option -= FIT_SPIRAL;
    }

  xscale = yscale = MAX_FINE;   /* fine spiral */

  /* choose the spiral pitch */
  if (!(option & FINE_SPIRAL))
    {
      float pitch = (RANDOM () % 5) / 10. + 10. / 22.;

      xscale = yscale = pitch;
    }

  if ((option & FIT_SPIRAL) && (xsize != ysize))
    {
      if (xsize > ysize)
        xscale *= (float) xsize / (float) ysize;
      else
        yscale *= (float) ysize / (float) xsize;
    }

  if (option & REGULAR_SPIRAL)
    {
      float scale = MIN (xscale, yscale);

      xscale = yscale = scale;
    }

  /* cut out the spiral */
  while ((fabs (x) < SizeX) && (fabs (y) < SizeY))
    {
      x = parm * cos (parm) * xscale;
      y = parm * sin (parm) * yscale;
      maze[(int) (ic + x)][(int) (jc + y)] = '\0';
      parm += 0.01;
    };

  maze[(int) (ic + x + 0.5)][(int) (jc + y + 0.5)] = '<';


  /* cut out the center in a 2x2 and place the center and downexit */
  maze[ic][jc + 1] = '>';
  maze[ic][jc] = 'C';


  return maze;
}

/* the following function connects disjoint spirals which may
   result from the symmetrization process. */
void
connect_spirals (int xsize, int ysize, int sym, char **layout)
{

  int i, j, ic = xsize / 2, jc = ysize / 2;

  if (sym == X_SYM)
    {
      layout[ic][jc] = 0;
      /* go left from map center */
      for (i = ic - 1, j = jc; i > 0 && layout[i][j] == '#'; i--)
        layout[i][j] = 0;
      /* go right */
      for (i = ic + 1, j = jc; i < xsize - 1 && layout[i][j] == '#'; i++)
        layout[i][j] = 0;
    }

  if (sym == Y_SYM)
    {

      layout[ic][jc] = 0;
      /* go up */
      for (i = ic, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
        layout[i][j] = 0;
      /* go down */
      for (i = ic, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
        layout[i][j] = 0;
    }

  if (sym == XY_SYM)
    {
      /* go left from map center */
      layout[ic][jc / 2] = 0;
      layout[ic / 2][jc] = 0;
      layout[ic][jc / 2 + jc] = 0;
      layout[ic / 2 + ic][jc] = 0;
      for (i = ic - 1, j = jc / 2; i > 0 && layout[i][j] == '#'; i--)
        {
          layout[i][j + jc] = 0;
          layout[i][j] = 0;
        }
      /* go right */
      for (i = ic + 1, j = jc / 2; i < xsize - 1 && layout[i][j] == '#'; i++)
        {
          layout[i][j + jc] = 0;
          layout[i][j] = 0;
        }
      /* go up */
      for (i = ic / 2, j = jc - 1; j > 0 && layout[i][j] == '#'; j--)
        {
          layout[i][j] = 0;
          layout[i + ic][j] = 0;
        }
      /* go down */
      for (i = ic / 2, j = jc + 1; j < ysize - 1 && layout[i][j] == '#'; j++)
        {
          layout[i][j] = 0;
          layout[i + ic][j] = 0;
        }

    }

  /* get rid of bad doors. */
  for (i = 0; i < xsize; i++)
    for (j = 0; j < ysize; j++)
      {
        if (layout[i][j] == 'D')
          {                     /* remove bad door. */
            int si = surround_check (layout, i, j, xsize, ysize);

            if (si != 3 && si != 12)
              {
                layout[i][j] = 0;
                /* back up and recheck any nearby doors */
                i = 0;
                j = 0;
              }
          }
      }


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