1 | /* |
1 | /* |
2 | * This file is part of Deliantra, the Roguelike Realtime MMORPG. |
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 (©) 2005,2006,2007,2008,2009,2010,2011 Marc Alexander Lehmann / Robin Redeker / the Deliantra team |
5 | * Copyright (©) 2001,2007 Mark Wedel & Crossfire Development Team |
5 | * Copyright (©) 2001 Mark Wedel & Crossfire Development Team |
6 | * Copyright (©) 1992,2007 Frank Tore Johansen |
6 | * Copyright (©) 1992 Frank Tore Johansen |
7 | * |
7 | * |
8 | * Deliantra 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 3 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, see <http://www.gnu.org/licenses/>. |
19 | * and the GNU General Public License along with this program. If not, see |
|
|
20 | * <http://www.gnu.org/licenses/>. |
20 | * |
21 | * |
21 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | * The authors can be reached via e-mail to <support@deliantra.net> |
22 | */ |
23 | */ |
23 | |
24 | |
24 | /* peterm@langmuir.eecs.berkeley.edu: this function generates a random |
25 | /* peterm@langmuir.eecs.berkeley.edu: this function generates a random |
25 | snake-type layout. |
26 | snake-type maze. |
26 | |
27 | |
27 | input: xsize, ysize; |
28 | input: xsize, ysize; |
28 | output: a char** array with # and . for closed and open respectively. |
29 | output: a char** array with # and . for closed and open respectively. |
29 | |
30 | |
30 | a char value of 0 represents a blank space: a '#' is |
31 | a char value of 0 represents a blank space: a '#' is |
… | |
… | |
32 | |
33 | |
33 | */ |
34 | */ |
34 | |
35 | |
35 | #include <global.h> |
36 | #include <global.h> |
36 | |
37 | |
37 | #include "random_map.h" |
38 | #include <rmg.h> |
38 | #include "rproto.h" |
39 | #include "rproto.h" |
39 | |
40 | |
40 | /* These are some helper functions which help with |
41 | /* These are some helper functions which help with |
41 | manipulating a centered onion and turning it into |
42 | manipulating a centered onion and turning it into |
42 | a square spiral */ |
43 | a square spiral */ |
43 | void |
44 | void |
44 | make_square_spiral_layout (Layout maze, int options) |
45 | make_square_spiral_layout (layout &maze, int options) |
45 | { |
46 | { |
46 | /* generate and allocate a doorless, centered onion */ |
47 | /* generate and allocate a doorless, centered onion */ |
47 | map_gen_onion (maze, RMOPT_CENTERED | RMOPT_NO_DOORS, 0); |
48 | map_gen_onion (maze, RMOPT_CENTERED | RMOPT_NO_DOORS, 0); |
48 | |
49 | |
49 | int xsize = maze->w; |
50 | int xsize = maze.w; |
50 | int ysize = maze->h; |
51 | int ysize = maze.h; |
51 | |
52 | |
52 | /* find the layout center. */ |
53 | /* find the maze center. */ |
53 | int cx = 0; |
54 | int cx = 0; |
54 | int cy = 0; |
55 | int cy = 0; |
55 | for (int i = 0; i < xsize; i++) |
56 | for (int i = 0; i < xsize; i++) |
56 | for (int j = 0; j < ysize; j++) |
57 | for (int j = 0; j < ysize; j++) |
57 | if (maze[i][j] == 'C') |
58 | if (maze[i][j] == 'C') |
… | |
… | |
108 | ++tx; /* set up for next layer. */ |
109 | ++tx; /* set up for next layer. */ |
109 | } |
110 | } |
110 | |
111 | |
111 | /* place the exits. */ |
112 | /* place the exits. */ |
112 | |
113 | |
113 | if (rndm (2)) |
114 | if (rmg_rndm (2)) |
114 | { |
115 | { |
115 | maze[cx][cy] = '>'; |
116 | maze[cx][cy] = '>'; |
116 | maze[xsize - 2][1] = '<'; |
117 | maze[xsize - 2][1] = '<'; |
117 | } |
118 | } |
118 | else |
119 | else |