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 ctot; /* total number of continents and islands grown */
181 static int *isecs; /* array of how large each island is */
183 static int *capx, *capy; /* location of the nc capitals */
184 static int *mc, mcc; /* array and counter used for stability
185 check when perturbing */
186 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
187 static int diry[] = { 0, -1, -1, 0, 1, 1 };
189 static int **own; /* owner of the sector. -1 means water */
190 static int **elev; /* elevation of the sectors */
191 static int **sectx, **secty; /* the sectors for each continent */
192 static int **sectc; /* which sectors are on the coast? */
193 static int *vector; /* used for measuring distances */
194 static int *weight; /* used for placing mountains */
195 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
197 #define NUMTRIES 10 /* keep trying to grow this many times */
199 static const char *numletter =
200 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
202 static void help(char *);
203 static void usage(void);
204 static void parse_args(int argc, char *argv[]);
205 static void allocate_memory(void);
206 static void init(void);
207 static int drift(void);
208 static int grow_continents(void);
209 static void create_elevations(void);
210 static void write_sects(void);
211 static void output(void);
212 static int write_newcap_script(void);
213 static int stable(void);
214 static void elevate_land(void);
215 static void elevate_sea(void);
216 static void set_coastal_flags(void);
218 static void print_vars(void);
219 static void fl_move(int);
220 static void grow_islands(void);
222 /* Debugging aids: */
223 void print_own_map(void);
224 void print_elev_map(void);
226 /****************************************************************************
228 ****************************************************************************/
231 main(int argc, char *argv[])
234 char *config_file = NULL;
236 unsigned rnd_seed = 0;
239 program_name = argv[0];
241 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
244 config_file = optarg;
247 DISTINCT_ISLANDS = 0;
253 rnd_seed = strtoul(optarg, NULL, 10);
263 printf("%s\n\n%s", version, legal);
272 rnd_seed = pick_seed();
275 if (emp_config(config_file) < 0)
279 parse_args(argc - optind, argv + optind);
284 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
285 qprint("seed is %u\n", rnd_seed);
290 qprint("\ntry #%d (out of %d)...\n", try + 1, NUMTRIES);
291 qprint("placing capitals...\n");
293 qprint("unstable drift\n");
294 qprint("growing continents...\n");
295 done = grow_continents();
296 } while (!done && ++try < NUMTRIES);
298 fprintf(stderr, "%s: world not large enough to hold continents\n",
302 qprint("growing islands:");
304 qprint("\nelevating land...\n");
307 qprint("writing to sectors file...\n");
308 if (!write_newcap_script())
310 if (chdir(gamedir)) {
311 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
312 program_name, gamedir, strerror(errno));
315 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
318 if (!ef_close(EF_SECTOR))
322 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
332 puts("Creating a planet with:\n");
333 printf("%d continents\n", nc);
334 printf("continent size: %d\n", sc);
335 printf("number of islands: %d\n", ni);
336 printf("average size of islands: %d\n", is);
337 printf("spike: %d%%\n", sp);
338 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
339 pm, (pm * sc) / 100);
340 printf("minimum distance between continents: %d\n", di);
341 printf("minimum distance from islands to continents: %d\n", id);
342 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
346 help(char *complaint)
349 fprintf(stderr, "%s: %s\n", program_name, complaint);
350 fprintf(stderr, "Try -h for help.\n");
356 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
357 " -e CONFIG-FILE configuration file\n"
359 " -i islands may merge\n"
361 " -R SEED seed for random number generator\n"
362 " -s SCRIPT name of script to create (default %s)\n"
363 " -h display this help and exit\n"
364 " -v display version information and exit\n"
365 " NC number of continents\n"
366 " SC continent size\n"
367 " NI number of islands (default NC)\n"
368 " IS average island size (default SC/2)\n"
369 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
370 " PM percentage of land that is mountain (default %d)\n"
371 " DI minimum distance between continents (default %d)\n"
372 " ID minimum distance from islands to continents (default %d)\n",
373 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
374 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
378 parse_args(int argc, char *argv[])
380 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
383 help("missing arguments");
387 help("too many arguments");
392 fprintf(stderr, "%s: number of continents must be > 0\n",
399 fprintf(stderr, "%s: size of continents must be > 1\n",
410 fprintf(stderr, "%s: number of islands must be >= 0\n",
418 fprintf(stderr, "%s: size of islands must be > 0\n",
425 if (sp < 0 || sp > 100) {
427 "%s: spike percentage must be between 0 and 100\n",
434 if (pm < 0 || pm > 100) {
436 "%s: mountain percentage must be between 0 and 100\n",
444 fprintf(stderr, "%s: distance between continents must be >= 0\n",
449 fprintf(stderr, "%s: distance between continents too large\n",
458 "%s: distance from islands to continents must be >= 0\n",
464 "%s: distance from islands to continents too large\n",
470 /****************************************************************************
471 VARIABLE INITIALIZATION
472 ****************************************************************************/
475 allocate_memory(void)
479 capx = calloc(nc, sizeof(int));
480 capy = calloc(nc, sizeof(int));
481 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
482 mc = calloc(STABLE_CYCLE, sizeof(int));
483 own = calloc(WORLD_X, sizeof(int *));
484 elev = calloc(WORLD_X, sizeof(int *));
485 for (i = 0; i < WORLD_X; ++i) {
486 own[i] = calloc(WORLD_Y, sizeof(int));
487 elev[i] = calloc(WORLD_Y, sizeof(int));
489 sectx = calloc(nc + ni, sizeof(int *));
490 secty = calloc(nc + ni, sizeof(int *));
491 sectc = calloc(nc + ni, sizeof(int *));
492 isecs = calloc(nc + ni, sizeof(int));
493 weight = calloc(MAX(sc, is * 2), sizeof(int));
494 dsea = calloc(MAX(sc, is * 2), sizeof(int));
495 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
496 for (i = 0; i < nc; ++i) {
497 sectx[i] = calloc(sc, sizeof(int));
498 secty[i] = calloc(sc, sizeof(int));
499 sectc[i] = calloc(sc, sizeof(int));
501 for (i = nc; i < nc + ni; ++i) {
502 sectx[i] = calloc(is * 2, sizeof(int));
503 secty[i] = calloc(is * 2, sizeof(int));
504 sectc[i] = calloc(is * 2, sizeof(int));
512 int i, j, xx = 0, yy = 0;
516 for (i = 0; i < WORLD_X; ++i) {
517 for (j = 0; j < WORLD_Y; ++j) {
519 elev[i][j] = -INFINITY;
523 for (i = 0; i < nc; ++i) {
529 "%s: world not big enough for all the continents\n",
538 for (i = 0; i < STABLE_CYCLE; ++i)
542 /****************************************************************************
543 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
544 ****************************************************************************/
546 /* How isolated is capital j?
549 iso(int j, int newx, int newy)
551 int i, md, d = WORLD_X + WORLD_Y;
553 for (i = 0; i < nc; ++i) {
556 md = mapdist(capx[i], capy[i], newx, newy);
564 /* Drift all the capitals
571 for (turns = 0; turns < DRIFT_MAX; ++turns) {
572 if (turns > DRIFT_BEFORE_CHECK && stable())
574 for (i = 0; i < nc; ++i)
580 /* Check to see if we have stabilized--can we stop drifting the capitals?
586 int i, isod, d = 0, stab = 1;
588 for (i = 0; i < nc; ++i) {
589 isod = iso(i, capx[i], capy[i]);
593 for (i = 0; i < STABLE_CYCLE; ++i)
597 mcc = (mcc + 1) % STABLE_CYCLE;
601 /* This routine does the actual drifting
607 int i, n, newx, newy;
609 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
610 newx = new_x(capx[j] + dirx[i]);
611 newy = new_y(capy[j] + diry[i]);
612 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
620 /****************************************************************************
622 ****************************************************************************/
624 /* Look for a coastal sector of continent c
632 for (i = 0; i < isecs[c]; ++i) {
634 for (j = 0; j < 6; ++j)
635 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
640 /* Used for measuring distances
652 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
655 return i > 1 || vector[0] > 0;
658 /* Test to see if we're allowed to grow there: the arguments di and id
661 try_to_grow(int c, int newx, int newy, int d)
665 for (i = 1; i <= d; ++i) {
666 for (j = 0; j < i; ++j)
671 for (j = 0; j < i; ++j) {
672 px = new_x(px + dirx[vector[j]]);
673 py = new_y(py + diry[vector[j]]);
675 if (own[px][py] != -1 &&
677 (DISTINCT_ISLANDS || own[px][py] < nc))
679 } while (next_vector(i));
681 sectx[c][isecs[c]] = newx;
682 secty[c][isecs[c]] = newy;
688 /* Move along the coast in a clockwise direction.
692 next_coast(int c, int x, int y, int *xp, int *yp)
694 int i, nx, ny, wat = 0;
702 for (i = 0; i < 12; ++i) {
703 nx = new_x(x + dirx[i % 6]);
704 ny = new_y(y + diry[i % 6]);
705 if (own[nx][ny] == -1)
707 if (wat && own[nx][ny] == c) {
715 /* Choose a sector to grow from
719 new_try(int c, int spike)
728 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
733 } while (i != starti);
740 /* Grow continent c by 1 sector
744 grow_one_sector(int c)
746 int spike = roll0(100) < sp;
747 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
749 if ((try1 = new_try(c, spike)) == -1)
751 x = sx = sectx[c][try1];
752 y = sy = secty[c][try1];
757 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
758 newx = new_x(x + dirx[i]);
759 newy = new_y(y + diry[i]);
760 if (own[newx][newy] == -1 &&
762 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
763 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
764 if (try_to_grow(c, newx, newy, c < nc ? di : id))
768 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
769 newx = new_x(x + dirx[i]);
770 newy = new_y(y + diry[i]);
771 if (own[newx][newy] == -1)
772 if (try_to_grow(c, newx, newy, c < nc ? di : id))
775 next_coast(c, x, y, &x, &y);
777 } while (!done && coast_search < COAST_SEARCH_MAX &&
778 (isecs[c] == 1 || x != sx || y != sy));
783 * Grow the continents.
784 * Return 1 on success, 0 on error.
787 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 && done; secs++) {
803 for (c = 0; c < nc; ++c) {
805 if (!grow_one_sector(c))
810 for (c = 0; c < nc; ++c)
814 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
819 /****************************************************************************
821 ****************************************************************************/
823 /* Choose a place to start growing an island from
826 place_island(int c, int *xp, int *yp)
829 int ssy = roll0(WORLD_Y);
830 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
832 if (ssx > WORLD_X - 2)
833 ssx = new_x(ssx + 2);
834 for (d = di + id; d >= id; --d) {
838 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
839 if (*xp >= WORLD_X) {
840 *yp = new_y(*yp + 1);
842 if (*xp == sx && *yp == sy)
845 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
852 /* Grow all the islands
858 int c, secs, x, y, isiz;
860 for (c = nc; c < nc + ni; ++c) {
862 if (!place_island(c, &x, &y))
864 isiz = roll(is) + roll0(is);
868 } while (secs < isiz && grow_one_sector(c));
870 qprint(" %d(%d)", c - nc + 1, secs);
875 /****************************************************************************
877 ****************************************************************************/
879 create_elevations(void)
885 /* Generic function for finding the distance to the closest sea, land, or
889 distance_to_what(int x, int y, int flag)
893 for (d = 1; d < 5; ++d) {
894 for (j = 0; j < d; ++j)
899 for (j = 0; j < d; ++j) {
900 px = new_x(px + dirx[vector[j]]);
901 py = new_y(py + diry[vector[j]]);
904 case 0: /* distance to sea */
905 if (own[px][py] == -1)
908 case 1: /* distance to land */
909 if (own[px][py] != -1)
912 case 2: /* distance to mountain */
913 if (elev[px][py] == INFINITY)
917 } while (next_vector(d));
922 #define ELEV elev[sectx[c][i]][secty[c][i]]
923 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
924 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
926 /* Decide where the mountains go
931 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
934 for (c = 0; c < ctot; ++c) {
937 nm = (pm * ns) / 100;
939 /* Place the mountains */
941 for (i = 0; i < ns; ++i) {
942 dsea[i] = distance_to_sea();
943 weight[i] = (total += (dsea[i] * dsea[i]));
946 for (k = nm, mountain_search = 0;
947 k && mountain_search < MOUNTAIN_SEARCH_MAX;
950 for (i = 0; i < ns; ++i)
951 if (r < weight[i] && ELEV == -INFINITY &&
953 ((!(capx[c] == sectx[c][i] &&
954 capy[c] == secty[c][i])) &&
955 (!(new_x(capx[c] + 2) == sectx[c][i] &&
956 capy[c] == secty[c][i]))))) {
963 /* Elevate land that is not mountain and not capital */
965 for (i = 0; i < ns; ++i)
966 dmoun[i] = distance_to_mountain();
967 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
968 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
970 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
973 for (i = 0; i < ns; ++i) {
974 if (ELEV != INFINITY &&
975 (c >= nc || ((!(capx[c] == sectx[c][i] &&
976 capy[c] == secty[c][i])) &&
977 (!(new_x(capx[c] + 2) == sectx[c][i] &&
978 capy[c] == secty[c][i]))))) {
979 h = 3 * (5 - dmoun[i]) + dsea[i];
989 if (newk >= HILLMIN && newk < PLATMIN)
993 elev[sectx[c][where]][secty[c][where]] = newk;
994 dsea[where] = -INFINITY;
995 dmoun[where] = INFINITY;
998 /* Elevate the mountains and capitals */
1000 for (i = 0; i < ns; ++i) {
1001 if (ELEV == INFINITY) {
1003 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1005 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1006 roll0((256 - HIGHMIN) / 2);
1007 } else if (c < nc &&
1008 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1009 ((new_x(capx[c] + 2) == sectx[c][i] &&
1010 capy[c] == secty[c][i]))))
1016 #define distance_to_land() distance_to_what(x, y, 1)
1023 for (y = 0; y < WORLD_Y; ++y) {
1024 for (x = y % 2; x < WORLD_X; x += 2) {
1025 if (elev[x][y] == -INFINITY)
1026 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1032 elev_to_sct_type(int elevation)
1034 if (elevation < LANDMIN)
1036 if (elevation < HILLMIN)
1038 if (elevation < PLATMIN)
1040 if (elevation < HIGHMIN)
1045 /****************************************************************************
1047 ****************************************************************************/
1054 fert = LANDMIN - e + 40;
1055 else if (e < FERT_MAX)
1056 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1067 oil = (LANDMIN - e) * 2 + roll0(2);
1068 else if (e <= OIL_MAX)
1069 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1079 if (e >= IRON_MIN && e < HIGHMIN)
1080 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1090 if (e >= GOLD_MIN) {
1092 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1094 gold = 100 - 20 * HIGHMIN / e;
1105 if (e >= URAN_MIN && e < HIGHMIN)
1106 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1113 add_resources(struct sctstr *sct)
1115 sct->sct_fertil = set_fert(sct->sct_elev);
1116 sct->sct_oil = set_oil(sct->sct_elev);
1117 sct->sct_min = set_iron(sct->sct_elev);
1118 sct->sct_gmin = set_gold(sct->sct_elev);
1119 sct->sct_uran = set_uran(sct->sct_elev);
1122 /****************************************************************************
1123 DESIGNATE THE SECTORS
1124 ****************************************************************************/
1132 for (y = 0; y < WORLD_Y; y++) {
1133 for (x = y % 2; x < WORLD_X; x += 2) {
1134 sct = getsectp(x, y);
1135 sct->sct_elev = elev[x][y];
1136 sct->sct_type = elev_to_sct_type(elev[x][y]);
1137 sct->sct_newtype = sct->sct_type;
1138 sct->sct_dterr = own[sct->sct_x][y] + 1;
1142 set_coastal_flags();
1145 /****************************************************************************
1146 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1147 ****************************************************************************/
1151 int sx, sy, x, y, c, type;
1154 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1159 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1162 type = elev_to_sct_type(elev[x][y]);
1163 if (type == SCT_WATER)
1165 else if (type == SCT_MOUNT)
1170 assert(0 <= c && c < nc);
1171 if ((x == capx[c] || x == new_x(capx[c] + 2))
1173 printf("%c ", numletter[c % 62]);
1183 * Print a map to help visualize own[][].
1184 * This is for debugging.
1191 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1194 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1198 else if (own[x][y] == -1)
1201 putchar(numletter[own[x][y] % 62]);
1208 * Print a map to help visualize elev[][].
1209 * This is for debugging. It expects the terminal to understand
1210 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1213 print_elev_map(void)
1215 int sx, sy, x, y, sat;
1217 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1220 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1224 else if (!elev[x][y])
1226 else if (elev[x][y] < 0) {
1227 sat = 256 + elev[x][y] * 2;
1228 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1229 } else if (elev[x][y] < HIGHMIN / 2) {
1230 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1231 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1232 } else if (elev[x][y] < HIGHMIN) {
1233 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1234 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1236 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1237 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1244 /***************************************************************************
1245 WRITE A SCRIPT FOR PLACING CAPITALS
1246 ****************************************************************************/
1248 write_newcap_script(void)
1251 FILE *script = fopen(outfile, "w");
1254 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1255 program_name, outfile, strerror(errno));
1259 for (c = 0; c < nc; ++c) {
1260 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1261 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1263 fprintf(script, "add %d visitor visitor v\n", c + 1);
1269 qprint(const char *const fmt, ...)
1275 vfprintf(stdout, fmt, ap);
1281 set_coastal_flags(void)
1286 for (i = 0; i < nc + ni; ++i) {
1287 for (j = 0; j < isecs[i]; j++) {
1288 sp = getsectp(sectx[i][j], secty[i][j]);
1289 sp->sct_coastal = sectc[i][j];