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 /* define ORE 1 to add resources, define ORE 0 if you want to use another
113 program to add the resources */
115 static int quiet = 0;
117 /* If you don't specify these command line arguments, then these are the
119 #define DEFAULT_SPIKE 10
120 #define DEFAULT_MOUNTAIN 0
121 #define DEFAULT_CONTDIST 2
122 #define DEFAULT_ISLDIST 1
124 /* The following five numbers refer to elevation under which (in the case of
125 fertility or oil) or over which (in the case of iron, gold, and uranium)
126 sectors with that elevation will contain that resource. Elevation ranges
129 /* raise FERT_MAX for more fertility */
132 /* raise OIL_MAX for more oil */
135 /* lower IRON_MIN for more iron */
138 /* lower GOLD_MIN for more gold */
141 /* lower URAN_MIN for more uranium */
144 /* do not change these 4 defines */
145 #define LANDMIN 1 /* plate altitude for normal land */
146 #define HILLMIN 34 /* plate altitude for hills */
147 #define PLATMIN 36 /* plate altitude for plateau */
148 #define HIGHMIN 98 /* plate altitude for mountains */
150 static void qprint(const char * const fmt, ...)
151 ATTRIBUTE((format (printf, 1, 2)));
153 #define DEFAULT_OUTFILE_NAME "newcap_script"
154 static const char *outfile = DEFAULT_OUTFILE_NAME;
155 /* mark the continents with a * so you can tell them
156 from the islands 1 = mark, 0 = don't mark. */
157 static int AIRPORT_MARKER = 0;
159 /* don't let the islands crash into each other.
160 1 = don't merge, 0 = merge. */
161 static int DISTINCT_ISLANDS = 1;
163 static char *program_name;
165 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
166 #define INFINITY 999 /* a number which means "BIG" */
168 /* these defines prevent infinite loops:
171 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
172 when growing continents and islands */
173 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
174 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
175 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
180 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
181 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
183 static int secs; /* number of sectors grown */
184 static int ctot; /* total number of continents and islands grown */
185 static int *isecs; /* array of how large each island is */
187 static int nc, sc, di, sp, pm, ni, is, id; /* the 8 args to this program */
188 static int *capx, *capy; /* location of the nc capitals */
189 static int *mc, mcc; /* array and counter used for stability
190 check when perturbing */
191 static int spike; /* are we spiking? */
192 static int mind; /* the final distance between capitals that
194 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
195 static int diry[] = { 0, -1, -1, 0, 1, 1 };
197 static int **own; /* owner of the sector. -1 means water */
198 static int **elev; /* elevation of the sectors */
199 static int **sectx, **secty; /* the sectors for each continent */
200 static int **sectc; /* which sectors are on the coast? */
201 static int *vector; /* used for measuring distances */
202 static int *weight; /* used for placing mountains */
203 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
204 static int fl_status; /* is anything wrong? */
205 #define STATUS_NO_ROOM 1 /* there was no room to grow */
206 #define NUMTRIES 10 /* keep trying to grow this many times */
208 static const char *numletter =
209 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
211 static void help(char *);
212 static void usage(void);
213 static void parse_args(int argc, char *argv[]);
214 static void allocate_memory(void);
215 static void init(void);
216 static int drift(void);
217 static void grow_continents(void);
218 static void create_elevations(void);
219 static void write_sects(void);
220 static void output(void);
221 static int write_newcap_script(void);
222 static int stable(void);
223 static void elevate_land(void);
224 static void elevate_sea(void);
225 static int map_symbol(int x, int y);
226 static void set_coastal_flags(void);
228 static void print_vars(void);
229 static void fl_move(int);
230 static void grow_islands(void);
232 /* Debugging aids: */
233 void print_own_map(void);
234 void print_elev_map(void);
236 /****************************************************************************
238 ****************************************************************************/
241 main(int argc, char *argv[])
244 char *config_file = NULL;
246 unsigned rnd_seed = 0;
249 program_name = argv[0];
251 while ((opt = getopt(argc, argv, "ae:hioqR:s:v")) != EOF) {
257 config_file = optarg;
260 DISTINCT_ISLANDS = 0;
269 rnd_seed = strtoul(optarg, NULL, 10);
279 printf("%s\n\n%s", version, legal);
286 parse_args(argc - optind, argv + optind);
289 rnd_seed = pick_seed();
292 if (emp_config(config_file) < 0)
299 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
300 qprint("seed is %u\n", rnd_seed);
304 qprint("\ntry #%d (out of %d)...\n", i + 1, NUMTRIES);
305 qprint("placing capitals...\n");
307 qprint("fairland: unstable drift -- try increasing DRIFT_MAX\n");
308 qprint("growing continents...\n");
310 } while (fl_status && ++i < NUMTRIES);
312 fputs("ERROR: World not large enough to hold continents\n",
316 qprint("growing islands:");
318 qprint("\nelevating land...\n");
320 qprint("designating sectors...\n");
322 qprint("adding resources...\n");
323 if (!write_newcap_script())
326 if (chdir(gamedir)) {
327 fprintf(stderr, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
330 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
333 qprint("writing to sectors file...\n");
334 if (!ef_close(EF_SECTOR))
338 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
341 qprint("\t*** Resources have not been added ***\n");
350 puts("Creating a planet with:\n");
351 printf("%d continents\n", nc);
352 printf("continent size: %d\n", sc);
353 printf("number of islands: %d\n", ni);
354 printf("average size of islands: %d\n", is);
355 printf("spike: %d%%\n", sp);
356 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
357 pm, (pm * sc) / 100);
358 printf("minimum distance between continents: %d\n", di);
359 printf("minimum distance from islands to continents: %d\n", id);
360 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
368 for (i = 1; i * i < n * 10000; ++i) ;
369 return (i + 50) / 100;
372 /****************************************************************************
373 PARSE COMMAND LINE ARGUMENTS
374 ****************************************************************************/
377 help(char *complaint)
380 fprintf(stderr, "%s: %s\n", program_name, complaint);
381 fprintf(stderr, "Try -h for help.\n");
387 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
388 " -a airport marker for continents\n"
389 " -e CONFIG-FILE configuration file\n"
391 " -i islands may merge\n"
392 " -o don't set resources\n"
394 " -R SEED seed for random number generator\n"
395 " -s SCRIPT name of script to create (default %s)\n"
396 " -h display this help and exit\n"
397 " -v display version information and exit\n"
398 " NC number of continents\n"
399 " SC continent size\n"
400 " NI number of islands (default NC)\n"
401 " IS average island size (default SC/2)\n"
402 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
403 " PM percentage of land that is mountain (default %d)\n"
404 " DI minimum distance between continents (default %d)\n"
405 " ID minimum distance from islands to continents (default %d)\n",
406 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
407 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
411 parse_args(int argc, char *argv[])
414 help("missing arguments");
418 help("too many arguments");
423 puts("fairland: error -- number of continents must be > 0");
429 puts("fairland: error -- size of continents must be > 0");
449 sp = LIMIT_TO(sp, 0, 100);
454 pm = DEFAULT_MOUNTAIN;
461 di = DEFAULT_CONTDIST;
464 puts("fairland: error -- distance between continents must be >= 0");
467 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
468 puts("fairland: error -- distance between continents too large");
475 id = DEFAULT_ISLDIST;
477 puts("fairland: error -- distance from islands to continents must be >= 0");
480 if (id > WORLD_X || id > WORLD_Y) {
481 puts("fairland: error -- distance from islands to continents too large");
484 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
485 puts("fairland: warning -- world might be too small to fit continents.");
486 puts("arguments should satisfy:");
487 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
491 /****************************************************************************
492 VARIABLE INITIALIZATION
493 ****************************************************************************/
496 allocate_memory(void)
500 capx = calloc(nc, sizeof(int));
501 capy = calloc(nc, sizeof(int));
502 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
503 mc = calloc(STABLE_CYCLE, sizeof(int));
504 own = calloc(WORLD_X, sizeof(int *));
505 elev = calloc(WORLD_X, sizeof(int *));
506 for (i = 0; i < WORLD_X; ++i) {
507 own[i] = calloc(WORLD_Y, sizeof(int));
508 elev[i] = calloc(WORLD_Y, sizeof(int));
510 sectx = calloc(nc + ni, sizeof(int *));
511 secty = calloc(nc + ni, sizeof(int *));
512 sectc = calloc(nc + ni, sizeof(int *));
513 isecs = calloc(nc + ni, sizeof(int));
514 weight = calloc(MAX(sc, is * 2), sizeof(int));
515 dsea = calloc(MAX(sc, is * 2), sizeof(int));
516 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
517 for (i = 0; i < nc; ++i) {
518 sectx[i] = calloc(sc, sizeof(int));
519 secty[i] = calloc(sc, sizeof(int));
520 sectc[i] = calloc(sc, sizeof(int));
522 for (i = nc; i < nc + ni; ++i) {
523 sectx[i] = calloc(is * 2, sizeof(int));
524 secty[i] = calloc(is * 2, sizeof(int));
525 sectc[i] = calloc(is * 2, sizeof(int));
533 int i, j, xx = 0, yy = 0;
538 for (i = 0; i < WORLD_X; ++i) {
539 for (j = 0; j < WORLD_Y; ++j) {
541 elev[i][j] = -INFINITY;
545 for (i = 0; i < nc; ++i) {
550 puts("fairland error: world not big enough for all the continents.\n");
558 for (i = 0; i < STABLE_CYCLE; ++i)
562 /****************************************************************************
563 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
564 ****************************************************************************/
566 /* How isolated is capital j?
569 iso(int j, int newx, int newy)
571 int i, md, d = WORLD_X + WORLD_Y;
573 for (i = 0; i < nc; ++i) {
576 md = mapdist(capx[i], capy[i], newx, newy);
584 /* Drift all the capitals
591 for (turns = 0; turns < DRIFT_MAX; ++turns) {
592 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
594 for (i = 0; i < nc; ++i)
600 /* Check to see if we have stabilized--can we stop drifting the capitals?
606 int i, isod, d = 0, stab = 1;
608 for (i = 0; i < nc; ++i) {
609 isod = iso(i, capx[i], capy[i]);
613 for (i = 0; i < STABLE_CYCLE; ++i)
617 mcc = (mcc + 1) % STABLE_CYCLE;
621 /* This routine does the actual drifting
627 int i, n, newx, newy;
629 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
630 newx = new_x(capx[j] + dirx[i]);
631 newy = new_y(capy[j] + diry[i]);
632 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
640 /****************************************************************************
642 ****************************************************************************/
644 /* Look for a coastal sector of continent c
652 for (i = 0; i < secs; ++i) {
654 for (j = 0; j < 6; ++j)
655 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
660 /* Used for measuring distances
672 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
675 return i > 1 || vector[0] > 0;
678 /* Test to see if we're allowed to grow there: the arguments di and id
681 try_to_grow(int c, int newx, int newy, int d)
685 for (i = 1; i <= d; ++i) {
686 for (j = 0; j < i; ++j)
691 for (j = 0; j < i; ++j) {
692 px = new_x(px + dirx[vector[j]]);
693 py = new_y(py + diry[vector[j]]);
695 if (own[px][py] != -1 &&
697 (DISTINCT_ISLANDS || own[px][py] < nc))
699 } while (next_vector(i));
701 sectx[c][secs] = newx;
702 secty[c][secs] = newy;
707 /* Move along the coast in a clockwise direction.
711 next_coast(int c, int x, int y, int *xp, int *yp)
713 int i, nx, ny, wat = 0;
721 for (i = 0; i < 12; ++i) {
722 nx = new_x(x + dirx[i % 6]);
723 ny = new_y(y + diry[i % 6]);
724 if (own[nx][ny] == -1)
726 if (wat && own[nx][ny] == c) {
734 /* Choose a sector to grow from
746 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
751 } while (i != starti);
758 /* Grow continent c by 1 sector
762 grow_one_sector(int c)
764 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
766 spike = roll0(100) < sp;
767 if ((try1 = new_try(c)) == -1)
769 x = sx = sectx[c][try1];
770 y = sy = secty[c][try1];
775 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
776 newx = new_x(x + dirx[i]);
777 newy = new_y(y + diry[i]);
778 if (own[newx][newy] == -1 &&
780 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
781 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
782 if (try_to_grow(c, newx, newy, c < nc ? di : id))
786 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
787 newx = new_x(x + dirx[i]);
788 newy = new_y(y + diry[i]);
789 if (own[newx][newy] == -1)
790 if (try_to_grow(c, newx, newy, c < nc ? di : id))
793 next_coast(c, x, y, &x, &y);
795 } while (!done && coast_search < COAST_SEARCH_MAX &&
796 (secs == 1 || x != sx || y != sy));
797 if (!done && c < nc) {
798 qprint("fairland: error -- continent %c had no room to grow!\n",
800 fl_status |= STATUS_NO_ROOM;
805 /* Grow all the continents
808 grow_continents(void)
812 for (c = 0; c < nc; ++c) {
813 sectx[c][0] = capx[c];
814 secty[c][0] = capy[c];
815 own[sectx[c][0]][secty[c][0]] = c;
816 sectx[c][1] = new_x(capx[c] + 2);
817 secty[c][1] = capy[c];
818 own[sectx[c][1]][secty[c][1]] = c;
821 for (secs = 2; secs < sc && !fl_status; ++secs) {
822 for (c = 0; c < nc; ++c) {
827 for (c = 0; c < nc; ++c)
831 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
835 /****************************************************************************
837 ****************************************************************************/
839 /* Choose a place to start growing an island from
842 place_island(int c, int *xp, int *yp)
845 int ssy = roll0(WORLD_Y);
846 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
848 if (ssx > WORLD_X - 2)
849 ssx = new_x(ssx + 2);
850 for (d = di + id; d >= id; --d) {
854 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
855 if (*xp >= WORLD_X) {
856 *yp = new_y(*yp + 1);
858 if (*xp == sx && *yp == sy)
861 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
868 /* Grow all the islands
876 for (c = nc; c < nc + ni; ++c) {
878 if (!place_island(c, &x, &y))
880 isiz = roll(is) + roll0(is);
884 } while (secs < isiz && grow_one_sector(c));
886 qprint(" %d(%d)", c - nc + 1, secs);
892 /****************************************************************************
894 ****************************************************************************/
896 create_elevations(void)
902 /* Generic function for finding the distance to the closest sea, land, or
906 distance_to_what(int x, int y, int flag)
910 for (d = 1; d < 5; ++d) {
911 for (j = 0; j < d; ++j)
916 for (j = 0; j < d; ++j) {
917 px = new_x(px + dirx[vector[j]]);
918 py = new_y(py + diry[vector[j]]);
921 case 0: /* distance to sea */
922 if (own[px][py] == -1)
925 case 1: /* distance to land */
926 if (own[px][py] != -1)
929 case 2: /* distance to mountain */
930 if (elev[px][py] == INFINITY)
934 } while (next_vector(d));
939 #define ELEV elev[sectx[c][i]][secty[c][i]]
940 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
941 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
943 /* Decide where the mountains go
948 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
951 for (c = 0; c < ctot; ++c) {
953 ns = (c < nc) ? sc : isecs[c];
954 nm = (pm * ns) / 100;
956 /* Place the mountains */
958 for (i = 0; i < ns; ++i) {
959 dsea[i] = distance_to_sea();
960 weight[i] = (total += (dsea[i] * dsea[i]));
963 for (k = nm, mountain_search = 0;
964 k && mountain_search < MOUNTAIN_SEARCH_MAX;
967 for (i = 0; i < ns; ++i)
968 if (r < weight[i] && ELEV == -INFINITY &&
970 ((!(capx[c] == sectx[c][i] &&
971 capy[c] == secty[c][i])) &&
972 (!(new_x(capx[c] + 2) == sectx[c][i] &&
973 capy[c] == secty[c][i]))))) {
980 /* Elevate land that is not mountain and not capital */
982 for (i = 0; i < ns; ++i)
983 dmoun[i] = distance_to_mountain();
984 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
985 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
987 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
990 for (i = 0; i < ns; ++i) {
991 if (ELEV != INFINITY &&
992 (c >= nc || ((!(capx[c] == sectx[c][i] &&
993 capy[c] == secty[c][i])) &&
994 (!(new_x(capx[c] + 2) == sectx[c][i] &&
995 capy[c] == secty[c][i]))))) {
996 h = 3 * (5 - dmoun[i]) + dsea[i];
1006 if (newk >= HILLMIN && newk < PLATMIN)
1010 elev[sectx[c][where]][secty[c][where]] = newk;
1011 dsea[where] = -INFINITY;
1012 dmoun[where] = INFINITY;
1015 /* Elevate the mountains and capitals */
1017 for (i = 0; i < ns; ++i) {
1018 if (ELEV == INFINITY) {
1020 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1022 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1023 roll0((256 - HIGHMIN) / 2);
1024 } else if (c < nc &&
1025 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1026 ((new_x(capx[c] + 2) == sectx[c][i] &&
1027 capy[c] == secty[c][i]))))
1033 #define distance_to_land() distance_to_what(x, y, 1)
1040 for (y = 0; y < WORLD_Y; ++y) {
1041 for (x = y % 2; x < WORLD_X; x += 2) {
1042 if (elev[x][y] == -INFINITY)
1043 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1048 /****************************************************************************
1050 ****************************************************************************/
1057 fert = LANDMIN - e + 40;
1058 else if (e < FERT_MAX)
1059 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1070 oil = (LANDMIN - e) * 2 + roll0(2);
1071 else if (e <= OIL_MAX)
1072 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1082 if (e >= IRON_MIN && e < HIGHMIN)
1083 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1093 if (e >= GOLD_MIN) {
1095 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1097 gold = 100 - 20 * HIGHMIN / e;
1108 if (e >= URAN_MIN && e < HIGHMIN)
1109 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1116 add_resources(struct sctstr *sct)
1118 sct->sct_fertil = set_fert(sct->sct_elev);
1119 sct->sct_oil = set_oil(sct->sct_elev);
1120 sct->sct_min = set_iron(sct->sct_elev);
1121 sct->sct_gmin = set_gold(sct->sct_elev);
1122 sct->sct_uran = set_uran(sct->sct_elev);
1125 /****************************************************************************
1126 DESIGNATE THE SECTORS
1127 ****************************************************************************/
1135 for (y = 0; y < WORLD_Y; y++) {
1136 for (x = y % 2; x < WORLD_X; x += 2) {
1137 sct = getsectp(x, y);
1139 if (total < LANDMIN) {
1140 sct->sct_type = SCT_WATER;
1141 } else if (total < HILLMIN)
1142 sct->sct_type = SCT_RURAL;
1143 else if (total < PLATMIN)
1144 sct->sct_type = SCT_MOUNT;
1145 else if (total < HIGHMIN)
1146 sct->sct_type = SCT_RURAL;
1148 sct->sct_type = SCT_MOUNT;
1149 sct->sct_elev = total;
1150 sct->sct_newtype = sct->sct_type;
1151 sct->sct_dterr = own[sct->sct_x][y] + 1;
1157 for (c = 0; c < nc; ++c) {
1158 sct = getsectp(capx[c], capy[c]);
1159 sct->sct_type = SCT_AIRPT;
1160 sct->sct_newtype = SCT_AIRPT;
1162 set_coastal_flags();
1165 /****************************************************************************
1166 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1167 ****************************************************************************/
1174 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1179 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1181 if (own[x][y] == -1)
1184 printf("%c ", map_symbol(x, y));
1190 printf("\n\nEach continent is marked by a \"*\" on the map (to distinguish them from\n"
1191 "the islands). You can redesignate these airfields to wilderness sectors\n"
1192 "one at a time, each time you add a new country to the game.\n");
1196 map_symbol(int x, int y)
1200 for (c = 0; c < nc; ++c)
1201 if ((x == capx[c] && y == capy[c])
1202 || (x == new_x(capx[c] + 2) && y == capy[c]))
1203 return numletter[own[x][y] % 62];
1204 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1205 || elev[x][y] >= HIGHMIN)
1207 return own[x][y] >= nc ? '%' : '#';
1211 * Print a map to help visualize own[][].
1212 * This is for debugging.
1219 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1222 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1226 else if (own[x][y] == -1)
1229 putchar(numletter[own[x][y] % 62]);
1236 * Print a map to help visualize elev[][].
1237 * This is for debugging. It expects the terminal to understand
1238 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1241 print_elev_map(void)
1243 int sx, sy, x, y, sat;
1245 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1248 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1252 else if (!elev[x][y])
1254 else if (elev[x][y] < 0) {
1255 sat = 256 + elev[x][y] * 2;
1256 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1257 } else if (elev[x][y] < HIGHMIN / 2) {
1258 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1259 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1260 } else if (elev[x][y] < HIGHMIN) {
1261 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1262 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1264 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1265 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1272 /***************************************************************************
1273 WRITE A SCRIPT FOR PLACING CAPITALS
1274 ****************************************************************************/
1276 write_newcap_script(void)
1279 FILE *script = fopen(outfile, "w");
1282 printf("fairland: error, unable to write to %s.\n", outfile);
1286 for (c = 0; c < nc; ++c) {
1287 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1289 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1290 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1292 fprintf(script, "add %d visitor visitor v\n", c + 1);
1298 qprint(const char *const fmt, ...)
1304 vfprintf(stdout, fmt, ap);
1310 set_coastal_flags(void)
1315 qprint("setting coastal flags...\n");
1316 for (i = 0; i < nc; ++i) {
1317 for (j = 0; j < sc; j++) {
1318 sp = getsectp(sectx[i][j], secty[i][j]);
1319 sp->sct_coastal = sectc[i][j];
1322 for (i = nc; i < nc + ni; ++i) {
1323 for (j = 0; j < isecs[i]; j++) {
1324 sp = getsectp(sectx[i][j], secty[i][j]);
1325 sp->sct_coastal = sectc[i][j];