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)
231 * The i-th capital is at cap[i].
233 static struct xy *cap;
237 * isecs[i] is the size of the i-th island.
243 * The i-th island's j-th sector is at sect[i][j].
249 * own[XYOFFSET(x, y)] is x,y's island number, -1 if water.
254 * Adjacent land sectors
255 * adj_land[XYOFFSET(x, y)] bit d is set exactly when the sector next
256 * to x, y in direction d is land.
258 static unsigned char *adj_land;
262 * elev[XYOFFSET(x, y)] is x,y's elevation.
268 * Each island is surrounded by an exclusive zone where only it may
269 * grow. The width of the zone depends on minimum distances.
270 * While growing continents, it is @di sectors wide.
271 * While growing additional islands, it is @id sectors wide.
272 * DISTINCT_ISLANDS nullifies the exclusive zone then.
273 * xzone[XYOFFSET(x, y)] is -1 when the sector is in no exclusive
274 * zone, a (non-negative) island number when it is in that island's
275 * exclusive zone and no other, and -2 when it is in multiple
281 * Set of sectors seen already
282 * Increment @cur_seen to empty the set of sectors seen, set
283 * seen[XYOFFSET(x, y)] to @cur_seen to add x,y to the set.
285 static unsigned *seen;
286 static unsigned cur_seen;
289 * Closest continent and "distance"
290 * closest[XYOFFSET(x, y)] is the closest continent's number.
291 * distance[] is complicated; see init_spheres_of_influence() and
292 * init_distance_to_coast().
294 static natid *closest;
295 static unsigned short *distance;
298 * Queue for breadth-first search
300 static int *bfs_queue;
301 static int bfs_queue_head, bfs_queue_tail;
303 #define NUMTRIES 10 /* keep trying to grow this many times */
305 static const char *numletter =
306 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
308 static void help(char *);
309 static void usage(void);
310 static void parse_args(int argc, char *argv[]);
311 static void allocate_memory(void);
312 static void init(void);
313 static int drift(void);
314 static int grow_continents(void);
315 static void create_elevations(void);
316 static void write_sects(void);
317 static void output(void);
318 static int write_newcap_script(void);
319 static int stable(int);
320 static void elevate_prep(void);
321 static void elevate_land(void);
322 static void elevate_sea(void);
324 static void print_vars(void);
325 static void fl_move(int);
326 static int grow_islands(void);
328 /* Debugging aids: */
329 void print_own_map(void);
330 void print_xzone_map(void);
331 void print_closest_map(void);
332 void print_distance_map(void);
333 void print_elev_map(void);
335 /****************************************************************************
337 ****************************************************************************/
340 main(int argc, char *argv[])
343 char *config_file = NULL;
345 unsigned rnd_seed = 0;
348 program_name = argv[0];
350 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
353 config_file = optarg;
356 DISTINCT_ISLANDS = 0;
362 rnd_seed = strtoul(optarg, NULL, 10);
372 printf("%s\n\n%s", version, legal);
381 rnd_seed = pick_seed();
384 if (emp_config(config_file) < 0)
388 parse_args(argc - optind, argv + optind);
393 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
394 qprint("seed is %u\n", rnd_seed);
399 qprint("\ntry #%d (out of %d)...\n", try + 1, NUMTRIES);
400 qprint("placing capitals...\n");
402 qprint("unstable drift\n");
403 qprint("growing continents...\n");
404 done = grow_continents();
407 qprint("growing islands:");
408 done = grow_islands();
409 } while (!done && ++try < NUMTRIES);
411 fprintf(stderr, "%s: world not large enough for this much land\n",
415 qprint("elevating land...\n");
418 qprint("writing to sectors file...\n");
419 if (!write_newcap_script())
421 if (chdir(gamedir)) {
422 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
423 program_name, gamedir, strerror(errno));
426 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
429 if (!ef_close(EF_SECTOR))
433 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
443 puts("Creating a planet with:\n");
444 printf("%d continents\n", nc);
445 printf("continent size: %d\n", sc);
446 printf("number of islands: %d\n", ni);
447 printf("average size of islands: %d\n", is);
448 printf("spike: %d%%\n", sp);
449 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
450 pm, (pm * sc) / 100);
451 printf("minimum distance between continents: %d\n", di);
452 printf("minimum distance from islands to continents: %d\n", id);
453 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
457 help(char *complaint)
460 fprintf(stderr, "%s: %s\n", program_name, complaint);
461 fprintf(stderr, "Try -h for help.\n");
467 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
468 " -e CONFIG-FILE configuration file\n"
470 " -i islands may merge\n"
472 " -R SEED seed for random number generator\n"
473 " -s SCRIPT name of script to create (default %s)\n"
474 " -h display this help and exit\n"
475 " -v display version information and exit\n"
476 " NC number of continents\n"
477 " SC continent size\n"
478 " NI number of islands (default NC)\n"
479 " IS average island size (default SC/2)\n"
480 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
481 " PM percentage of land that is mountain (default %d)\n"
482 " DI minimum distance between continents (default %d)\n"
483 " ID minimum distance from islands to continents (default %d)\n",
484 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
485 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
489 parse_args(int argc, char *argv[])
491 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
494 help("missing arguments");
498 help("too many arguments");
503 fprintf(stderr, "%s: number of continents must be > 0\n",
510 fprintf(stderr, "%s: size of continents must be > 1\n",
521 fprintf(stderr, "%s: number of islands must be >= 0\n",
526 fprintf(stderr, "%s: number of islands must be a multiple of"
527 " the number of continents\n",
535 fprintf(stderr, "%s: size of islands must be > 0\n",
542 if (sp < 0 || sp > 100) {
544 "%s: spike percentage must be between 0 and 100\n",
551 if (pm < 0 || pm > 100) {
553 "%s: mountain percentage must be between 0 and 100\n",
561 fprintf(stderr, "%s: distance between continents must be >= 0\n",
566 fprintf(stderr, "%s: distance between continents too large\n",
575 "%s: distance from islands to continents must be >= 0\n",
581 "%s: distance from islands to continents too large\n",
587 /****************************************************************************
588 VARIABLE INITIALIZATION
589 ****************************************************************************/
592 allocate_memory(void)
596 cap = malloc(nc * sizeof(*cap));
597 own = malloc(WORLD_SZ() * sizeof(*own));
598 adj_land = malloc(WORLD_SZ() * sizeof(*adj_land));
599 elev = calloc(WORLD_SZ(), sizeof(*elev));
600 xzone = malloc(WORLD_SZ() * sizeof(*xzone));
601 seen = calloc(WORLD_SZ(), sizeof(*seen));
602 closest = malloc(WORLD_SZ() * sizeof(*closest));
603 distance = malloc(WORLD_SZ() * sizeof(*distance));
604 bfs_queue = malloc(WORLD_SZ() * sizeof(*bfs_queue));
605 isecs = calloc(nc + ni, sizeof(int));
606 sect = malloc((nc + ni) * sizeof(*sect));
607 for (i = 0; i < nc; i++)
608 sect[i] = malloc(sc * sizeof(**sect));
609 for (i = nc; i < nc + ni; i++)
610 sect[i] = malloc(is * 2 * sizeof(**sect));
618 for (i = 0; i < WORLD_SZ(); i++)
620 memset(adj_land, 0, WORLD_SZ() * sizeof(*adj_land));
623 /****************************************************************************
624 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
625 ****************************************************************************/
628 * How isolated is capital @j at @newx,@newy?
629 * Return the distance to the closest other capital.
632 iso(int j, int newx, int newy)
637 for (i = 0; i < nc; ++i) {
640 md = mapdist(cap[i].x, cap[i].y, newx, newy);
650 * Return 1 for a stable drift, 0 for an unstable one.
657 for (i = 0; i < nc; i++) {
658 cap[i].y = (2 * i) / WORLD_X;
659 cap[i].x = (2 * i) % WORLD_X + cap[i].y % 2;
660 if (cap[i].y >= WORLD_Y) {
662 "%s: world not big enough for all the continents\n",
668 for (turns = 0; turns < DRIFT_MAX; ++turns) {
671 for (i = 0; i < nc; ++i)
678 * Has the drift stabilized?
679 * @turns is the number of turns so far.
684 static int mc[STABLE_CYCLE];
685 int i, isod, d = 0, stab = 1;
688 for (i = 0; i < STABLE_CYCLE; i++)
692 if (turns <= DRIFT_BEFORE_CHECK)
695 for (i = 0; i < nc; ++i) {
696 isod = iso(i, cap[i].x, cap[i].y);
701 for (i = 0; i < STABLE_CYCLE; ++i)
705 mc[turns % STABLE_CYCLE] = d;
709 /* This routine does the actual drifting
715 int dir, i, newx, newy;
717 dir = DIR_L + roll0(6);
718 for (i = 0; i < 6; i++) {
721 newx = new_x(cap[j].x + diroff[dir][0]);
722 newy = new_y(cap[j].y + diroff[dir][1]);
724 if (iso(j, newx, newy) >= iso(j, cap[j].x, cap[j].y)) {
732 /****************************************************************************
734 ****************************************************************************/
737 is_coastal(int x, int y)
739 return adj_land[XYOFFSET(x, y)]
740 != (1u << (DIR_LAST + 1)) - (1u << DIR_FIRST);
743 struct hexagon_iter {
748 * Start iterating around @x0,@y0 at distance @d.
749 * Set *x,*y to coordinates of the first sector.
752 hexagon_first(struct hexagon_iter *iter, int x0, int y0, int n,
755 *x = new_x(x0 - 2 * n);
757 iter->dir = DIR_FIRST;
763 * Continue iteration started with hexagon_first().
764 * Set *x,*y to coordinates of the next sector.
765 * Return whether we're back at the first sector, i.e. iteration is
769 hexagon_next(struct hexagon_iter *iter, int *x, int *y)
771 *x = new_x(*x + diroff[iter->dir][0]);
772 *y = new_y(*y + diroff[iter->dir][1]);
774 if (iter->i == iter->n) {
778 return iter->dir <= DIR_LAST;
782 * Is @x,@y in no exclusive zone other than perhaps @c's?
785 xzone_ok(int c, int x, int y)
787 int off = XYOFFSET(x, y);
789 return xzone[off] == c || xzone[off] == -1;
793 * Add sectors within distance @dist of @x,@y to @c's exclusive zone.
796 xzone_around_sector(int c, int x, int y, int dist)
799 struct hexagon_iter hexit;
801 assert(xzone_ok(c, x, y));
803 xzone[XYOFFSET(x, y)] = c;
804 for (d = 1; d <= dist; d++) {
805 hexagon_first(&hexit, x, y, d, &x1, &y1);
807 off = XYOFFSET(x1, y1);
808 if (xzone[off] == -1)
810 else if (xzone[off] != c)
812 } while (hexagon_next(&hexit, &x1, &y1));
817 * Add sectors within distance @dist to island @c's exclusive zone.
820 xzone_around_island(int c, int dist)
824 for (i = 0; i < isecs[c]; i++)
825 xzone_around_sector(c, sect[c][i].x, sect[c][i].y, dist);
829 * Initialize exclusive zones around @n islands.
836 for (i = 0; i < WORLD_SZ(); i++)
839 for (c = 0; c < n; c++)
840 xzone_around_island(c, id);
844 * Initialize breadth-first search.
851 for (i = 0; i < WORLD_SZ(); i++) {
853 distance[i] = USHRT_MAX;
856 bfs_queue_head = bfs_queue_tail = 0;
860 * Add sector @x,@y to the BFS queue.
861 * It's closest to @c, with distance @dist.
864 bfs_enqueue(int c, int x, int y, int dist)
866 int off = XYOFFSET(x, y);
868 assert(dist < distance[off]);
870 distance[off] = dist;
871 bfs_queue[bfs_queue_tail] = off;
873 if (bfs_queue_tail >= WORLD_SZ())
875 assert(bfs_queue_tail != bfs_queue_head);
879 * Search breadth-first until the queue is empty.
884 int off, dist, i, noff, nx, ny;
887 while (bfs_queue_head != bfs_queue_tail) {
888 off = bfs_queue[bfs_queue_head];
890 if (bfs_queue_head >= WORLD_SZ())
892 dist = distance[off] + 1;
893 sctoff2xy(&x, &y, off);
894 for (i = DIR_FIRST; i <= DIR_LAST; i++) {
895 nx = new_x(x + diroff[i][0]);
896 ny = new_y(y + diroff[i][1]);
897 noff = XYOFFSET(nx, ny);
898 if (dist < distance[noff]) {
899 bfs_enqueue(closest[off], nx, ny, dist);
900 } else if (distance[noff] == dist) {
901 if (closest[off] != closest[noff])
902 closest[noff] = (natid)-1;
904 assert(distance[noff] < dist);
910 * Add island @c's coastal sectors to the BFS queue, with distance 0.
913 bfs_enqueue_island(int c)
917 for (i = 0; i < isecs[c]; i++) {
918 if (is_coastal(sect[c][i].x, sect[c][i].y))
919 bfs_enqueue(c, sect[c][i].x, sect[c][i].y, 0);
924 * Enqueue spheres of influence borders for breadth-first search.
927 bfs_enqueue_border(void)
929 int x, y, off, dir, nx, ny, noff;
931 for (y = 0; y < WORLD_Y; y++) {
932 for (x = y % 2; x < WORLD_X; x += 2) {
933 off = XYOFFSET(x, y);
934 if (distance[off] <= id + 1)
936 if (closest[off] == (natid)-1)
938 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
939 nx = new_x(x + diroff[dir][0]);
940 ny = new_y(y + diroff[dir][1]);
941 noff = XYOFFSET(nx, ny);
942 if (closest[noff] != closest[off]) {
943 bfs_enqueue(closest[off], x, y, id + 1);
952 * Compute spheres of influence
953 * A continent's sphere of influence is the set of sectors closer to
954 * it than to any other continent.
955 * Set closest[XYOFFSET(x, y)] to the closest continent's number,
956 * -1 if no single continent is closest.
957 * Set distance[XYOFFSET(x, y)] to the minimum of the distance to the
958 * closest coastal land sector and the distance to just outside the
959 * sphere of influence plus @id. For sea sectors within a continent's
960 * sphere of influence, distance[off] - id is the distance to the
961 * border of the area where additional islands can be placed.
964 init_spheres_of_influence(void)
969 for (c = 0; c < nc; c++)
970 bfs_enqueue_island(c);
972 bfs_enqueue_border();
977 * Precompute distance to coast
978 * Set distance[XYOFFSET(x, y)] to the distance to the closest coastal
980 * Set closest[XYOFFSET(x, y)] to the closest continent's number,
981 * -1 if no single continent is closest.
984 init_distance_to_coast(void)
989 for (c = 0; c < nc + ni; c++)
990 bfs_enqueue_island(c);
995 * Is @x,@y in the same sphere of influence as island @c?
996 * Always true when @c is a continent.
999 is_in_sphere(int c, int x, int y)
1001 return c < nc || closest[XYOFFSET(x, y)] == c % nc;
1005 * Can island @c grow at @x,@y?
1008 can_grow_at(int c, int x, int y)
1010 return own[XYOFFSET(x, y)] == -1 && xzone_ok(c, x, y)
1011 && is_in_sphere(c, x, y);
1015 adj_land_update(int x, int y)
1017 int is_land = own[XYOFFSET(x, y)] != -1;
1018 int dir, nx, ny, noff;
1020 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
1021 nx = new_x(x + diroff[dir][0]);
1022 ny = new_y(y + diroff[dir][1]);
1023 noff = XYOFFSET(nx, ny);
1025 adj_land[noff] |= 1u << DIR_BACK(dir);
1027 adj_land[noff] &= ~(1u << DIR_BACK(dir));
1032 add_sector(int c, int x, int y)
1034 int off = XYOFFSET(x, y);
1036 assert(own[off] == -1);
1037 xzone_around_sector(c, x, y, c < nc ? di : DISTINCT_ISLANDS ? id : 0);
1038 sect[c][isecs[c]].x = x;
1039 sect[c][isecs[c]].y = y;
1042 adj_land_update(x, y);
1045 static int grow_weight(int c, int x, int y, int spike)
1050 * #Land neighbors is #bits set in adj_land[].
1051 * Count them Brian Kernighan's way.
1054 for (b = adj_land[XYOFFSET(x, y)]; b; b &= b - 1)
1056 assert(n > 0 && n < 7);
1059 return (6 - n) * (6 - n);
1065 grow_one_sector(int c)
1067 int spike = roll0(100) < sp;
1068 int wsum, newx, newy, i, x, y, off, dir, nx, ny, noff, w;
1070 assert(cur_seen < UINT_MAX);
1075 for (i = 0; i < isecs[c]; i++) {
1078 off = XYOFFSET(x, y);
1080 for (dir = DIR_FIRST; dir <= DIR_LAST; dir++) {
1081 if (adj_land[off] & (1u << dir))
1083 nx = new_x(x + diroff[dir][0]);
1084 ny = new_y(y + diroff[dir][1]);
1085 noff = XYOFFSET(nx, ny);
1086 if (seen[noff] == cur_seen)
1088 assert(seen[noff] < cur_seen);
1089 seen[noff] = cur_seen;
1090 if (!can_grow_at(c, nx, ny))
1092 w = grow_weight(c, nx, ny, spike);
1093 assert(wsum < INT_MAX - w);
1095 if (roll0(wsum) < w) {
1105 add_sector(c, newx, newy);
1110 * Grow the continents.
1111 * Return 1 on success, 0 on error.
1114 grow_continents(void)
1121 for (c = 0; c < nc; ++c) {
1123 if (!can_grow_at(c, cap[c].x, cap[c].y)
1124 || !can_grow_at(c, new_x(cap[c].x + 2), cap[c].y)) {
1128 add_sector(c, cap[c].x, cap[c].y);
1129 add_sector(c, new_x(cap[c].x + 2), cap[c].y);
1133 qprint("No room for continents\n");
1137 for (secs = 2; secs < sc && done; secs++) {
1138 for (c = 0; c < nc; ++c) {
1139 if (!grow_one_sector(c))
1145 qprint("Only managed to grow %d out of %d sectors.\n",
1150 /****************************************************************************
1152 ****************************************************************************/
1155 * Place additional island @c's first sector.
1156 * Return 1 on success, 0 on error.
1159 place_island(int c, int isiz)
1161 int n, x, y, d, w, newx, newy;
1165 for (y = 0; y < WORLD_Y; y++) {
1166 for (x = y % 2; x < WORLD_X; x += 2) {
1167 if (can_grow_at(c, x, y)) {
1168 d = distance[XYOFFSET(x, y)];
1170 w = (d - id) * (d - id);
1171 n += MIN(w, (isiz + 2) / 3);
1181 add_sector(c, newx, newy);
1186 int_cmp(const void *a, const void *b)
1188 return *(int *)b - *(int *)a;
1195 int *isiz = malloc(n * sizeof(*isiz));
1200 for (i = 1; i < n; i++) {
1203 isiz[i] = is + r1 - r0;
1207 qsort(isiz, n, sizeof(*isiz), int_cmp);
1212 * Grow the additional islands.
1213 * Return 1 on success, 0 on error.
1218 int *island_size = size_islands();
1219 int xzone_valid = 0;
1221 int i, j, c, done, secs, isiz, x, y;
1223 init_spheres_of_influence();
1225 for (i = 0; i < ni / nc; i++) {
1231 carry += island_size[i];
1232 isiz = MIN(2 * is, carry);
1234 for (j = 0; j < nc; j++) {
1236 if (!place_island(c + j, isiz)) {
1237 qprint("\nNo room for island #%d\n", c - nc + j + 1);
1244 for (secs = 1; secs < isiz && done; secs++) {
1245 for (j = 0; j < nc; j++) {
1246 if (!grow_one_sector(c + j))
1253 for (j = 0; j < nc; j++) {
1254 if (isecs[c + j] != secs) {
1256 assert(isecs[c + j] == secs);
1257 x = sect[c + j][secs].x;
1258 y = sect[c + j][secs].y;
1259 own[XYOFFSET(x, y)] = -1;
1260 adj_land_update(x, y);
1266 for (j = 0; j < nc; j++)
1267 qprint(" %d(%d)", c - nc + j + 1, isecs[c + j]);
1276 qprint("Only managed to grow %d out of %d island sectors.\n",
1277 is * ni - carry * nc, is * ni);
1282 /****************************************************************************
1284 ****************************************************************************/
1286 create_elevations(void)
1294 elev_cmp(const void *p, const void *q)
1298 int delev = elev[a] - elev[b];
1300 return delev ? delev : a - b;
1306 int n = WORLD_SZ() * 8;
1307 int off0, r, sign, elevation, d, x1, y1, off1;
1309 struct hexagon_iter hexit;
1311 init_distance_to_coast();
1314 off0 = roll0(WORLD_SZ());
1315 sctoff2xy(&x0, &y0, off0);
1316 if (own[off0] == -1) {
1317 r = roll(MIN(3, distance[off0]));
1320 r = roll(MIN(3, distance[off0]) + 1);
1323 elevation = elev[off0] + sign * r * r;
1324 elev[off0] = LIMIT_TO(elevation, SHRT_MIN, SHRT_MAX);
1326 for (d = 1; d < r; d++) {
1327 hexagon_first(&hexit, x0, y0, d, &x1, &y1);
1329 off1 = XYOFFSET(x1, y1);
1330 elevation = elev[off1] + sign * (r * r - d * d);
1331 elev[off1] = LIMIT_TO(elevation, SHRT_MIN, SHRT_MAX);
1333 } while (hexagon_next(&hexit, &x1, &y1));
1341 int *off = malloc(MAX(sc, is * 2) * sizeof(*off));
1342 int max_nm = (pm * MAX(sc, is * 2)) / 100;
1343 int c, nm, i0, n, i;
1344 double elevation, delta;
1346 for (c = 0; c < nc + ni; c++) {
1347 nm = (pm * isecs[c]) / 100;
1348 i0 = c < nc ? 2 : 0;
1350 for (i = 0; i < i0; i++)
1351 elev[XYOFFSET(sect[c][i].x, sect[c][i].y)] = PLATMIN;
1352 for (i = 0; i < n; i++)
1353 off[i] = XYOFFSET(sect[c][i0 + i].x, sect[c][i0 + i].y);
1354 qsort(off, n, sizeof(*off), elev_cmp);
1355 delta = (double)(HIGHMIN - LANDMIN - 1) / (n - nm - 1);
1356 elevation = LANDMIN;
1357 for (i = 0; i < n - nm; i++) {
1358 elev[off[i]] = (int)(elevation + 0.5);
1361 elevation = HIGHMIN;
1362 delta = (127.0 - HIGHMIN) / max_nm;
1363 for (; i < n; i++) {
1365 elev[off[i]] = (int)(elevation + 0.5);
1378 for (i = 0; i < WORLD_SZ(); i++) {
1383 for (i = 0; i < WORLD_SZ(); i++) {
1385 elev[i] = -1 - 126 * elev[i] / min;
1390 elev_to_sct_type(int elevation)
1392 if (elevation < LANDMIN)
1394 if (elevation < HIGHMIN)
1399 /****************************************************************************
1401 ****************************************************************************/
1404 * Map elevation @elev to a resource value according to @conf.
1405 * This is a linear interpolation on the data points in @conf.
1408 elev_to_resource(int elev, struct resource_point conf[])
1410 int i, elev1, elev2, delev, res1, res2, dres;
1412 for (i = 1; elev > conf[i].elev; i++) ;
1413 assert(conf[i - 1].elev <= elev);
1415 elev1 = conf[i - 1].elev;
1416 elev2 = conf[i].elev;
1417 delev = elev2 - elev1;
1418 res1 = conf[i - 1].res;
1421 return (int)(res1 + (double)((elev - elev1) * dres) / delev);
1425 add_resources(struct sctstr *sct)
1427 sct->sct_min = elev_to_resource(sct->sct_elev, iron_conf);
1428 sct->sct_gmin = elev_to_resource(sct->sct_elev, gold_conf);
1429 sct->sct_fertil = elev_to_resource(sct->sct_elev, fert_conf);
1430 sct->sct_oil = elev_to_resource(sct->sct_elev, oil_conf);
1431 sct->sct_uran = elev_to_resource(sct->sct_elev, uran_conf);
1434 /****************************************************************************
1435 DESIGNATE THE SECTORS
1436 ****************************************************************************/
1444 for (i = 0; i < WORLD_SZ(); i++) {
1446 sp->sct_elev = elev[i];
1447 sp->sct_type = elev_to_sct_type(sp->sct_elev);
1448 sp->sct_newtype = sp->sct_type;
1449 sp->sct_dterr = own[i] + 1;
1450 sp->sct_coastal = is_coastal(sp->sct_x, sp->sct_y);
1455 /****************************************************************************
1456 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1457 ****************************************************************************/
1461 int sx, sy, x, y, off, c, type;
1464 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1469 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1471 off = XYOFFSET(x, y);
1473 type = elev_to_sct_type(elev[off]);
1474 if (type == SCT_WATER)
1476 else if (type == SCT_MOUNT)
1481 assert(0 <= c && c < nc);
1482 if ((x == cap[c].x || x == new_x(cap[c].x + 2))
1484 printf("%c ", numletter[c % 62]);
1494 * Print a map to help visualize own[].
1495 * This is for debugging.
1500 int sx, sy, x, y, off;
1502 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1505 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1507 off = XYOFFSET(x, y);
1510 else if (own[off] == -1)
1513 putchar(numletter[own[off] % 62]);
1520 * Print a map to help visualize elev[].
1521 * This is for debugging. It expects the terminal to understand
1522 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1525 print_elev_map(void)
1527 int sx, sy, x, y, off, sat;
1529 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1532 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1534 off = XYOFFSET(x, y);
1537 else if (!elev[off])
1539 else if (elev[off] < 0) {
1540 sat = 256 + elev[off] * 2;
1541 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1542 } else if (elev[off] < HIGHMIN / 2) {
1543 sat = (HIGHMIN / 2 - elev[off]) * 4;
1544 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1545 } else if (elev[off] < HIGHMIN) {
1546 sat = 128 + (HIGHMIN - elev[off]) * 2;
1547 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1549 sat = 128 + (elev[off] - HIGHMIN) * 2;
1550 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1558 * Print a map to help visualize xzone[].
1559 * This is for debugging.
1562 print_xzone_map(void)
1564 int sx, sy, x, y, off;
1566 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1569 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1571 off = XYOFFSET(x, y);
1574 else if (own[off] >= 0)
1576 else if (xzone[off] >= 0)
1577 putchar(numletter[xzone[off] % 62]);
1579 assert(own[off] == -1);
1580 putchar(xzone[off] == -1 ? '.' : '!');
1588 * Print a map to help visualize closest[].
1589 * This is for debugging.
1592 print_closest_map(void)
1594 int sx, sy, x, y, off;
1596 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1599 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1601 off = XYOFFSET(x, y);
1604 else if (closest[off] == (natid)-1)
1606 else if (!distance[off]) {
1607 assert(closest[off] == own[off]);
1610 putchar(numletter[closest[off] % 62]);
1618 print_distance_map(void)
1620 int sx, sy, x, y, off;
1622 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1625 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1627 off = XYOFFSET(x, y);
1630 else if (closest[off] == (natid)-1)
1632 else if (!distance[off]) {
1633 assert(closest[off] == own[off]);
1636 putchar(numletter[distance[off] % 62]);
1644 /***************************************************************************
1645 WRITE A SCRIPT FOR PLACING CAPITALS
1646 ****************************************************************************/
1648 write_newcap_script(void)
1651 FILE *script = fopen(outfile, "w");
1654 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1655 program_name, outfile, strerror(errno));
1659 for (c = 0; c < nc; ++c) {
1660 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1661 fprintf(script, "newcap %d %d,%d\n", c + 1, cap[c].x, cap[c].y);
1663 fprintf(script, "add %d visitor visitor v\n", c + 1);
1669 qprint(const char *const fmt, ...)
1675 vfprintf(stdout, fmt, ap);