2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2020, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure, Markus Armbruster
6 * Empire is free software: you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation, either version 3 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program. If not, see <http://www.gnu.org/licenses/>.
21 * See files README, COPYING and CREDITS in the root of the source
22 * tree for related information and legal notices. It is expected
23 * that future projects/authors will amend these files as needed.
27 * fairland.c: Create a nice, new world
29 * Known contributors to this file:
32 * Markus Armbruster, 2004-2020
40 * Place the capitals on the torus in such a way so as to maximize
41 * their distances from one another. This uses the perturbation
42 * technique of calculus of variations.
44 * 2. Grow start islands ("continents")
46 * For all continents, add the first sector at the capital's location,
47 * and the second right to it. These are the capital sectors. Then
48 * add one sector to each continent in turn, until they have the
51 * Growth uses weighted random sampling to pick one sector from the
52 * set of adjacent sea sectors that aren't too close to another
53 * continent. Growth operates in spiking mode with a chance given by
54 * the spike percentage. When "spiking", a sector's weight increases
55 * with number of adjacent sea sectors. This directs the growth away
56 * from land, resulting in spikes. When not spiking, the weight
57 * increases with the number of adjacent land sectors. This makes the
58 * island more rounded.
60 * If growing fails due to lack of room, start over. If it fails too
61 * many times, give up and terminate unsuccessfully.
63 * 3. Place and grow additional islands
65 * Each continent has a "sphere of influence": the set of sectors
66 * closer to it than to any other continent. Each island is entirely
67 * in one such sphere, and each sphere contains the same number of
68 * islands with the same sizes.
70 * First, split the specified number of island sectors per continent
71 * randomly into the island sizes. Sort by size so that larger
72 * islands are grown before smaller ones, to give the large ones the
73 * best chance to grow to their planned size.
75 * Then place one island's first sector into each sphere, using
76 * weighted random sampling with weights favoring sectors away from
77 * land and other spheres. Add one sector to each island in turn,
78 * until they have the intended size. Repeat until the specified
79 * number of islands has been grown.
81 * If placement fails due to lack of room, start over, just like for
84 * Growing works as for continents, except the minimum distance for
85 * additional islands applies, and growing simply stops when any of
86 * the islands being grown lacks the room to grow further. The number
87 * of sectors not grown carries over to the next island size.
89 * 4. Compute elevation
91 * First, use a simple random hill algorithm to assign raw elevations:
92 * initialize elevation to zero, then randomly raise circular hills on
93 * land / lower circular depressions at sea. Their size and height
94 * depends on the distance to the coast.
96 * Then, elevate islands one after the other.
98 * Set the capitals' elevation to a fixed value. Process the
99 * remaining sectors in order of increasing raw elevation, first
100 * non-mountains, then mountains. Non-mountain elevation starts at 1,
101 * and increases linearly to just below "high" elevation. Mountain
102 * elevation starts at "high" elevation, and increases linearly.
104 * This gives islands of the same size the same set of elevations.
105 * Larger islands get more and taller mountains.
107 * Finally, elevate sea: normalize the raw elevations to [-127:-1].
111 * Sector resources are simple functions of elevation. You can alter
112 * iron_conf[], gold_conf[], fert_conf[], oil_conf[], and uran_conf[]
127 #include "prototypes.h"
132 /* do not change these defines */
133 #define LANDMIN 1 /* plate altitude for normal land */
134 #define PLATMIN 36 /* plate altitude for plateau */
135 #define HIGHMIN 98 /* plate altitude for mountains */
138 * Resource configuration
140 * Resources are determined by elevation. The map from elevation to
141 * resource is defined as a linear interpolation of resource data
142 * points (elev, res) defined in the tables below. Elevations range
143 * from -127 to 127, and resource values from 0 to 100.
146 struct resource_point {
150 struct resource_point iron_conf[] = {
154 { HIGHMIN - 1, 100 },
158 struct resource_point gold_conf[] = {
165 struct resource_point fert_conf[] = {
174 struct resource_point oil_conf[] = {
183 struct resource_point uran_conf[] = {
191 static void qprint(const char * const fmt, ...)
192 ATTRIBUTE((format (printf, 1, 2)));
195 * Program arguments and options
197 static char *program_name;
198 static int nc, sc; /* number and size of continents */
199 static int ni, is; /* number and size of islands */
200 #define DEFAULT_SPIKE 10
201 static int sp = DEFAULT_SPIKE; /* spike percentage */
202 #define DEFAULT_MOUNTAIN 0
203 static int pm = DEFAULT_MOUNTAIN; /* mountain percentage */
204 #define DEFAULT_CONTDIST 2
205 static int di = DEFAULT_CONTDIST; /* min. distance between continents */
206 #define DEFAULT_ISLDIST 1
207 static int id = DEFAULT_ISLDIST; /* ... continents and islands */
208 /* don't let the islands crash into each other.
209 1 = don't merge, 0 = merge. */
210 static int DISTINCT_ISLANDS = 1;
212 #define DEFAULT_OUTFILE_NAME "newcap_script"
213 static const char *outfile = DEFAULT_OUTFILE_NAME;
215 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
216 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
217 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
222 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
223 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
227 * isecs[i] is the size of the i-th island.
231 static int *capx, *capy; /* location of the nc capitals */
235 * own[XYOFFSET(x, y)] is x,y's island number, -1 if water.
240 * Adjacent land sectors
241 * adj_land[XYOFFSET(x, y)] bit d is set exactly when the sector next
242 * to x, y in direction d is land.
244 static unsigned char *adj_land;
248 * elev[XYOFFSET(x, y)] is x,y's elevation.
254 * Each island is surrounded by an exclusive zone where only it may
255 * grow. The width of the zone depends on minimum distances.
256 * While growing continents, it is @di sectors wide.
257 * While growing additional islands, it is @id sectors wide.
258 * DISTINCT_ISLANDS nullifies the exclusive zone then.
259 * xzone[XYOFFSET(x, y)] is -1 when the sector is in no exclusive
260 * zone, a (non-negative) island number when it is in that island's
261 * exclusive zone and no other, and -2 when it is in multiple
267 * Set of sectors seen already
268 * Increment @cur_seen to empty the set of sectors seen, set
269 * seen[XYOFFSET(x, y)] to @cur_seen to add x,y to the set.
271 static unsigned *seen;
272 static unsigned cur_seen;
275 * Closest continent and "distance"
276 * closest[XYOFFSET(x, y)] is the closest continent's number.
277 * distance[] is complicated; see init_spheres_of_influence() and
278 * init_distance_to_coast().
280 static natid *closest;
281 static unsigned short *distance;
284 * Queue for breadth-first search
286 static int *bfs_queue;
287 static int bfs_queue_head, bfs_queue_tail;
289 static int **sectx, **secty; /* the sectors for each continent */
291 #define NUMTRIES 10 /* keep trying to grow this many times */
293 static const char *numletter =
294 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
296 static void help(char *);
297 static void usage(void);
298 static void parse_args(int argc, char *argv[]);
299 static void allocate_memory(void);
300 static void init(void);
301 static int drift(void);
302 static int grow_continents(void);
303 static void create_elevations(void);
304 static void write_sects(void);
305 static void output(void);
306 static int write_newcap_script(void);
307 static int stable(int);
308 static void elevate_prep(void);
309 static void elevate_land(void);
310 static void elevate_sea(void);
312 static void print_vars(void);
313 static void fl_move(int);
314 static int grow_islands(void);
316 /* Debugging aids: */
317 void print_own_map(void);
318 void print_xzone_map(void);
319 void print_closest_map(void);
320 void print_distance_map(void);
321 void print_elev_map(void);
323 /****************************************************************************
325 ****************************************************************************/
328 main(int argc, char *argv[])
331 char *config_file = NULL;
333 unsigned rnd_seed = 0;
336 program_name = argv[0];
338 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
341 config_file = optarg;
344 DISTINCT_ISLANDS = 0;
350 rnd_seed = strtoul(optarg, NULL, 10);
360 printf("%s\n\n%s", version, legal);
369 rnd_seed = pick_seed();
372 if (emp_config(config_file) < 0)
376 parse_args(argc - optind, argv + optind);
381 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
382 qprint("seed is %u\n", rnd_seed);
387 qprint("\ntry #%d (out of %d)...\n", try + 1, NUMTRIES);
388 qprint("placing capitals...\n");
390 qprint("unstable drift\n");
391 qprint("growing continents...\n");
392 done = grow_continents();
395 qprint("growing islands:");
396 done = grow_islands();
397 } while (!done && ++try < NUMTRIES);
399 fprintf(stderr, "%s: world not large enough for this much land\n",
403 qprint("elevating land...\n");
406 qprint("writing to sectors file...\n");
407 if (!write_newcap_script())
409 if (chdir(gamedir)) {
410 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
411 program_name, gamedir, strerror(errno));
414 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
417 if (!ef_close(EF_SECTOR))
421 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
431 puts("Creating a planet with:\n");
432 printf("%d continents\n", nc);
433 printf("continent size: %d\n", sc);
434 printf("number of islands: %d\n", ni);
435 printf("average size of islands: %d\n", is);
436 printf("spike: %d%%\n", sp);
437 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
438 pm, (pm * sc) / 100);
439 printf("minimum distance between continents: %d\n", di);
440 printf("minimum distance from islands to continents: %d\n", id);
441 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
445 help(char *complaint)
448 fprintf(stderr, "%s: %s\n", program_name, complaint);
449 fprintf(stderr, "Try -h for help.\n");
455 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
456 " -e CONFIG-FILE configuration file\n"
458 " -i islands may merge\n"
460 " -R SEED seed for random number generator\n"
461 " -s SCRIPT name of script to create (default %s)\n"
462 " -h display this help and exit\n"
463 " -v display version information and exit\n"
464 " NC number of continents\n"
465 " SC continent size\n"
466 " NI number of islands (default NC)\n"
467 " IS average island size (default SC/2)\n"
468 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
469 " PM percentage of land that is mountain (default %d)\n"
470 " DI minimum distance between continents (default %d)\n"
471 " ID minimum distance from islands to continents (default %d)\n",
472 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
473 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
477 parse_args(int argc, char *argv[])
479 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
482 help("missing arguments");
486 help("too many arguments");
491 fprintf(stderr, "%s: number of continents must be > 0\n",
498 fprintf(stderr, "%s: size of continents must be > 1\n",
509 fprintf(stderr, "%s: number of islands must be >= 0\n",
514 fprintf(stderr, "%s: number of islands must be a multiple of"
515 " the number of continents\n",
523 fprintf(stderr, "%s: size of islands must be > 0\n",
530 if (sp < 0 || sp > 100) {
532 "%s: spike percentage must be between 0 and 100\n",
539 if (pm < 0 || pm > 100) {
541 "%s: mountain percentage must be between 0 and 100\n",
549 fprintf(stderr, "%s: distance between continents must be >= 0\n",
554 fprintf(stderr, "%s: distance between continents too large\n",
563 "%s: distance from islands to continents must be >= 0\n",
569 "%s: distance from islands to continents too large\n",
575 /****************************************************************************
576 VARIABLE INITIALIZATION
577 ****************************************************************************/
580 allocate_memory(void)
584 capx = calloc(nc, sizeof(int));
585 capy = calloc(nc, sizeof(int));
586 own = malloc(WORLD_SZ() * sizeof(*own));
587 adj_land = malloc(WORLD_SZ() * sizeof(*adj_land));
588 elev = calloc(WORLD_SZ(), sizeof(*elev));
589 xzone = malloc(WORLD_SZ() * sizeof(*xzone));
590 seen = calloc(WORLD_SZ(), sizeof(*seen));
591 closest = malloc(WORLD_SZ() * sizeof(*closest));
592 distance = malloc(WORLD_SZ() * sizeof(*distance));
593 bfs_queue = malloc(WORLD_SZ() * sizeof(*bfs_queue));
594 sectx = calloc(nc + ni, sizeof(int *));
595 secty = calloc(nc + ni, sizeof(int *));
596 isecs = calloc(nc + ni, sizeof(int));
597 for (i = 0; i < nc; ++i) {
598 sectx[i] = calloc(sc, sizeof(int));
599 secty[i] = calloc(sc, sizeof(int));
601 for (i = nc; i < nc + ni; ++i) {
602 sectx[i] = calloc(is * 2, sizeof(int));
603 secty[i] = calloc(is * 2, sizeof(int));
613 for (i = 0; i < WORLD_SZ(); i++)
615 memset(adj_land, 0, WORLD_SZ() * sizeof(*adj_land));
618 /****************************************************************************
619 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
620 ****************************************************************************/
623 * How isolated is capital @j at @newx,@newy?
624 * Return the distance to the closest other capital.
627 iso(int j, int newx, int newy)
632 for (i = 0; i < nc; ++i) {
635 md = mapdist(capx[i], capy[i], newx, newy);
645 * Return 1 for a stable drift, 0 for an unstable one.
652 for (i = 0; i < nc; i++) {
653 capy[i] = (2 * i) / WORLD_X;
654 capx[i] = (2 * i) % WORLD_X + capy[i] % 2;
655 if (capy[i] >= WORLD_Y) {
657 "%s: world not big enough for all the continents\n",
663 for (turns = 0; turns < DRIFT_MAX; ++turns) {
666 for (i = 0; i < nc; ++i)
673 * Has the drift stabilized?
674 * @turns is the number of turns so far.
679 static int mc[STABLE_CYCLE];
680 int i, isod, d = 0, stab = 1;
683 for (i = 0; i < STABLE_CYCLE; i++)
687 if (turns <= DRIFT_BEFORE_CHECK)
690 for (i = 0; i < nc; ++i) {
691 isod = iso(i, capx[i], capy[i]);
696 for (i = 0; i < STABLE_CYCLE; ++i)
700 mc[turns % STABLE_CYCLE] = d;
704 /* This routine does the actual drifting
710 int dir, i, newx, newy;
712 dir = DIR_L + roll0(6);
713 for (i = 0; i < 6; i++) {
716 newx = new_x(capx[j] + diroff[dir][0]);
717 newy = new_y(capy[j] + diroff[dir][1]);
719 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
727 /****************************************************************************
729 ****************************************************************************/
732 is_coastal(int x, int y)
734 return adj_land[XYOFFSET(x, y)]
735 != (1u << (DIR_LAST + 1)) - (1u << DIR_FIRST);
738 struct hexagon_iter {
743 * Start iterating around @x0,@y0 at distance @d.
744 * Set *x,*y to coordinates of the first sector.
747 hexagon_first(struct hexagon_iter *iter, int x0, int y0, int n,
750 *x = new_x(x0 - 2 * n);
752 iter->dir = DIR_FIRST;
758 * Continue iteration started with hexagon_first().
759 * Set *x,*y to coordinates of the next sector.
760 * Return whether we're back at the first sector, i.e. iteration is
764 hexagon_next(struct hexagon_iter *iter, int *x, int *y)
766 *x = new_x(*x + diroff[iter->dir][0]);
767 *y = new_y(*y + diroff[iter->dir][1]);
769 if (iter->i == iter->n) {
773 return iter->dir <= DIR_LAST;
777 * Is @x,@y in no exclusive zone other than perhaps @c's?
780 xzone_ok(int c, int x, int y)
782 int off = XYOFFSET(x, y);
784 return xzone[off] == c || xzone[off] == -1;
788 * Add sectors within distance @dist of @x,@y to @c's exclusive zone.
791 xzone_around_sector(int c, int x, int y, int dist)
794 struct hexagon_iter hexit;
796 assert(xzone_ok(c, x, y));
798 xzone[XYOFFSET(x, y)] = c;
799 for (d = 1; d <= dist; d++) {
800 hexagon_first(&hexit, x, y, d, &x1, &y1);
802 off = XYOFFSET(x1, y1);
803 if (xzone[off] == -1)
805 else if (xzone[off] != c)
807 } while (hexagon_next(&hexit, &x1, &y1));
812 * Add sectors within distance @dist to island @c's exclusive zone.
815 xzone_around_island(int c, int dist)
819 for (i = 0; i < isecs[c]; i++)
820 xzone_around_sector(c, sectx[c][i], secty[c][i], dist);
824 * Initialize exclusive zones around @n islands.
831 for (i = 0; i < WORLD_SZ(); i++)
834 for (c = 0; c < n; c++)
835 xzone_around_island(c, id);
839 * Initialize breadth-first search.
846 for (i = 0; i < WORLD_SZ(); i++) {
848 distance[i] = USHRT_MAX;
851 bfs_queue_head = bfs_queue_tail = 0;
855 * Add sector @x,@y to the BFS queue.
856 * It's closest to @c, with distance @dist.
859 bfs_enqueue(int c, int x, int y, int dist)
861 int off = XYOFFSET(x, y);
863 assert(dist < distance[off]);
865 distance[off] = dist;
866 bfs_queue[bfs_queue_tail] = off;
868 if (bfs_queue_tail >= WORLD_SZ())
870 assert(bfs_queue_tail != bfs_queue_head);
874 * Search breadth-first until the queue is empty.
879 int off, dist, i, noff, nx, ny;
882 while (bfs_queue_head != bfs_queue_tail) {
883 off = bfs_queue[bfs_queue_head];
885 if (bfs_queue_head >= WORLD_SZ())
887 dist = distance[off] + 1;
888 sctoff2xy(&x, &y, off);
889 for (i = DIR_FIRST; i <= DIR_LAST; i++) {
890 nx = new_x(x + diroff[i][0]);
891 ny = new_y(y + diroff[i][1]);
892 noff = XYOFFSET(nx, ny);
893 if (dist < distance[noff]) {
894 bfs_enqueue(closest[off], nx, ny, dist);
895 } else if (distance[noff] == dist) {
896 if (closest[off] != closest[noff])
897 closest[noff] = (natid)-1;
899 assert(distance[noff] < dist);
905 * Add island @c's coastal sectors to the BFS queue, with distance 0.
908 bfs_enqueue_island(int c)
912 for (i = 0; i < isecs[c]; i++) {
913 if (is_coastal(sectx[c][i], secty[c][i]))
914 bfs_enqueue(c, sectx[c][i], secty[c][i], 0);
919 * Enqueue spheres of influence borders for breadth-first search.
922 bfs_enqueue_border(void)
924 int x, y, off, dir, nx, ny, noff;
926 for (y = 0; y < WORLD_Y; y++) {
927 for (x = y % 2; x < WORLD_X; x += 2) {
928 off = XYOFFSET(x, y);
929 if (distance[off] <= id + 1)
931 if (closest[off] == (natid)-1)
933 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
934 nx = new_x(x + diroff[dir][0]);
935 ny = new_y(y + diroff[dir][1]);
936 noff = XYOFFSET(nx, ny);
937 if (closest[noff] != closest[off]) {
938 bfs_enqueue(closest[off], x, y, id + 1);
947 * Compute spheres of influence
948 * A continent's sphere of influence is the set of sectors closer to
949 * it than to any other continent.
950 * Set closest[XYOFFSET(x, y)] to the closest continent's number,
951 * -1 if no single continent is closest.
952 * Set distance[XYOFFSET(x, y)] to the minimum of the distance to the
953 * closest coastal land sector and the distance to just outside the
954 * sphere of influence plus @id. For sea sectors within a continent's
955 * sphere of influence, distance[off] - id is the distance to the
956 * border of the area where additional islands can be placed.
959 init_spheres_of_influence(void)
964 for (c = 0; c < nc; c++)
965 bfs_enqueue_island(c);
967 bfs_enqueue_border();
972 * Precompute distance to coast
973 * Set distance[XYOFFSET(x, y)] to the distance to the closest coastal
975 * Set closest[XYOFFSET(x, y)] to the closest continent's number,
976 * -1 if no single continent is closest.
979 init_distance_to_coast(void)
984 for (c = 0; c < nc + ni; c++)
985 bfs_enqueue_island(c);
990 * Is @x,@y in the same sphere of influence as island @c?
991 * Always true when @c is a continent.
994 is_in_sphere(int c, int x, int y)
996 return c < nc || closest[XYOFFSET(x, y)] == c % nc;
1000 * Can island @c grow at @x,@y?
1003 can_grow_at(int c, int x, int y)
1005 return own[XYOFFSET(x, y)] == -1 && xzone_ok(c, x, y)
1006 && is_in_sphere(c, x, y);
1010 adj_land_update(int x, int y)
1012 int is_land = own[XYOFFSET(x, y)] != -1;
1013 int dir, nx, ny, noff;
1015 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
1016 nx = new_x(x + diroff[dir][0]);
1017 ny = new_y(y + diroff[dir][1]);
1018 noff = XYOFFSET(nx, ny);
1020 adj_land[noff] |= 1u << DIR_BACK(dir);
1022 adj_land[noff] &= ~(1u << DIR_BACK(dir));
1027 add_sector(int c, int x, int y)
1029 int off = XYOFFSET(x, y);
1031 assert(own[off] == -1);
1032 xzone_around_sector(c, x, y, c < nc ? di : DISTINCT_ISLANDS ? id : 0);
1033 sectx[c][isecs[c]] = x;
1034 secty[c][isecs[c]] = y;
1037 adj_land_update(x, y);
1041 grow_weight(int c, int x, int y, int spike)
1046 * #Land neighbors is #bits set in adj_land[].
1047 * Count them Brian Kernighan's way.
1050 for (b = adj_land[XYOFFSET(x, y)]; b; b &= b - 1)
1052 assert(n > 0 && n < 7);
1055 return (6 - n) * (6 - n);
1061 grow_one_sector(int c)
1063 int spike = roll0(100) < sp;
1064 int wsum, newx, newy, i, x, y, off, dir, nx, ny, noff, w;
1066 assert(cur_seen < UINT_MAX);
1071 for (i = 0; i < isecs[c]; i++) {
1074 off = XYOFFSET(x, y);
1076 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
1077 if (adj_land[off] & (1u << dir))
1079 nx = new_x(x + diroff[dir][0]);
1080 ny = new_y(y + diroff[dir][1]);
1081 noff = XYOFFSET(nx, ny);
1082 if (seen[noff] == cur_seen)
1084 assert(seen[noff] < cur_seen);
1085 seen[noff] = cur_seen;
1086 if (!can_grow_at(c, nx, ny))
1088 w = grow_weight(c, nx, ny, spike);
1089 assert(wsum < INT_MAX - w);
1091 if (roll0(wsum) < w) {
1101 add_sector(c, newx, newy);
1106 * Grow the continents.
1107 * Return 1 on success, 0 on error.
1110 grow_continents(void)
1117 for (c = 0; c < nc; ++c) {
1119 if (!can_grow_at(c, capx[c], capy[c])
1120 || !can_grow_at(c, new_x(capx[c] + 2), capy[c])) {
1124 add_sector(c, capx[c], capy[c]);
1125 add_sector(c, new_x(capx[c] + 2), capy[c]);
1129 qprint("No room for continents\n");
1133 for (secs = 2; secs < sc && done; secs++) {
1134 for (c = 0; c < nc; ++c) {
1135 if (!grow_one_sector(c))
1141 qprint("Only managed to grow %d out of %d sectors.\n",
1146 /****************************************************************************
1148 ****************************************************************************/
1151 * Place additional island @c's first sector.
1152 * Return 1 on success, 0 on error.
1155 place_island(int c, int isiz)
1157 int n, x, y, d, w, newx, newy;
1161 for (y = 0; y < WORLD_Y; y++) {
1162 for (x = y % 2; x < WORLD_X; x += 2) {
1163 if (can_grow_at(c, x, y)) {
1164 d = distance[XYOFFSET(x, y)];
1166 w = (d - id) * (d - id);
1167 n += MIN(w, (isiz + 2) / 3);
1177 add_sector(c, newx, newy);
1182 int_cmp(const void *a, const void *b)
1184 return *(int *)b - *(int *)a;
1191 int *isiz = malloc(n * sizeof(*isiz));
1196 for (i = 1; i < n; i++) {
1199 isiz[i] = is + r1 - r0;
1203 qsort(isiz, n, sizeof(*isiz), int_cmp);
1208 * Grow the additional islands.
1209 * Return 1 on success, 0 on error.
1214 int *island_size = size_islands();
1215 int xzone_valid = 0;
1217 int i, j, c, done, secs, isiz, x, y;
1219 init_spheres_of_influence();
1221 for (i = 0; i < ni / nc; i++) {
1227 carry += island_size[i];
1228 isiz = MIN(2 * is, carry);
1230 for (j = 0; j < nc; j++) {
1232 if (!place_island(c + j, isiz)) {
1233 qprint("\nNo room for island #%d\n", c - nc + j + 1);
1240 for (secs = 1; secs < isiz && done; secs++) {
1241 for (j = 0; j < nc; j++) {
1242 if (!grow_one_sector(c + j))
1249 for (j = 0; j < nc; j++) {
1250 if (isecs[c + j] != secs) {
1252 assert(isecs[c + j] == secs);
1253 x = sectx[c + j][secs];
1254 y = secty[c + j][secs];
1255 own[XYOFFSET(x, y)] = -1;
1256 adj_land_update(x, y);
1262 for (j = 0; j < nc; j++)
1263 qprint(" %d(%d)", c - nc + j + 1, isecs[c + j]);
1272 qprint("Only managed to grow %d out of %d island sectors.\n",
1273 is * ni - carry * nc, is * ni);
1278 /****************************************************************************
1280 ****************************************************************************/
1282 create_elevations(void)
1290 elev_cmp(const void *p, const void *q)
1294 int delev = elev[a] - elev[b];
1296 return delev ? delev : a - b;
1302 int n = WORLD_SZ() * 8;
1303 int off0, r, sign, elevation, d, x1, y1, off1;
1305 struct hexagon_iter hexit;
1307 init_distance_to_coast();
1310 off0 = roll0(WORLD_SZ());
1311 sctoff2xy(&x0, &y0, off0);
1312 if (own[off0] == -1) {
1313 r = roll(MIN(3, distance[off0]));
1316 r = roll(MIN(3, distance[off0]) + 1);
1319 elevation = elev[off0] + sign * r * r;
1320 elev[off0] = LIMIT_TO(elevation, SHRT_MIN, SHRT_MAX);
1322 for (d = 1; d < r; d++) {
1323 hexagon_first(&hexit, x0, y0, d, &x1, &y1);
1325 off1 = XYOFFSET(x1, y1);
1326 elevation = elev[off1] + sign * (r * r - d * d);
1327 elev[off1] = LIMIT_TO(elevation, SHRT_MIN, SHRT_MAX);
1329 } while (hexagon_next(&hexit, &x1, &y1));
1337 int *off = malloc(MAX(sc, is * 2) * sizeof(*off));
1338 int max_nm = (pm * MAX(sc, is * 2)) / 100;
1339 int c, nm, i0, n, i;
1340 double elevation, delta;
1342 for (c = 0; c < nc + ni; c++) {
1343 nm = (pm * isecs[c]) / 100;
1344 i0 = c < nc ? 2 : 0;
1346 for (i = 0; i < i0; i++)
1347 elev[XYOFFSET(sectx[c][i], secty[c][i])] = PLATMIN;
1348 for (i = 0; i < n; i++)
1349 off[i] = XYOFFSET(sectx[c][i0 + i], secty[c][i0 + i]);
1350 qsort(off, n, sizeof(*off), elev_cmp);
1351 delta = (double)(HIGHMIN - LANDMIN - 1) / (n - nm - 1);
1352 elevation = LANDMIN;
1353 for (i = 0; i < n - nm; i++) {
1354 elev[off[i]] = (int)(elevation + 0.5);
1357 elevation = HIGHMIN;
1358 delta = (127.0 - HIGHMIN) / max_nm;
1359 for (; i < n; i++) {
1361 elev[off[i]] = (int)(elevation + 0.5);
1374 for (i = 0; i < WORLD_SZ(); i++) {
1379 for (i = 0; i < WORLD_SZ(); i++) {
1381 elev[i] = -1 - 126 * elev[i] / min;
1386 elev_to_sct_type(int elevation)
1388 if (elevation < LANDMIN)
1390 if (elevation < HIGHMIN)
1395 /****************************************************************************
1397 ****************************************************************************/
1400 * Map elevation @elev to a resource value according to @conf.
1401 * This is a linear interpolation on the data points in @conf.
1404 elev_to_resource(int elev, struct resource_point conf[])
1406 int i, elev1, elev2, delev, res1, res2, dres;
1408 for (i = 1; elev > conf[i].elev; i++) ;
1409 assert(conf[i - 1].elev <= elev);
1411 elev1 = conf[i - 1].elev;
1412 elev2 = conf[i].elev;
1413 delev = elev2 - elev1;
1414 res1 = conf[i - 1].res;
1417 return (int)(res1 + (double)((elev - elev1) * dres) / delev);
1421 add_resources(struct sctstr *sct)
1423 sct->sct_min = elev_to_resource(sct->sct_elev, iron_conf);
1424 sct->sct_gmin = elev_to_resource(sct->sct_elev, gold_conf);
1425 sct->sct_fertil = elev_to_resource(sct->sct_elev, fert_conf);
1426 sct->sct_oil = elev_to_resource(sct->sct_elev, oil_conf);
1427 sct->sct_uran = elev_to_resource(sct->sct_elev, uran_conf);
1430 /****************************************************************************
1431 DESIGNATE THE SECTORS
1432 ****************************************************************************/
1440 for (y = 0; y < WORLD_Y; y++) {
1441 for (x = y % 2; x < WORLD_X; x += 2) {
1442 sct = getsectp(x, y);
1443 sct->sct_elev = elev[sct->sct_uid];
1444 sct->sct_type = elev_to_sct_type(sct->sct_elev);
1445 sct->sct_newtype = sct->sct_type;
1446 sct->sct_dterr = own[sct->sct_uid] + 1;
1447 sct->sct_coastal = is_coastal(sct->sct_x, sct->sct_y);
1453 /****************************************************************************
1454 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1455 ****************************************************************************/
1459 int sx, sy, x, y, off, c, type;
1462 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1467 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1469 off = XYOFFSET(x, y);
1471 type = elev_to_sct_type(elev[off]);
1472 if (type == SCT_WATER)
1474 else if (type == SCT_MOUNT)
1479 assert(0 <= c && c < nc);
1480 if ((x == capx[c] || x == new_x(capx[c] + 2))
1482 printf("%c ", numletter[c % 62]);
1492 * Print a map to help visualize own[].
1493 * This is for debugging.
1498 int sx, sy, x, y, off;
1500 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1503 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1505 off = XYOFFSET(x, y);
1508 else if (own[off] == -1)
1511 putchar(numletter[own[off] % 62]);
1518 * Print a map to help visualize elev[].
1519 * This is for debugging. It expects the terminal to understand
1520 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1523 print_elev_map(void)
1525 int sx, sy, x, y, off, sat;
1527 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1530 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1532 off = XYOFFSET(x, y);
1535 else if (!elev[off])
1537 else if (elev[off] < 0) {
1538 sat = 256 + elev[off] * 2;
1539 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1540 } else if (elev[off] < HIGHMIN / 2) {
1541 sat = (HIGHMIN / 2 - elev[off]) * 4;
1542 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1543 } else if (elev[off] < HIGHMIN) {
1544 sat = 128 + (HIGHMIN - elev[off]) * 2;
1545 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1547 sat = 128 + (elev[off] - HIGHMIN) * 2;
1548 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1556 * Print a map to help visualize xzone[].
1557 * This is for debugging.
1560 print_xzone_map(void)
1562 int sx, sy, x, y, off;
1564 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1567 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1569 off = XYOFFSET(x, y);
1572 else if (own[off] >= 0)
1574 else if (xzone[off] >= 0)
1575 putchar(numletter[xzone[off] % 62]);
1577 assert(own[off] == -1);
1578 putchar(xzone[off] == -1 ? '.' : '!');
1586 * Print a map to help visualize closest[].
1587 * This is for debugging.
1590 print_closest_map(void)
1592 int sx, sy, x, y, off;
1594 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1597 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1599 off = XYOFFSET(x, y);
1602 else if (closest[off] == (natid)-1)
1604 else if (!distance[off]) {
1605 assert(closest[off] == own[off]);
1608 putchar(numletter[closest[off] % 62]);
1616 print_distance_map(void)
1618 int sx, sy, x, y, off;
1620 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1623 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1625 off = XYOFFSET(x, y);
1628 else if (closest[off] == (natid)-1)
1630 else if (!distance[off]) {
1631 assert(closest[off] == own[off]);
1634 putchar(numletter[distance[off] % 62]);
1642 /***************************************************************************
1643 WRITE A SCRIPT FOR PLACING CAPITALS
1644 ****************************************************************************/
1646 write_newcap_script(void)
1649 FILE *script = fopen(outfile, "w");
1652 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1653 program_name, outfile, strerror(errno));
1657 for (c = 0; c < nc; ++c) {
1658 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1659 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1661 fprintf(script, "add %d visitor visitor v\n", c + 1);
1667 qprint(const char *const fmt, ...)
1673 vfprintf(stdout, fmt, ap);