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.9 by root, Sat Jan 27 02:19:37 2007 UTC vs.
Revision 1.22 by root, Sun Aug 22 20:23:07 2010 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 (C) 2005, 2006, 2007 Marc Lehmann & Crossfire+ Development Team 4 * Copyright (©) 2005,2006,2007,2008,2009,2010 Marc Alexander Lehmann / Robin Redeker / the Deliantra team
5 * Copyright (C) 2001 Mark Wedel & Crossfire Development Team 5 * Copyright (©) 2001 Mark Wedel & Crossfire Development Team
6 * Copyright (C) 1992 Frank Tore Johansen 6 * Copyright (©) 1992 Frank Tore Johansen
7 * 7 *
8 * 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
9 * 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
10 * the Free Software Foundation; either version 2 of the License, or 10 * Free Software Foundation, either version 3 of the License, or (at your
11 * (at your option) any later version. 11 * 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,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
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 Affero GNU General Public License
19 * 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
20 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA. 20 * <http://www.gnu.org/licenses/>.
21 * 21 *
22 * The authors can be reached via e-mail at <crossfire@schmorp.de> 22 * The authors can be reached via e-mail to <support@deliantra.net>
23 */ 23 */
24 24
25
26/* peterm@langmuir.eecs.berkeley.edu: this function generates a random 25/* peterm@langmuir.eecs.berkeley.edu: this function generates a random
27snake-type layout. 26snake-type maze.
28 27
29input: xsize, ysize; 28input: xsize, ysize;
30output: a char** array with # and . for closed and open respectively. 29output: a char** array with # and . for closed and open respectively.
31 30
32a char value of 0 represents a blank space: a '#' is 31a char value of 0 represents a blank space: a '#' is
33a wall. 32a wall.
34 33
35*/ 34*/
36 35
36#include <global.h>
37 37
38#include <stdio.h>
39#include <global.h>
40#include <time.h>
41
42#include <maze_gen.h>
43#include <room_gen.h> 38#include <rmg.h>
44#include <random_map.h>
45#include <sproto.h>
46#include <rproto.h> 39#include "rproto.h"
47
48
49char **map_gen_onion (int xsize, int ysize, int option, int layers);
50
51 40
52/* These are some helper functions which help with 41/* These are some helper functions which help with
53 manipulating a centered onion and turning it into 42 manipulating a centered onion and turning it into
54 a square spiral */ 43 a square spiral */
44void
45make_square_spiral_layout (layout &maze, int options)
46{
47 /* generate and allocate a doorless, centered onion */
48 map_gen_onion (maze, RMOPT_CENTERED | RMOPT_NO_DOORS, 0);
55 49
56/* this starts from within a centered onion layer (or between two layers), 50 int xsize = maze.w;
57 and looks up until it finds a wall, and then looks right until it 51 int ysize = maze.h;
58 finds a vertical wall, i.e., the corner. It sets cx and cy to that.
59 it also starts from cx and cy. */
60 52
61void
62find_top_left_corner (char **maze, int *cx, int *cy)
63{
64 --(*cy);
65
66 /* find the top wall. */
67 while (maze[*cx][*cy] == 0)
68 --(*cy);
69
70 /* proceed right until a corner is detected */
71 while (maze[*cx][*cy + 1] == 0)
72 ++(*cx);
73
74 /* cx and cy should now be the top-right corner of the onion layer */
75}
76
77
78char **
79make_square_spiral_layout (int xsize, int ysize, int options)
80{
81 int i, j;
82 int cx, cy;
83 int tx, ty;
84
85 /* generate and allocate a doorless, centered onion */
86 char **maze = map_gen_onion (xsize, ysize, RMOPT_CENTERED | RMOPT_NO_DOORS, 0);
87
88 /* find the layout center. */ 53 /* find the maze center. */
89 cx = 0; 54 int cx = 0;
90 cy = 0; 55 int cy = 0;
91 for (i = 0; i < xsize; i++) 56 for (int i = 0; i < xsize; i++)
92 for (j = 0; j < ysize; j++) 57 for (int j = 0; j < ysize; j++)
93 if (maze[i][j] == 'C') 58 if (maze[i][j] == 'C')
94 { 59 {
95 cx = i; 60 cx = i;
96 cy = j; 61 cy = j;
62 break;
97 } 63 }
98 64
99 tx = cx; 65 int tx = cx;
100 ty = cy; 66 int ty = cy;
101 for (;;) 67 for (;;)
102 { 68 {
103 find_top_left_corner (maze, &tx, &ty); 69 /* this starts from within a centered onion layer (or between two layers),
70 and looks up until it finds a wall, and then looks right until it
71 finds a vertical wall, i.e., the corner. It sets tx and ty to that.
72 it also starts from tx and ty. */
73 --ty;
104 74
75 /* find the top wall. */
76 while (maze[tx][ty] != '#')
77 --ty;
78
79 /* proceed right until a corner is detected */
80 while (maze[tx][ty + 1] != '#')
81 ++tx;
82
83 /* tx and ty should now be the top-right corner of the onion layer */
105 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2) 84 if (ty < 2 || tx < 2 || tx > xsize - 2 || ty > ysize - 2)
106 break; 85 break;
107 86
108 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */ 87 make_wall (maze, tx, ty - 1, 1); /* make a vertical wall with a door */
109 88
110 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */ 89 maze[tx][ty - 1] = '#'; /* convert the door that make_wall puts here to a wall */
111 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */ 90 maze[tx - 1][ty] = 'D'; /* make a doorway out of this layer */
112 91
113 /* walk left until we find the top-left corner */ 92 /* walk left until we find the top-left corner */
114 while ((tx > 2) && maze[tx - 1][ty]) 93 while (tx > 2 && maze[tx - 1][ty])
115 tx--; 94 --tx;
116 95
117 make_wall (maze, tx - 1, ty, 0); /* make a horizontal wall with a door */ 96 make_wall (maze, tx - 1, ty, 0); /* make a horizontal wall with a door */
118 97
119 /* walk down until we find the bottom-left corner */ 98 /* walk down until we find the bottom-left corner */
120 while (((ty + 1) < ysize) && maze[tx][ty + 1]) 99 while (ty + 1 < ysize && maze[tx][ty + 1])
121 ty++; 100 ++ty;
122 101
123 make_wall (maze, tx, ty + 1, 1); /* make a vertical wall with a door */ 102 make_wall (maze, tx, ty + 1, 1); /* make a vertical wall with a door */
124 103
125 /* walk rightuntil we find the bottom-right corner */ 104 /* walk rightuntil we find the bottom-right corner */
126 while (((tx + 1) < xsize) && maze[tx + 1][ty]) 105 while (tx + 1 < xsize && maze[tx + 1][ty])
127 tx++; 106 ++tx;
128 107
129 make_wall (maze, tx + 1, ty, 0); /* make a horizontal wall with a door */ 108 make_wall (maze, tx + 1, ty, 0); /* make a horizontal wall with a door */
130 tx++; /* set up for next layer. */ 109 ++tx; /* set up for next layer. */
131 } 110 }
132 111
133 /* place the exits. */ 112 /* place the exits. */
134 113
135 if (rndm (2)) 114 if (rmg_rndm (2))
136 { 115 {
137 maze[cx][cy] = '>'; 116 maze[cx][cy] = '>';
138 maze[xsize - 2][1] = '<'; 117 maze[xsize - 2][1] = '<';
139 } 118 }
140 else 119 else
141 { 120 {
142 maze[cx][cy] = '<'; 121 maze[cx][cy] = '<';
143 maze[xsize - 2][1] = '>'; 122 maze[xsize - 2][1] = '>';
144 } 123 }
145
146 return maze;
147} 124}
148 125

Diff Legend

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