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; /* spike percentage */
149 #define DEFAULT_MOUNTAIN 0
150 static int pm; /* mountain percentage */
151 #define DEFAULT_CONTDIST 2
152 static int di; /* min. distance between continents */
153 #define DEFAULT_ISLDIST 1
154 static int id; /* ... 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 int map_symbol(int x, int y);
222 static void set_coastal_flags(void);
224 static void print_vars(void);
225 static void fl_move(int);
226 static void grow_islands(void);
228 /* Debugging aids: */
229 void print_own_map(void);
230 void print_elev_map(void);
232 /****************************************************************************
234 ****************************************************************************/
237 main(int argc, char *argv[])
240 char *config_file = NULL;
242 unsigned rnd_seed = 0;
245 program_name = argv[0];
247 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
250 config_file = optarg;
253 DISTINCT_ISLANDS = 0;
259 rnd_seed = strtoul(optarg, NULL, 10);
269 printf("%s\n\n%s", version, legal);
276 parse_args(argc - optind, argv + optind);
279 rnd_seed = pick_seed();
282 if (emp_config(config_file) < 0)
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[])
385 help("missing arguments");
389 help("too many arguments");
394 fprintf(stderr, "%s: number of continents must be > 0\n",
401 fprintf(stderr, "%s: size of continents must be > 0\n",
411 fprintf(stderr, "%s: number of islands must be >= 0\n",
421 fprintf(stderr, "%s: size of islands must be > 0\n",
430 if (sp < 0 || sp > 100) {
432 "%s: spike percentage must be between 0 and 100\n",
440 pm = DEFAULT_MOUNTAIN;
441 if (pm < 0 || pm > 100) {
443 "%s: mountain percentage must be between 0 and 100\n",
451 di = DEFAULT_CONTDIST;
454 fprintf(stderr, "%s: distance between continents must be >= 0\n",
458 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
459 fprintf(stderr, "%s: distance between continents too large\n",
467 id = DEFAULT_ISLDIST;
470 "%s: distance from islands to continents must be >= 0\n",
474 if (id > WORLD_X || id > WORLD_Y) {
476 "%s: distance from islands to continents too large\n",
482 /****************************************************************************
483 VARIABLE INITIALIZATION
484 ****************************************************************************/
487 allocate_memory(void)
491 capx = calloc(nc, sizeof(int));
492 capy = calloc(nc, sizeof(int));
493 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
494 mc = calloc(STABLE_CYCLE, sizeof(int));
495 own = calloc(WORLD_X, sizeof(int *));
496 elev = calloc(WORLD_X, sizeof(int *));
497 for (i = 0; i < WORLD_X; ++i) {
498 own[i] = calloc(WORLD_Y, sizeof(int));
499 elev[i] = calloc(WORLD_Y, sizeof(int));
501 sectx = calloc(nc + ni, sizeof(int *));
502 secty = calloc(nc + ni, sizeof(int *));
503 sectc = calloc(nc + ni, sizeof(int *));
504 isecs = calloc(nc + ni, sizeof(int));
505 weight = calloc(MAX(sc, is * 2), sizeof(int));
506 dsea = calloc(MAX(sc, is * 2), sizeof(int));
507 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
508 for (i = 0; i < nc; ++i) {
509 sectx[i] = calloc(sc, sizeof(int));
510 secty[i] = calloc(sc, sizeof(int));
511 sectc[i] = calloc(sc, sizeof(int));
513 for (i = nc; i < nc + ni; ++i) {
514 sectx[i] = calloc(is * 2, sizeof(int));
515 secty[i] = calloc(is * 2, sizeof(int));
516 sectc[i] = calloc(is * 2, sizeof(int));
524 int i, j, xx = 0, yy = 0;
529 for (i = 0; i < WORLD_X; ++i) {
530 for (j = 0; j < WORLD_Y; ++j) {
532 elev[i][j] = -INFINITY;
536 for (i = 0; i < nc; ++i) {
542 "%s: world not big enough for all the continents\n",
551 for (i = 0; i < STABLE_CYCLE; ++i)
555 /****************************************************************************
556 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
557 ****************************************************************************/
559 /* How isolated is capital j?
562 iso(int j, int newx, int newy)
564 int i, md, d = WORLD_X + WORLD_Y;
566 for (i = 0; i < nc; ++i) {
569 md = mapdist(capx[i], capy[i], newx, newy);
577 /* Drift all the capitals
584 for (turns = 0; turns < DRIFT_MAX; ++turns) {
585 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
587 for (i = 0; i < nc; ++i)
593 /* Check to see if we have stabilized--can we stop drifting the capitals?
599 int i, isod, d = 0, stab = 1;
601 for (i = 0; i < nc; ++i) {
602 isod = iso(i, capx[i], capy[i]);
606 for (i = 0; i < STABLE_CYCLE; ++i)
610 mcc = (mcc + 1) % STABLE_CYCLE;
614 /* This routine does the actual drifting
620 int i, n, newx, newy;
622 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
623 newx = new_x(capx[j] + dirx[i]);
624 newy = new_y(capy[j] + diry[i]);
625 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
633 /****************************************************************************
635 ****************************************************************************/
637 /* Look for a coastal sector of continent c
645 for (i = 0; i < secs; ++i) {
647 for (j = 0; j < 6; ++j)
648 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
653 /* Used for measuring distances
665 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
668 return i > 1 || vector[0] > 0;
671 /* Test to see if we're allowed to grow there: the arguments di and id
674 try_to_grow(int c, int newx, int newy, int d)
678 for (i = 1; i <= d; ++i) {
679 for (j = 0; j < i; ++j)
684 for (j = 0; j < i; ++j) {
685 px = new_x(px + dirx[vector[j]]);
686 py = new_y(py + diry[vector[j]]);
688 if (own[px][py] != -1 &&
690 (DISTINCT_ISLANDS || own[px][py] < nc))
692 } while (next_vector(i));
694 sectx[c][secs] = newx;
695 secty[c][secs] = newy;
700 /* Move along the coast in a clockwise direction.
704 next_coast(int c, int x, int y, int *xp, int *yp)
706 int i, nx, ny, wat = 0;
714 for (i = 0; i < 12; ++i) {
715 nx = new_x(x + dirx[i % 6]);
716 ny = new_y(y + diry[i % 6]);
717 if (own[nx][ny] == -1)
719 if (wat && own[nx][ny] == c) {
727 /* Choose a sector to grow from
739 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
744 } while (i != starti);
751 /* Grow continent c by 1 sector
755 grow_one_sector(int c)
757 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
759 spike = roll0(100) < sp;
760 if ((try1 = new_try(c)) == -1)
762 x = sx = sectx[c][try1];
763 y = sy = secty[c][try1];
768 for (i = roll0(6), n = 0; n < 12 && !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 &&
773 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
774 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
775 if (try_to_grow(c, newx, newy, c < nc ? di : id))
779 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
780 newx = new_x(x + dirx[i]);
781 newy = new_y(y + diry[i]);
782 if (own[newx][newy] == -1)
783 if (try_to_grow(c, newx, newy, c < nc ? di : id))
786 next_coast(c, x, y, &x, &y);
788 } while (!done && coast_search < COAST_SEARCH_MAX &&
789 (secs == 1 || x != sx || y != sy));
791 fl_status |= STATUS_NO_ROOM;
795 /* Grow all the continents
798 grow_continents(void)
802 for (c = 0; c < nc; ++c) {
803 sectx[c][0] = capx[c];
804 secty[c][0] = capy[c];
805 own[sectx[c][0]][secty[c][0]] = c;
806 sectx[c][1] = new_x(capx[c] + 2);
807 secty[c][1] = capy[c];
808 own[sectx[c][1]][secty[c][1]] = c;
811 for (secs = 2; secs < sc && !fl_status; ++secs) {
812 for (c = 0; c < nc; ++c) {
817 for (c = 0; c < nc; ++c)
821 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
825 /****************************************************************************
827 ****************************************************************************/
829 /* Choose a place to start growing an island from
832 place_island(int c, int *xp, int *yp)
835 int ssy = roll0(WORLD_Y);
836 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
838 if (ssx > WORLD_X - 2)
839 ssx = new_x(ssx + 2);
840 for (d = di + id; d >= id; --d) {
844 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
845 if (*xp >= WORLD_X) {
846 *yp = new_y(*yp + 1);
848 if (*xp == sx && *yp == sy)
851 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
858 /* Grow all the islands
866 for (c = nc; c < nc + ni; ++c) {
868 if (!place_island(c, &x, &y))
870 isiz = roll(is) + roll0(is);
874 } while (secs < isiz && grow_one_sector(c));
876 qprint(" %d(%d)", c - nc + 1, secs);
882 /****************************************************************************
884 ****************************************************************************/
886 create_elevations(void)
892 /* Generic function for finding the distance to the closest sea, land, or
896 distance_to_what(int x, int y, int flag)
900 for (d = 1; d < 5; ++d) {
901 for (j = 0; j < d; ++j)
906 for (j = 0; j < d; ++j) {
907 px = new_x(px + dirx[vector[j]]);
908 py = new_y(py + diry[vector[j]]);
911 case 0: /* distance to sea */
912 if (own[px][py] == -1)
915 case 1: /* distance to land */
916 if (own[px][py] != -1)
919 case 2: /* distance to mountain */
920 if (elev[px][py] == INFINITY)
924 } while (next_vector(d));
929 #define ELEV elev[sectx[c][i]][secty[c][i]]
930 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
931 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
933 /* Decide where the mountains go
938 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
941 for (c = 0; c < ctot; ++c) {
943 ns = (c < nc) ? sc : isecs[c];
944 nm = (pm * ns) / 100;
946 /* Place the mountains */
948 for (i = 0; i < ns; ++i) {
949 dsea[i] = distance_to_sea();
950 weight[i] = (total += (dsea[i] * dsea[i]));
953 for (k = nm, mountain_search = 0;
954 k && mountain_search < MOUNTAIN_SEARCH_MAX;
957 for (i = 0; i < ns; ++i)
958 if (r < weight[i] && ELEV == -INFINITY &&
960 ((!(capx[c] == sectx[c][i] &&
961 capy[c] == secty[c][i])) &&
962 (!(new_x(capx[c] + 2) == sectx[c][i] &&
963 capy[c] == secty[c][i]))))) {
970 /* Elevate land that is not mountain and not capital */
972 for (i = 0; i < ns; ++i)
973 dmoun[i] = distance_to_mountain();
974 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
975 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
977 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
980 for (i = 0; i < ns; ++i) {
981 if (ELEV != INFINITY &&
982 (c >= nc || ((!(capx[c] == sectx[c][i] &&
983 capy[c] == secty[c][i])) &&
984 (!(new_x(capx[c] + 2) == sectx[c][i] &&
985 capy[c] == secty[c][i]))))) {
986 h = 3 * (5 - dmoun[i]) + dsea[i];
996 if (newk >= HILLMIN && newk < PLATMIN)
1000 elev[sectx[c][where]][secty[c][where]] = newk;
1001 dsea[where] = -INFINITY;
1002 dmoun[where] = INFINITY;
1005 /* Elevate the mountains and capitals */
1007 for (i = 0; i < ns; ++i) {
1008 if (ELEV == INFINITY) {
1010 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1012 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1013 roll0((256 - HIGHMIN) / 2);
1014 } else if (c < nc &&
1015 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1016 ((new_x(capx[c] + 2) == sectx[c][i] &&
1017 capy[c] == secty[c][i]))))
1023 #define distance_to_land() distance_to_what(x, y, 1)
1030 for (y = 0; y < WORLD_Y; ++y) {
1031 for (x = y % 2; x < WORLD_X; x += 2) {
1032 if (elev[x][y] == -INFINITY)
1033 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1038 /****************************************************************************
1040 ****************************************************************************/
1047 fert = LANDMIN - e + 40;
1048 else if (e < FERT_MAX)
1049 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1060 oil = (LANDMIN - e) * 2 + roll0(2);
1061 else if (e <= OIL_MAX)
1062 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1072 if (e >= IRON_MIN && e < HIGHMIN)
1073 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1083 if (e >= GOLD_MIN) {
1085 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1087 gold = 100 - 20 * HIGHMIN / e;
1098 if (e >= URAN_MIN && e < HIGHMIN)
1099 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1106 add_resources(struct sctstr *sct)
1108 sct->sct_fertil = set_fert(sct->sct_elev);
1109 sct->sct_oil = set_oil(sct->sct_elev);
1110 sct->sct_min = set_iron(sct->sct_elev);
1111 sct->sct_gmin = set_gold(sct->sct_elev);
1112 sct->sct_uran = set_uran(sct->sct_elev);
1115 /****************************************************************************
1116 DESIGNATE THE SECTORS
1117 ****************************************************************************/
1125 for (y = 0; y < WORLD_Y; y++) {
1126 for (x = y % 2; x < WORLD_X; x += 2) {
1127 sct = getsectp(x, y);
1129 if (total < LANDMIN) {
1130 sct->sct_type = SCT_WATER;
1131 } else if (total < HILLMIN)
1132 sct->sct_type = SCT_RURAL;
1133 else if (total < PLATMIN)
1134 sct->sct_type = SCT_MOUNT;
1135 else if (total < HIGHMIN)
1136 sct->sct_type = SCT_RURAL;
1138 sct->sct_type = SCT_MOUNT;
1139 sct->sct_elev = total;
1140 sct->sct_newtype = sct->sct_type;
1141 sct->sct_dterr = own[sct->sct_x][y] + 1;
1145 set_coastal_flags();
1148 /****************************************************************************
1149 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1150 ****************************************************************************/
1157 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1162 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1164 if (own[x][y] == -1)
1167 printf("%c ", map_symbol(x, y));
1175 map_symbol(int x, int y)
1179 for (c = 0; c < nc; ++c)
1180 if ((x == capx[c] && y == capy[c])
1181 || (x == new_x(capx[c] + 2) && y == capy[c]))
1182 return numletter[own[x][y] % 62];
1183 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1184 || elev[x][y] >= HIGHMIN)
1186 return own[x][y] >= nc ? '%' : '#';
1190 * Print a map to help visualize own[][].
1191 * This is for debugging.
1198 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1201 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1205 else if (own[x][y] == -1)
1208 putchar(numletter[own[x][y] % 62]);
1215 * Print a map to help visualize elev[][].
1216 * This is for debugging. It expects the terminal to understand
1217 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1220 print_elev_map(void)
1222 int sx, sy, x, y, sat;
1224 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1227 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1231 else if (!elev[x][y])
1233 else if (elev[x][y] < 0) {
1234 sat = 256 + elev[x][y] * 2;
1235 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1236 } else if (elev[x][y] < HIGHMIN / 2) {
1237 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1238 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1239 } else if (elev[x][y] < HIGHMIN) {
1240 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1241 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1243 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1244 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1251 /***************************************************************************
1252 WRITE A SCRIPT FOR PLACING CAPITALS
1253 ****************************************************************************/
1255 write_newcap_script(void)
1258 FILE *script = fopen(outfile, "w");
1261 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1262 program_name, outfile, strerror(errno));
1266 for (c = 0; c < nc; ++c) {
1267 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1268 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1270 fprintf(script, "add %d visitor visitor v\n", c + 1);
1276 qprint(const char *const fmt, ...)
1282 vfprintf(stdout, fmt, ap);
1288 set_coastal_flags(void)
1293 for (i = 0; i < nc; ++i) {
1294 for (j = 0; j < sc; j++) {
1295 sp = getsectp(sectx[i][j], secty[i][j]);
1296 sp->sct_coastal = sectc[i][j];
1299 for (i = nc; i < nc + ni; ++i) {
1300 for (j = 0; j < isecs[i]; j++) {
1301 sp = getsectp(sectx[i][j], secty[i][j]);
1302 sp->sct_coastal = sectc[i][j];