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, obeying the minimum
49 * distance between continents, until they have the specified size.
51 * The kind of shape they grow into is determined by the "spike
52 * percentage" --- the higher the spike, the more spindly they will
53 * be. If you lower the spike, the continents will be more round.
55 * If growing fails due to lack of room, start over. If it fails too
56 * many times, give up and terminate unsuccessfully.
58 * 3. Place and grow additional islands
60 * Place and grow islands one after the other. Place the first sector
61 * randomly, pick an island size, then grow the island to that size.
63 * Growing works as for continents, except the minimum distance for
64 * additional islands applies, and growing simply stops when there is
67 * 4. Compute elevation
69 * Elevate islands one after the other.
71 * First, place the specified number of mountains randomly.
72 * Probability increases with distance to sea.
74 * Last, elevate mountains and the capitals. Pick coastal mountain
75 * elevation randomly from an interval of medium elevations reserved
76 * for them. Pick non-coastal mountain elevation randomly from an
77 * interval of high elevation reserved for them. Set capital
78 * elevation to a fixed, medium value.
80 * In between, elevate the remaining land one by one, working from
81 * mountains towards the sea, and from the elevation just below the
82 * non-coastal mountains' interval linearly down to 1, avoiding the
83 * coastal mountains' interval.
85 * This gives islands of the same size the same set of elevations,
86 * except for mountains.
88 * Elevate sea: pick a random depth from an interval that deepens with
89 * the distance to land.
93 * Sector resources are simple functions of elevation. You can alter
94 * macros OIL_MAX, IRON_MIN, GOLD_MIN, FERT_MAX, and URAN_MIN to
107 #include "prototypes.h"
112 /* The following five numbers refer to elevation under which (in the case of
113 fertility or oil) or over which (in the case of iron, gold, and uranium)
114 sectors with that elevation will contain that resource. Elevation ranges
117 /* raise FERT_MAX for more fertility */
120 /* raise OIL_MAX for more oil */
123 /* lower IRON_MIN for more iron */
126 /* lower GOLD_MIN for more gold */
129 /* lower URAN_MIN for more uranium */
132 /* do not change these 4 defines */
133 #define LANDMIN 1 /* plate altitude for normal land */
134 #define HILLMIN 34 /* plate altitude for hills */
135 #define PLATMIN 36 /* plate altitude for plateau */
136 #define HIGHMIN 98 /* plate altitude for mountains */
138 static void qprint(const char * const fmt, ...)
139 ATTRIBUTE((format (printf, 1, 2)));
142 * Program arguments and options
144 static char *program_name;
145 static int nc, sc; /* number and size of continents */
146 static int ni, is; /* number and size of islands */
147 #define DEFAULT_SPIKE 10
148 static int sp = DEFAULT_SPIKE; /* spike percentage */
149 #define DEFAULT_MOUNTAIN 0
150 static int pm = DEFAULT_MOUNTAIN; /* mountain percentage */
151 #define DEFAULT_CONTDIST 2
152 static int di = DEFAULT_CONTDIST; /* min. distance between continents */
153 #define DEFAULT_ISLDIST 1
154 static int id = DEFAULT_ISLDIST; /* ... continents and islands */
155 /* don't let the islands crash into each other.
156 1 = don't merge, 0 = merge. */
157 static int DISTINCT_ISLANDS = 1;
159 #define DEFAULT_OUTFILE_NAME "newcap_script"
160 static const char *outfile = DEFAULT_OUTFILE_NAME;
162 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
163 #define INFINITY 999 /* a number which means "BIG" */
165 /* these defines prevent infinite loops:
168 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
169 when growing continents and islands */
170 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
171 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
172 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
177 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
178 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
180 static int secs; /* number of sectors grown */
181 static int ctot; /* total number of continents and islands grown */
182 static int *isecs; /* array of how large each island is */
184 static int *capx, *capy; /* location of the nc capitals */
185 static int *mc, mcc; /* array and counter used for stability
186 check when perturbing */
187 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
188 static int diry[] = { 0, -1, -1, 0, 1, 1 };
190 static int **own; /* owner of the sector. -1 means water */
191 static int **elev; /* elevation of the sectors */
192 static int **sectx, **secty; /* the sectors for each continent */
193 static int **sectc; /* which sectors are on the coast? */
194 static int *vector; /* used for measuring distances */
195 static int *weight; /* used for placing mountains */
196 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
197 static int fl_status; /* is anything wrong? */
198 #define STATUS_NO_ROOM 1 /* there was no room to grow */
199 #define NUMTRIES 10 /* keep trying to grow this many times */
201 static const char *numletter =
202 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
204 static void help(char *);
205 static void usage(void);
206 static void parse_args(int argc, char *argv[]);
207 static void allocate_memory(void);
208 static void init(void);
209 static int drift(void);
210 static void grow_continents(void);
211 static void create_elevations(void);
212 static void write_sects(void);
213 static void output(void);
214 static int write_newcap_script(void);
215 static int stable(void);
216 static void elevate_land(void);
217 static void elevate_sea(void);
218 static void set_coastal_flags(void);
220 static void print_vars(void);
221 static void fl_move(int);
222 static void grow_islands(void);
224 /* Debugging aids: */
225 void print_own_map(void);
226 void print_elev_map(void);
228 /****************************************************************************
230 ****************************************************************************/
233 main(int argc, char *argv[])
236 char *config_file = NULL;
238 unsigned rnd_seed = 0;
241 program_name = argv[0];
243 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
246 config_file = optarg;
249 DISTINCT_ISLANDS = 0;
255 rnd_seed = strtoul(optarg, NULL, 10);
265 printf("%s\n\n%s", version, legal);
274 rnd_seed = pick_seed();
277 if (emp_config(config_file) < 0)
281 parse_args(argc - optind, argv + optind);
286 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
287 qprint("seed is %u\n", rnd_seed);
291 qprint("\ntry #%d (out of %d)...\n", i + 1, NUMTRIES);
292 qprint("placing capitals...\n");
294 qprint("unstable drift\n");
295 qprint("growing continents...\n");
297 } while (fl_status && ++i < NUMTRIES);
299 fprintf(stderr, "%s: world not large enough to hold continents\n",
303 qprint("growing islands:");
305 qprint("\nelevating land...\n");
308 qprint("writing to sectors file...\n");
309 if (!write_newcap_script())
311 if (chdir(gamedir)) {
312 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
313 program_name, gamedir, strerror(errno));
316 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
319 if (!ef_close(EF_SECTOR))
323 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
333 puts("Creating a planet with:\n");
334 printf("%d continents\n", nc);
335 printf("continent size: %d\n", sc);
336 printf("number of islands: %d\n", ni);
337 printf("average size of islands: %d\n", is);
338 printf("spike: %d%%\n", sp);
339 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
340 pm, (pm * sc) / 100);
341 printf("minimum distance between continents: %d\n", di);
342 printf("minimum distance from islands to continents: %d\n", id);
343 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
347 help(char *complaint)
350 fprintf(stderr, "%s: %s\n", program_name, complaint);
351 fprintf(stderr, "Try -h for help.\n");
357 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
358 " -e CONFIG-FILE configuration file\n"
360 " -i islands may merge\n"
362 " -R SEED seed for random number generator\n"
363 " -s SCRIPT name of script to create (default %s)\n"
364 " -h display this help and exit\n"
365 " -v display version information and exit\n"
366 " NC number of continents\n"
367 " SC continent size\n"
368 " NI number of islands (default NC)\n"
369 " IS average island size (default SC/2)\n"
370 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
371 " PM percentage of land that is mountain (default %d)\n"
372 " DI minimum distance between continents (default %d)\n"
373 " ID minimum distance from islands to continents (default %d)\n",
374 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
375 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
379 parse_args(int argc, char *argv[])
381 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
384 help("missing arguments");
388 help("too many arguments");
393 fprintf(stderr, "%s: number of continents must be > 0\n",
400 fprintf(stderr, "%s: size of continents must be > 1\n",
411 fprintf(stderr, "%s: number of islands must be >= 0\n",
419 fprintf(stderr, "%s: size of islands must be > 0\n",
426 if (sp < 0 || sp > 100) {
428 "%s: spike percentage must be between 0 and 100\n",
435 if (pm < 0 || pm > 100) {
437 "%s: mountain percentage must be between 0 and 100\n",
445 fprintf(stderr, "%s: distance between continents must be >= 0\n",
450 fprintf(stderr, "%s: distance between continents too large\n",
459 "%s: distance from islands to continents must be >= 0\n",
465 "%s: distance from islands to continents too large\n",
471 /****************************************************************************
472 VARIABLE INITIALIZATION
473 ****************************************************************************/
476 allocate_memory(void)
480 capx = calloc(nc, sizeof(int));
481 capy = calloc(nc, sizeof(int));
482 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
483 mc = calloc(STABLE_CYCLE, sizeof(int));
484 own = calloc(WORLD_X, sizeof(int *));
485 elev = calloc(WORLD_X, sizeof(int *));
486 for (i = 0; i < WORLD_X; ++i) {
487 own[i] = calloc(WORLD_Y, sizeof(int));
488 elev[i] = calloc(WORLD_Y, sizeof(int));
490 sectx = calloc(nc + ni, sizeof(int *));
491 secty = calloc(nc + ni, sizeof(int *));
492 sectc = calloc(nc + ni, sizeof(int *));
493 isecs = calloc(nc + ni, sizeof(int));
494 weight = calloc(MAX(sc, is * 2), sizeof(int));
495 dsea = calloc(MAX(sc, is * 2), sizeof(int));
496 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
497 for (i = 0; i < nc; ++i) {
498 sectx[i] = calloc(sc, sizeof(int));
499 secty[i] = calloc(sc, sizeof(int));
500 sectc[i] = calloc(sc, sizeof(int));
502 for (i = nc; i < nc + ni; ++i) {
503 sectx[i] = calloc(is * 2, sizeof(int));
504 secty[i] = calloc(is * 2, sizeof(int));
505 sectc[i] = calloc(is * 2, sizeof(int));
513 int i, j, xx = 0, yy = 0;
518 for (i = 0; i < WORLD_X; ++i) {
519 for (j = 0; j < WORLD_Y; ++j) {
521 elev[i][j] = -INFINITY;
525 for (i = 0; i < nc; ++i) {
531 "%s: world not big enough for all the continents\n",
540 for (i = 0; i < STABLE_CYCLE; ++i)
544 /****************************************************************************
545 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
546 ****************************************************************************/
548 /* How isolated is capital j?
551 iso(int j, int newx, int newy)
553 int i, md, d = WORLD_X + WORLD_Y;
555 for (i = 0; i < nc; ++i) {
558 md = mapdist(capx[i], capy[i], newx, newy);
566 /* Drift all the capitals
573 for (turns = 0; turns < DRIFT_MAX; ++turns) {
574 if (turns > DRIFT_BEFORE_CHECK && stable())
576 for (i = 0; i < nc; ++i)
582 /* Check to see if we have stabilized--can we stop drifting the capitals?
588 int i, isod, d = 0, stab = 1;
590 for (i = 0; i < nc; ++i) {
591 isod = iso(i, capx[i], capy[i]);
595 for (i = 0; i < STABLE_CYCLE; ++i)
599 mcc = (mcc + 1) % STABLE_CYCLE;
603 /* This routine does the actual drifting
609 int i, n, newx, newy;
611 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
612 newx = new_x(capx[j] + dirx[i]);
613 newy = new_y(capy[j] + diry[i]);
614 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
622 /****************************************************************************
624 ****************************************************************************/
626 /* Look for a coastal sector of continent c
634 for (i = 0; i < secs; ++i) {
636 for (j = 0; j < 6; ++j)
637 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
642 /* Used for measuring distances
654 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
657 return i > 1 || vector[0] > 0;
660 /* Test to see if we're allowed to grow there: the arguments di and id
663 try_to_grow(int c, int newx, int newy, int d)
667 for (i = 1; i <= d; ++i) {
668 for (j = 0; j < i; ++j)
673 for (j = 0; j < i; ++j) {
674 px = new_x(px + dirx[vector[j]]);
675 py = new_y(py + diry[vector[j]]);
677 if (own[px][py] != -1 &&
679 (DISTINCT_ISLANDS || own[px][py] < nc))
681 } while (next_vector(i));
683 sectx[c][secs] = newx;
684 secty[c][secs] = newy;
690 /* Move along the coast in a clockwise direction.
694 next_coast(int c, int x, int y, int *xp, int *yp)
696 int i, nx, ny, wat = 0;
704 for (i = 0; i < 12; ++i) {
705 nx = new_x(x + dirx[i % 6]);
706 ny = new_y(y + diry[i % 6]);
707 if (own[nx][ny] == -1)
709 if (wat && own[nx][ny] == c) {
717 /* Choose a sector to grow from
721 new_try(int c, int spike)
729 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
734 } while (i != starti);
741 /* Grow continent c by 1 sector
745 grow_one_sector(int c)
747 int spike = roll0(100) < sp;
748 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
750 if ((try1 = new_try(c, spike)) == -1)
752 x = sx = sectx[c][try1];
753 y = sy = secty[c][try1];
758 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
759 newx = new_x(x + dirx[i]);
760 newy = new_y(y + diry[i]);
761 if (own[newx][newy] == -1 &&
763 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
764 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
765 if (try_to_grow(c, newx, newy, c < nc ? di : id))
769 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
770 newx = new_x(x + dirx[i]);
771 newy = new_y(y + diry[i]);
772 if (own[newx][newy] == -1)
773 if (try_to_grow(c, newx, newy, c < nc ? di : id))
776 next_coast(c, x, y, &x, &y);
778 } while (!done && coast_search < COAST_SEARCH_MAX &&
779 (secs == 1 || x != sx || y != sy));
781 fl_status |= STATUS_NO_ROOM;
785 /* Grow all the continents
788 grow_continents(void)
792 for (c = 0; c < nc; ++c) {
793 sectx[c][0] = capx[c];
794 secty[c][0] = capy[c];
795 own[sectx[c][0]][secty[c][0]] = c;
796 sectx[c][1] = new_x(capx[c] + 2);
797 secty[c][1] = capy[c];
798 own[sectx[c][1]][secty[c][1]] = c;
802 for (secs = 2; secs < sc && !fl_status; ++secs) {
803 for (c = 0; c < nc; ++c) {
808 for (c = 0; c < nc; ++c)
812 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
816 /****************************************************************************
818 ****************************************************************************/
820 /* Choose a place to start growing an island from
823 place_island(int c, int *xp, int *yp)
826 int ssy = roll0(WORLD_Y);
827 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
829 if (ssx > WORLD_X - 2)
830 ssx = new_x(ssx + 2);
831 for (d = di + id; d >= id; --d) {
835 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
836 if (*xp >= WORLD_X) {
837 *yp = new_y(*yp + 1);
839 if (*xp == sx && *yp == sy)
842 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
849 /* Grow all the islands
857 for (c = nc; c < nc + ni; ++c) {
859 if (!place_island(c, &x, &y))
861 isiz = roll(is) + roll0(is);
865 } while (secs < isiz && grow_one_sector(c));
867 qprint(" %d(%d)", c - nc + 1, secs);
872 /****************************************************************************
874 ****************************************************************************/
876 create_elevations(void)
882 /* Generic function for finding the distance to the closest sea, land, or
886 distance_to_what(int x, int y, int flag)
890 for (d = 1; d < 5; ++d) {
891 for (j = 0; j < d; ++j)
896 for (j = 0; j < d; ++j) {
897 px = new_x(px + dirx[vector[j]]);
898 py = new_y(py + diry[vector[j]]);
901 case 0: /* distance to sea */
902 if (own[px][py] == -1)
905 case 1: /* distance to land */
906 if (own[px][py] != -1)
909 case 2: /* distance to mountain */
910 if (elev[px][py] == INFINITY)
914 } while (next_vector(d));
919 #define ELEV elev[sectx[c][i]][secty[c][i]]
920 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
921 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
923 /* Decide where the mountains go
928 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
931 for (c = 0; c < ctot; ++c) {
934 nm = (pm * ns) / 100;
936 /* Place the mountains */
938 for (i = 0; i < ns; ++i) {
939 dsea[i] = distance_to_sea();
940 weight[i] = (total += (dsea[i] * dsea[i]));
943 for (k = nm, mountain_search = 0;
944 k && mountain_search < MOUNTAIN_SEARCH_MAX;
947 for (i = 0; i < ns; ++i)
948 if (r < weight[i] && ELEV == -INFINITY &&
950 ((!(capx[c] == sectx[c][i] &&
951 capy[c] == secty[c][i])) &&
952 (!(new_x(capx[c] + 2) == sectx[c][i] &&
953 capy[c] == secty[c][i]))))) {
960 /* Elevate land that is not mountain and not capital */
962 for (i = 0; i < ns; ++i)
963 dmoun[i] = distance_to_mountain();
964 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
965 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
967 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
970 for (i = 0; i < ns; ++i) {
971 if (ELEV != INFINITY &&
972 (c >= nc || ((!(capx[c] == sectx[c][i] &&
973 capy[c] == secty[c][i])) &&
974 (!(new_x(capx[c] + 2) == sectx[c][i] &&
975 capy[c] == secty[c][i]))))) {
976 h = 3 * (5 - dmoun[i]) + dsea[i];
986 if (newk >= HILLMIN && newk < PLATMIN)
990 elev[sectx[c][where]][secty[c][where]] = newk;
991 dsea[where] = -INFINITY;
992 dmoun[where] = INFINITY;
995 /* Elevate the mountains and capitals */
997 for (i = 0; i < ns; ++i) {
998 if (ELEV == INFINITY) {
1000 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1002 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1003 roll0((256 - HIGHMIN) / 2);
1004 } else if (c < nc &&
1005 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1006 ((new_x(capx[c] + 2) == sectx[c][i] &&
1007 capy[c] == secty[c][i]))))
1013 #define distance_to_land() distance_to_what(x, y, 1)
1020 for (y = 0; y < WORLD_Y; ++y) {
1021 for (x = y % 2; x < WORLD_X; x += 2) {
1022 if (elev[x][y] == -INFINITY)
1023 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1029 elev_to_sct_type(int elevation)
1031 if (elevation < LANDMIN)
1033 if (elevation < HILLMIN)
1035 if (elevation < PLATMIN)
1037 if (elevation < HIGHMIN)
1042 /****************************************************************************
1044 ****************************************************************************/
1051 fert = LANDMIN - e + 40;
1052 else if (e < FERT_MAX)
1053 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1064 oil = (LANDMIN - e) * 2 + roll0(2);
1065 else if (e <= OIL_MAX)
1066 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1076 if (e >= IRON_MIN && e < HIGHMIN)
1077 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1087 if (e >= GOLD_MIN) {
1089 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1091 gold = 100 - 20 * HIGHMIN / e;
1102 if (e >= URAN_MIN && e < HIGHMIN)
1103 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1110 add_resources(struct sctstr *sct)
1112 sct->sct_fertil = set_fert(sct->sct_elev);
1113 sct->sct_oil = set_oil(sct->sct_elev);
1114 sct->sct_min = set_iron(sct->sct_elev);
1115 sct->sct_gmin = set_gold(sct->sct_elev);
1116 sct->sct_uran = set_uran(sct->sct_elev);
1119 /****************************************************************************
1120 DESIGNATE THE SECTORS
1121 ****************************************************************************/
1129 for (y = 0; y < WORLD_Y; y++) {
1130 for (x = y % 2; x < WORLD_X; x += 2) {
1131 sct = getsectp(x, y);
1132 sct->sct_elev = elev[x][y];
1133 sct->sct_type = elev_to_sct_type(elev[x][y]);
1134 sct->sct_newtype = sct->sct_type;
1135 sct->sct_dterr = own[sct->sct_x][y] + 1;
1139 set_coastal_flags();
1142 /****************************************************************************
1143 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1144 ****************************************************************************/
1148 int sx, sy, x, y, c, type;
1151 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1156 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1159 type = elev_to_sct_type(elev[x][y]);
1160 if (type == SCT_WATER)
1162 else if (type == SCT_MOUNT)
1167 assert(0 <= c && c < nc);
1168 if ((x == capx[c] || x == new_x(capx[c] + 2))
1170 printf("%c ", numletter[c % 62]);
1180 * Print a map to help visualize own[][].
1181 * This is for debugging.
1188 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1191 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1195 else if (own[x][y] == -1)
1198 putchar(numletter[own[x][y] % 62]);
1205 * Print a map to help visualize elev[][].
1206 * This is for debugging. It expects the terminal to understand
1207 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1210 print_elev_map(void)
1212 int sx, sy, x, y, sat;
1214 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1217 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1221 else if (!elev[x][y])
1223 else if (elev[x][y] < 0) {
1224 sat = 256 + elev[x][y] * 2;
1225 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1226 } else if (elev[x][y] < HIGHMIN / 2) {
1227 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1228 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1229 } else if (elev[x][y] < HIGHMIN) {
1230 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1231 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1233 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1234 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1241 /***************************************************************************
1242 WRITE A SCRIPT FOR PLACING CAPITALS
1243 ****************************************************************************/
1245 write_newcap_script(void)
1248 FILE *script = fopen(outfile, "w");
1251 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1252 program_name, outfile, strerror(errno));
1256 for (c = 0; c < nc; ++c) {
1257 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1258 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1260 fprintf(script, "add %d visitor visitor v\n", c + 1);
1266 qprint(const char *const fmt, ...)
1272 vfprintf(stdout, fmt, ap);
1278 set_coastal_flags(void)
1283 for (i = 0; i < nc + ni; ++i) {
1284 for (j = 0; j < isecs[i]; j++) {
1285 sp = getsectp(sectx[i][j], secty[i][j]);
1286 sp->sct_coastal = sectc[i][j];