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 spike; /* are we spiking? */
188 static int mind; /* the final distance between capitals that
190 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
191 static int diry[] = { 0, -1, -1, 0, 1, 1 };
193 static int **own; /* owner of the sector. -1 means water */
194 static int **elev; /* elevation of the sectors */
195 static int **sectx, **secty; /* the sectors for each continent */
196 static int **sectc; /* which sectors are on the coast? */
197 static int *vector; /* used for measuring distances */
198 static int *weight; /* used for placing mountains */
199 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
200 static int fl_status; /* is anything wrong? */
201 #define STATUS_NO_ROOM 1 /* there was no room to grow */
202 #define NUMTRIES 10 /* keep trying to grow this many times */
204 static const char *numletter =
205 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
207 static void help(char *);
208 static void usage(void);
209 static void parse_args(int argc, char *argv[]);
210 static void allocate_memory(void);
211 static void init(void);
212 static int drift(void);
213 static void grow_continents(void);
214 static void create_elevations(void);
215 static void write_sects(void);
216 static void output(void);
217 static int write_newcap_script(void);
218 static int stable(void);
219 static void elevate_land(void);
220 static void elevate_sea(void);
221 static void set_coastal_flags(void);
223 static void print_vars(void);
224 static void fl_move(int);
225 static void grow_islands(void);
227 /* Debugging aids: */
228 void print_own_map(void);
229 void print_elev_map(void);
231 /****************************************************************************
233 ****************************************************************************/
236 main(int argc, char *argv[])
239 char *config_file = NULL;
241 unsigned rnd_seed = 0;
244 program_name = argv[0];
246 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
249 config_file = optarg;
252 DISTINCT_ISLANDS = 0;
258 rnd_seed = strtoul(optarg, NULL, 10);
268 printf("%s\n\n%s", version, legal);
277 rnd_seed = pick_seed();
280 if (emp_config(config_file) < 0)
284 parse_args(argc - optind, argv + optind);
289 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
290 qprint("seed is %u\n", rnd_seed);
294 qprint("\ntry #%d (out of %d)...\n", i + 1, NUMTRIES);
295 qprint("placing capitals...\n");
297 qprint("unstable drift\n");
298 qprint("growing continents...\n");
300 } while (fl_status && ++i < NUMTRIES);
302 fprintf(stderr, "%s: world not large enough to hold continents\n",
306 qprint("growing islands:");
308 qprint("\nelevating land...\n");
311 qprint("writing to sectors file...\n");
312 if (!write_newcap_script())
314 if (chdir(gamedir)) {
315 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
316 program_name, gamedir, strerror(errno));
319 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
322 if (!ef_close(EF_SECTOR))
326 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
336 puts("Creating a planet with:\n");
337 printf("%d continents\n", nc);
338 printf("continent size: %d\n", sc);
339 printf("number of islands: %d\n", ni);
340 printf("average size of islands: %d\n", is);
341 printf("spike: %d%%\n", sp);
342 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
343 pm, (pm * sc) / 100);
344 printf("minimum distance between continents: %d\n", di);
345 printf("minimum distance from islands to continents: %d\n", id);
346 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
350 help(char *complaint)
353 fprintf(stderr, "%s: %s\n", program_name, complaint);
354 fprintf(stderr, "Try -h for help.\n");
360 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
361 " -e CONFIG-FILE configuration file\n"
363 " -i islands may merge\n"
365 " -R SEED seed for random number generator\n"
366 " -s SCRIPT name of script to create (default %s)\n"
367 " -h display this help and exit\n"
368 " -v display version information and exit\n"
369 " NC number of continents\n"
370 " SC continent size\n"
371 " NI number of islands (default NC)\n"
372 " IS average island size (default SC/2)\n"
373 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
374 " PM percentage of land that is mountain (default %d)\n"
375 " DI minimum distance between continents (default %d)\n"
376 " ID minimum distance from islands to continents (default %d)\n",
377 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
378 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
382 parse_args(int argc, char *argv[])
384 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
387 help("missing arguments");
391 help("too many arguments");
396 fprintf(stderr, "%s: number of continents must be > 0\n",
403 fprintf(stderr, "%s: size of continents must be > 1\n",
414 fprintf(stderr, "%s: number of islands must be >= 0\n",
422 fprintf(stderr, "%s: size of islands must be > 0\n",
429 if (sp < 0 || sp > 100) {
431 "%s: spike percentage must be between 0 and 100\n",
438 if (pm < 0 || pm > 100) {
440 "%s: mountain percentage must be between 0 and 100\n",
448 fprintf(stderr, "%s: distance between continents must be >= 0\n",
453 fprintf(stderr, "%s: distance between continents too large\n",
462 "%s: distance from islands to continents must be >= 0\n",
468 "%s: distance from islands to continents too large\n",
474 /****************************************************************************
475 VARIABLE INITIALIZATION
476 ****************************************************************************/
479 allocate_memory(void)
483 capx = calloc(nc, sizeof(int));
484 capy = calloc(nc, sizeof(int));
485 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
486 mc = calloc(STABLE_CYCLE, sizeof(int));
487 own = calloc(WORLD_X, sizeof(int *));
488 elev = calloc(WORLD_X, sizeof(int *));
489 for (i = 0; i < WORLD_X; ++i) {
490 own[i] = calloc(WORLD_Y, sizeof(int));
491 elev[i] = calloc(WORLD_Y, sizeof(int));
493 sectx = calloc(nc + ni, sizeof(int *));
494 secty = calloc(nc + ni, sizeof(int *));
495 sectc = calloc(nc + ni, sizeof(int *));
496 isecs = calloc(nc + ni, sizeof(int));
497 weight = calloc(MAX(sc, is * 2), sizeof(int));
498 dsea = calloc(MAX(sc, is * 2), sizeof(int));
499 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
500 for (i = 0; i < nc; ++i) {
501 sectx[i] = calloc(sc, sizeof(int));
502 secty[i] = calloc(sc, sizeof(int));
503 sectc[i] = calloc(sc, sizeof(int));
505 for (i = nc; i < nc + ni; ++i) {
506 sectx[i] = calloc(is * 2, sizeof(int));
507 secty[i] = calloc(is * 2, sizeof(int));
508 sectc[i] = calloc(is * 2, sizeof(int));
516 int i, j, xx = 0, yy = 0;
521 for (i = 0; i < WORLD_X; ++i) {
522 for (j = 0; j < WORLD_Y; ++j) {
524 elev[i][j] = -INFINITY;
528 for (i = 0; i < nc; ++i) {
534 "%s: world not big enough for all the continents\n",
543 for (i = 0; i < STABLE_CYCLE; ++i)
547 /****************************************************************************
548 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
549 ****************************************************************************/
551 /* How isolated is capital j?
554 iso(int j, int newx, int newy)
556 int i, md, d = WORLD_X + WORLD_Y;
558 for (i = 0; i < nc; ++i) {
561 md = mapdist(capx[i], capy[i], newx, newy);
569 /* Drift all the capitals
576 for (turns = 0; turns < DRIFT_MAX; ++turns) {
577 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
579 for (i = 0; i < nc; ++i)
585 /* Check to see if we have stabilized--can we stop drifting the capitals?
591 int i, isod, d = 0, stab = 1;
593 for (i = 0; i < nc; ++i) {
594 isod = iso(i, capx[i], capy[i]);
598 for (i = 0; i < STABLE_CYCLE; ++i)
602 mcc = (mcc + 1) % STABLE_CYCLE;
606 /* This routine does the actual drifting
612 int i, n, newx, newy;
614 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
615 newx = new_x(capx[j] + dirx[i]);
616 newy = new_y(capy[j] + diry[i]);
617 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
625 /****************************************************************************
627 ****************************************************************************/
629 /* Look for a coastal sector of continent c
637 for (i = 0; i < secs; ++i) {
639 for (j = 0; j < 6; ++j)
640 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
645 /* Used for measuring distances
657 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
660 return i > 1 || vector[0] > 0;
663 /* Test to see if we're allowed to grow there: the arguments di and id
666 try_to_grow(int c, int newx, int newy, int d)
670 for (i = 1; i <= d; ++i) {
671 for (j = 0; j < i; ++j)
676 for (j = 0; j < i; ++j) {
677 px = new_x(px + dirx[vector[j]]);
678 py = new_y(py + diry[vector[j]]);
680 if (own[px][py] != -1 &&
682 (DISTINCT_ISLANDS || own[px][py] < nc))
684 } while (next_vector(i));
686 sectx[c][secs] = newx;
687 secty[c][secs] = newy;
692 /* Move along the coast in a clockwise direction.
696 next_coast(int c, int x, int y, int *xp, int *yp)
698 int i, nx, ny, wat = 0;
706 for (i = 0; i < 12; ++i) {
707 nx = new_x(x + dirx[i % 6]);
708 ny = new_y(y + diry[i % 6]);
709 if (own[nx][ny] == -1)
711 if (wat && own[nx][ny] == c) {
719 /* Choose a sector to grow from
731 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
736 } while (i != starti);
743 /* Grow continent c by 1 sector
747 grow_one_sector(int c)
749 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
751 spike = roll0(100) < sp;
752 if ((try1 = new_try(c)) == -1)
754 x = sx = sectx[c][try1];
755 y = sy = secty[c][try1];
760 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
761 newx = new_x(x + dirx[i]);
762 newy = new_y(y + diry[i]);
763 if (own[newx][newy] == -1 &&
765 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
766 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
767 if (try_to_grow(c, newx, newy, c < nc ? di : id))
771 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
772 newx = new_x(x + dirx[i]);
773 newy = new_y(y + diry[i]);
774 if (own[newx][newy] == -1)
775 if (try_to_grow(c, newx, newy, c < nc ? di : id))
778 next_coast(c, x, y, &x, &y);
780 } while (!done && coast_search < COAST_SEARCH_MAX &&
781 (secs == 1 || x != sx || y != sy));
783 fl_status |= STATUS_NO_ROOM;
787 /* Grow all the continents
790 grow_continents(void)
794 for (c = 0; c < nc; ++c) {
795 sectx[c][0] = capx[c];
796 secty[c][0] = capy[c];
797 own[sectx[c][0]][secty[c][0]] = c;
798 sectx[c][1] = new_x(capx[c] + 2);
799 secty[c][1] = capy[c];
800 own[sectx[c][1]][secty[c][1]] = c;
803 for (secs = 2; secs < sc && !fl_status; ++secs) {
804 for (c = 0; c < nc; ++c) {
809 for (c = 0; c < nc; ++c)
813 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
817 /****************************************************************************
819 ****************************************************************************/
821 /* Choose a place to start growing an island from
824 place_island(int c, int *xp, int *yp)
827 int ssy = roll0(WORLD_Y);
828 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
830 if (ssx > WORLD_X - 2)
831 ssx = new_x(ssx + 2);
832 for (d = di + id; d >= id; --d) {
836 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
837 if (*xp >= WORLD_X) {
838 *yp = new_y(*yp + 1);
840 if (*xp == sx && *yp == sy)
843 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
850 /* Grow all the islands
858 for (c = nc; c < nc + ni; ++c) {
860 if (!place_island(c, &x, &y))
862 isiz = roll(is) + roll0(is);
866 } while (secs < isiz && grow_one_sector(c));
868 qprint(" %d(%d)", c - nc + 1, secs);
874 /****************************************************************************
876 ****************************************************************************/
878 create_elevations(void)
884 /* Generic function for finding the distance to the closest sea, land, or
888 distance_to_what(int x, int y, int flag)
892 for (d = 1; d < 5; ++d) {
893 for (j = 0; j < d; ++j)
898 for (j = 0; j < d; ++j) {
899 px = new_x(px + dirx[vector[j]]);
900 py = new_y(py + diry[vector[j]]);
903 case 0: /* distance to sea */
904 if (own[px][py] == -1)
907 case 1: /* distance to land */
908 if (own[px][py] != -1)
911 case 2: /* distance to mountain */
912 if (elev[px][py] == INFINITY)
916 } while (next_vector(d));
921 #define ELEV elev[sectx[c][i]][secty[c][i]]
922 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
923 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
925 /* Decide where the mountains go
930 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
933 for (c = 0; c < ctot; ++c) {
935 ns = (c < nc) ? sc : isecs[c];
936 nm = (pm * ns) / 100;
938 /* Place the mountains */
940 for (i = 0; i < ns; ++i) {
941 dsea[i] = distance_to_sea();
942 weight[i] = (total += (dsea[i] * dsea[i]));
945 for (k = nm, mountain_search = 0;
946 k && mountain_search < MOUNTAIN_SEARCH_MAX;
949 for (i = 0; i < ns; ++i)
950 if (r < weight[i] && ELEV == -INFINITY &&
952 ((!(capx[c] == sectx[c][i] &&
953 capy[c] == secty[c][i])) &&
954 (!(new_x(capx[c] + 2) == sectx[c][i] &&
955 capy[c] == secty[c][i]))))) {
962 /* Elevate land that is not mountain and not capital */
964 for (i = 0; i < ns; ++i)
965 dmoun[i] = distance_to_mountain();
966 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
967 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
969 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
972 for (i = 0; i < ns; ++i) {
973 if (ELEV != INFINITY &&
974 (c >= nc || ((!(capx[c] == sectx[c][i] &&
975 capy[c] == secty[c][i])) &&
976 (!(new_x(capx[c] + 2) == sectx[c][i] &&
977 capy[c] == secty[c][i]))))) {
978 h = 3 * (5 - dmoun[i]) + dsea[i];
988 if (newk >= HILLMIN && newk < PLATMIN)
992 elev[sectx[c][where]][secty[c][where]] = newk;
993 dsea[where] = -INFINITY;
994 dmoun[where] = INFINITY;
997 /* Elevate the mountains and capitals */
999 for (i = 0; i < ns; ++i) {
1000 if (ELEV == INFINITY) {
1002 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1004 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1005 roll0((256 - HIGHMIN) / 2);
1006 } else if (c < nc &&
1007 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1008 ((new_x(capx[c] + 2) == sectx[c][i] &&
1009 capy[c] == secty[c][i]))))
1015 #define distance_to_land() distance_to_what(x, y, 1)
1022 for (y = 0; y < WORLD_Y; ++y) {
1023 for (x = y % 2; x < WORLD_X; x += 2) {
1024 if (elev[x][y] == -INFINITY)
1025 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1031 elev_to_sct_type(int elevation)
1033 if (elevation < LANDMIN)
1035 if (elevation < HILLMIN)
1037 if (elevation < PLATMIN)
1039 if (elevation < HIGHMIN)
1044 /****************************************************************************
1046 ****************************************************************************/
1053 fert = LANDMIN - e + 40;
1054 else if (e < FERT_MAX)
1055 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1066 oil = (LANDMIN - e) * 2 + roll0(2);
1067 else if (e <= OIL_MAX)
1068 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1078 if (e >= IRON_MIN && e < HIGHMIN)
1079 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1089 if (e >= GOLD_MIN) {
1091 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1093 gold = 100 - 20 * HIGHMIN / e;
1104 if (e >= URAN_MIN && e < HIGHMIN)
1105 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1112 add_resources(struct sctstr *sct)
1114 sct->sct_fertil = set_fert(sct->sct_elev);
1115 sct->sct_oil = set_oil(sct->sct_elev);
1116 sct->sct_min = set_iron(sct->sct_elev);
1117 sct->sct_gmin = set_gold(sct->sct_elev);
1118 sct->sct_uran = set_uran(sct->sct_elev);
1121 /****************************************************************************
1122 DESIGNATE THE SECTORS
1123 ****************************************************************************/
1131 for (y = 0; y < WORLD_Y; y++) {
1132 for (x = y % 2; x < WORLD_X; x += 2) {
1133 sct = getsectp(x, y);
1134 sct->sct_elev = elev[x][y];
1135 sct->sct_type = elev_to_sct_type(elev[x][y]);
1136 sct->sct_newtype = sct->sct_type;
1137 sct->sct_dterr = own[sct->sct_x][y] + 1;
1141 set_coastal_flags();
1144 /****************************************************************************
1145 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1146 ****************************************************************************/
1150 int sx, sy, x, y, c, type;
1153 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1158 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1161 type = elev_to_sct_type(elev[x][y]);
1162 if (type == SCT_WATER)
1164 else if (type == SCT_MOUNT)
1169 assert(0 <= c && c < nc);
1170 if ((x == capx[c] || x == new_x(capx[c] + 2))
1172 printf("%c ", numletter[c % 62]);
1182 * Print a map to help visualize own[][].
1183 * This is for debugging.
1190 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1193 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1197 else if (own[x][y] == -1)
1200 putchar(numletter[own[x][y] % 62]);
1207 * Print a map to help visualize elev[][].
1208 * This is for debugging. It expects the terminal to understand
1209 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1212 print_elev_map(void)
1214 int sx, sy, x, y, sat;
1216 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1219 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1223 else if (!elev[x][y])
1225 else if (elev[x][y] < 0) {
1226 sat = 256 + elev[x][y] * 2;
1227 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1228 } else if (elev[x][y] < HIGHMIN / 2) {
1229 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1230 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1231 } else if (elev[x][y] < HIGHMIN) {
1232 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1233 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1235 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1236 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1243 /***************************************************************************
1244 WRITE A SCRIPT FOR PLACING CAPITALS
1245 ****************************************************************************/
1247 write_newcap_script(void)
1250 FILE *script = fopen(outfile, "w");
1253 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1254 program_name, outfile, strerror(errno));
1258 for (c = 0; c < nc; ++c) {
1259 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1260 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1262 fprintf(script, "add %d visitor visitor v\n", c + 1);
1268 qprint(const char *const fmt, ...)
1274 vfprintf(stdout, fmt, ap);
1280 set_coastal_flags(void)
1285 for (i = 0; i < nc; ++i) {
1286 for (j = 0; j < sc; j++) {
1287 sp = getsectp(sectx[i][j], secty[i][j]);
1288 sp->sct_coastal = sectc[i][j];
1291 for (i = nc; i < nc + ni; ++i) {
1292 for (j = 0; j < isecs[i]; j++) {
1293 sp = getsectp(sectx[i][j], secty[i][j]);
1294 sp->sct_coastal = sectc[i][j];