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("fairland: unstable drift -- try increasing DRIFT_MAX\n");
298 qprint("growing continents...\n");
300 } while (fl_status && ++i < NUMTRIES);
302 fputs("ERROR: World not large enough to hold continents\n",
306 qprint("growing islands:");
308 qprint("\nelevating land...\n");
310 qprint("designating sectors...\n");
311 qprint("adding resources...\n");
312 if (!write_newcap_script())
315 if (chdir(gamedir)) {
316 fprintf(stderr, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
319 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
322 qprint("writing to sectors file...\n");
323 if (!ef_close(EF_SECTOR))
327 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
337 puts("Creating a planet with:\n");
338 printf("%d continents\n", nc);
339 printf("continent size: %d\n", sc);
340 printf("number of islands: %d\n", ni);
341 printf("average size of islands: %d\n", is);
342 printf("spike: %d%%\n", sp);
343 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
344 pm, (pm * sc) / 100);
345 printf("minimum distance between continents: %d\n", di);
346 printf("minimum distance from islands to continents: %d\n", id);
347 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
355 for (i = 1; i * i < n * 10000; ++i) ;
356 return (i + 50) / 100;
359 /****************************************************************************
360 PARSE COMMAND LINE ARGUMENTS
361 ****************************************************************************/
364 help(char *complaint)
367 fprintf(stderr, "%s: %s\n", program_name, complaint);
368 fprintf(stderr, "Try -h for help.\n");
374 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
375 " -e CONFIG-FILE configuration file\n"
377 " -i islands may merge\n"
379 " -R SEED seed for random number generator\n"
380 " -s SCRIPT name of script to create (default %s)\n"
381 " -h display this help and exit\n"
382 " -v display version information and exit\n"
383 " NC number of continents\n"
384 " SC continent size\n"
385 " NI number of islands (default NC)\n"
386 " IS average island size (default SC/2)\n"
387 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
388 " PM percentage of land that is mountain (default %d)\n"
389 " DI minimum distance between continents (default %d)\n"
390 " ID minimum distance from islands to continents (default %d)\n",
391 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
392 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
396 parse_args(int argc, char *argv[])
399 help("missing arguments");
403 help("too many arguments");
408 puts("fairland: error -- number of continents must be > 0");
414 puts("fairland: error -- size of continents must be > 0");
434 sp = LIMIT_TO(sp, 0, 100);
439 pm = DEFAULT_MOUNTAIN;
446 di = DEFAULT_CONTDIST;
449 puts("fairland: error -- distance between continents must be >= 0");
452 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
453 puts("fairland: error -- distance between continents too large");
460 id = DEFAULT_ISLDIST;
462 puts("fairland: error -- distance from islands to continents must be >= 0");
465 if (id > WORLD_X || id > WORLD_Y) {
466 puts("fairland: error -- distance from islands to continents too large");
469 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
470 puts("fairland: warning -- world might be too small to fit continents.");
471 puts("arguments should satisfy:");
472 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
476 /****************************************************************************
477 VARIABLE INITIALIZATION
478 ****************************************************************************/
481 allocate_memory(void)
485 capx = calloc(nc, sizeof(int));
486 capy = calloc(nc, sizeof(int));
487 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
488 mc = calloc(STABLE_CYCLE, sizeof(int));
489 own = calloc(WORLD_X, sizeof(int *));
490 elev = calloc(WORLD_X, sizeof(int *));
491 for (i = 0; i < WORLD_X; ++i) {
492 own[i] = calloc(WORLD_Y, sizeof(int));
493 elev[i] = calloc(WORLD_Y, sizeof(int));
495 sectx = calloc(nc + ni, sizeof(int *));
496 secty = calloc(nc + ni, sizeof(int *));
497 sectc = calloc(nc + ni, sizeof(int *));
498 isecs = calloc(nc + ni, sizeof(int));
499 weight = calloc(MAX(sc, is * 2), sizeof(int));
500 dsea = calloc(MAX(sc, is * 2), sizeof(int));
501 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
502 for (i = 0; i < nc; ++i) {
503 sectx[i] = calloc(sc, sizeof(int));
504 secty[i] = calloc(sc, sizeof(int));
505 sectc[i] = calloc(sc, sizeof(int));
507 for (i = nc; i < nc + ni; ++i) {
508 sectx[i] = calloc(is * 2, sizeof(int));
509 secty[i] = calloc(is * 2, sizeof(int));
510 sectc[i] = calloc(is * 2, sizeof(int));
518 int i, j, xx = 0, yy = 0;
523 for (i = 0; i < WORLD_X; ++i) {
524 for (j = 0; j < WORLD_Y; ++j) {
526 elev[i][j] = -INFINITY;
530 for (i = 0; i < nc; ++i) {
535 puts("fairland error: 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));
782 if (!done && c < nc) {
783 qprint("fairland: error -- continent %c had no room to grow!\n",
785 fl_status |= STATUS_NO_ROOM;
790 /* Grow all the continents
793 grow_continents(void)
797 for (c = 0; c < nc; ++c) {
798 sectx[c][0] = capx[c];
799 secty[c][0] = capy[c];
800 own[sectx[c][0]][secty[c][0]] = c;
801 sectx[c][1] = new_x(capx[c] + 2);
802 secty[c][1] = capy[c];
803 own[sectx[c][1]][secty[c][1]] = c;
806 for (secs = 2; secs < sc && !fl_status; ++secs) {
807 for (c = 0; c < nc; ++c) {
812 for (c = 0; c < nc; ++c)
816 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
820 /****************************************************************************
822 ****************************************************************************/
824 /* Choose a place to start growing an island from
827 place_island(int c, int *xp, int *yp)
830 int ssy = roll0(WORLD_Y);
831 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
833 if (ssx > WORLD_X - 2)
834 ssx = new_x(ssx + 2);
835 for (d = di + id; d >= id; --d) {
839 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
840 if (*xp >= WORLD_X) {
841 *yp = new_y(*yp + 1);
843 if (*xp == sx && *yp == sy)
846 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
853 /* Grow all the islands
861 for (c = nc; c < nc + ni; ++c) {
863 if (!place_island(c, &x, &y))
865 isiz = roll(is) + roll0(is);
869 } while (secs < isiz && grow_one_sector(c));
871 qprint(" %d(%d)", c - nc + 1, secs);
877 /****************************************************************************
879 ****************************************************************************/
881 create_elevations(void)
887 /* Generic function for finding the distance to the closest sea, land, or
891 distance_to_what(int x, int y, int flag)
895 for (d = 1; d < 5; ++d) {
896 for (j = 0; j < d; ++j)
901 for (j = 0; j < d; ++j) {
902 px = new_x(px + dirx[vector[j]]);
903 py = new_y(py + diry[vector[j]]);
906 case 0: /* distance to sea */
907 if (own[px][py] == -1)
910 case 1: /* distance to land */
911 if (own[px][py] != -1)
914 case 2: /* distance to mountain */
915 if (elev[px][py] == INFINITY)
919 } while (next_vector(d));
924 #define ELEV elev[sectx[c][i]][secty[c][i]]
925 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
926 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
928 /* Decide where the mountains go
933 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
936 for (c = 0; c < ctot; ++c) {
938 ns = (c < nc) ? sc : isecs[c];
939 nm = (pm * ns) / 100;
941 /* Place the mountains */
943 for (i = 0; i < ns; ++i) {
944 dsea[i] = distance_to_sea();
945 weight[i] = (total += (dsea[i] * dsea[i]));
948 for (k = nm, mountain_search = 0;
949 k && mountain_search < MOUNTAIN_SEARCH_MAX;
952 for (i = 0; i < ns; ++i)
953 if (r < weight[i] && ELEV == -INFINITY &&
955 ((!(capx[c] == sectx[c][i] &&
956 capy[c] == secty[c][i])) &&
957 (!(new_x(capx[c] + 2) == sectx[c][i] &&
958 capy[c] == secty[c][i]))))) {
965 /* Elevate land that is not mountain and not capital */
967 for (i = 0; i < ns; ++i)
968 dmoun[i] = distance_to_mountain();
969 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
970 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
972 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
975 for (i = 0; i < ns; ++i) {
976 if (ELEV != INFINITY &&
977 (c >= nc || ((!(capx[c] == sectx[c][i] &&
978 capy[c] == secty[c][i])) &&
979 (!(new_x(capx[c] + 2) == sectx[c][i] &&
980 capy[c] == secty[c][i]))))) {
981 h = 3 * (5 - dmoun[i]) + dsea[i];
991 if (newk >= HILLMIN && newk < PLATMIN)
995 elev[sectx[c][where]][secty[c][where]] = newk;
996 dsea[where] = -INFINITY;
997 dmoun[where] = INFINITY;
1000 /* Elevate the mountains and capitals */
1002 for (i = 0; i < ns; ++i) {
1003 if (ELEV == INFINITY) {
1005 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1007 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1008 roll0((256 - HIGHMIN) / 2);
1009 } else if (c < nc &&
1010 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1011 ((new_x(capx[c] + 2) == sectx[c][i] &&
1012 capy[c] == secty[c][i]))))
1018 #define distance_to_land() distance_to_what(x, y, 1)
1025 for (y = 0; y < WORLD_Y; ++y) {
1026 for (x = y % 2; x < WORLD_X; x += 2) {
1027 if (elev[x][y] == -INFINITY)
1028 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1033 /****************************************************************************
1035 ****************************************************************************/
1042 fert = LANDMIN - e + 40;
1043 else if (e < FERT_MAX)
1044 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1055 oil = (LANDMIN - e) * 2 + roll0(2);
1056 else if (e <= OIL_MAX)
1057 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1067 if (e >= IRON_MIN && e < HIGHMIN)
1068 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1078 if (e >= GOLD_MIN) {
1080 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1082 gold = 100 - 20 * HIGHMIN / e;
1093 if (e >= URAN_MIN && e < HIGHMIN)
1094 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1101 add_resources(struct sctstr *sct)
1103 sct->sct_fertil = set_fert(sct->sct_elev);
1104 sct->sct_oil = set_oil(sct->sct_elev);
1105 sct->sct_min = set_iron(sct->sct_elev);
1106 sct->sct_gmin = set_gold(sct->sct_elev);
1107 sct->sct_uran = set_uran(sct->sct_elev);
1110 /****************************************************************************
1111 DESIGNATE THE SECTORS
1112 ****************************************************************************/
1120 for (y = 0; y < WORLD_Y; y++) {
1121 for (x = y % 2; x < WORLD_X; x += 2) {
1122 sct = getsectp(x, y);
1124 if (total < LANDMIN) {
1125 sct->sct_type = SCT_WATER;
1126 } else if (total < HILLMIN)
1127 sct->sct_type = SCT_RURAL;
1128 else if (total < PLATMIN)
1129 sct->sct_type = SCT_MOUNT;
1130 else if (total < HIGHMIN)
1131 sct->sct_type = SCT_RURAL;
1133 sct->sct_type = SCT_MOUNT;
1134 sct->sct_elev = total;
1135 sct->sct_newtype = sct->sct_type;
1136 sct->sct_dterr = own[sct->sct_x][y] + 1;
1140 set_coastal_flags();
1143 /****************************************************************************
1144 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1145 ****************************************************************************/
1152 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1157 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1159 if (own[x][y] == -1)
1162 printf("%c ", map_symbol(x, y));
1170 map_symbol(int x, int y)
1174 for (c = 0; c < nc; ++c)
1175 if ((x == capx[c] && y == capy[c])
1176 || (x == new_x(capx[c] + 2) && y == capy[c]))
1177 return numletter[own[x][y] % 62];
1178 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1179 || elev[x][y] >= HIGHMIN)
1181 return own[x][y] >= nc ? '%' : '#';
1185 * Print a map to help visualize own[][].
1186 * This is for debugging.
1193 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1196 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1200 else if (own[x][y] == -1)
1203 putchar(numletter[own[x][y] % 62]);
1210 * Print a map to help visualize elev[][].
1211 * This is for debugging. It expects the terminal to understand
1212 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1215 print_elev_map(void)
1217 int sx, sy, x, y, sat;
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 (!elev[x][y])
1228 else if (elev[x][y] < 0) {
1229 sat = 256 + elev[x][y] * 2;
1230 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1231 } else if (elev[x][y] < HIGHMIN / 2) {
1232 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1233 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1234 } else if (elev[x][y] < HIGHMIN) {
1235 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1236 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1238 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1239 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1246 /***************************************************************************
1247 WRITE A SCRIPT FOR PLACING CAPITALS
1248 ****************************************************************************/
1250 write_newcap_script(void)
1253 FILE *script = fopen(outfile, "w");
1256 printf("fairland: error, unable to write to %s.\n", outfile);
1260 for (c = 0; c < nc; ++c) {
1261 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1262 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1264 fprintf(script, "add %d visitor visitor v\n", c + 1);
1270 qprint(const char *const fmt, ...)
1276 vfprintf(stdout, fmt, ap);
1282 set_coastal_flags(void)
1287 qprint("setting coastal flags...\n");
1288 for (i = 0; i < nc; ++i) {
1289 for (j = 0; j < sc; j++) {
1290 sp = getsectp(sectx[i][j], secty[i][j]);
1291 sp->sct_coastal = sectc[i][j];
1294 for (i = nc; i < nc + ni; ++i) {
1295 for (j = 0; j < isecs[i]; j++) {
1296 sp = getsectp(sectx[i][j], secty[i][j]);
1297 sp->sct_coastal = sectc[i][j];