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
109 #include "prototypes.h"
114 /* The following five numbers refer to elevation under which (in the case of
115 fertility or oil) or over which (in the case of iron, gold, and uranium)
116 sectors with that elevation will contain that resource. Elevation ranges
119 /* raise FERT_MAX for more fertility */
122 /* raise OIL_MAX for more oil */
125 /* lower IRON_MIN for more iron */
128 /* lower GOLD_MIN for more gold */
131 /* lower URAN_MIN for more uranium */
134 /* do not change these 4 defines */
135 #define LANDMIN 1 /* plate altitude for normal land */
136 #define HILLMIN 34 /* plate altitude for hills */
137 #define PLATMIN 36 /* plate altitude for plateau */
138 #define HIGHMIN 98 /* plate altitude for mountains */
140 static void qprint(const char * const fmt, ...)
141 ATTRIBUTE((format (printf, 1, 2)));
144 * Program arguments and options
146 static char *program_name;
147 static int nc, sc; /* number and size of continents */
148 static int ni, is; /* number and size of islands */
149 #define DEFAULT_SPIKE 10
150 static int sp = DEFAULT_SPIKE; /* spike percentage */
151 #define DEFAULT_MOUNTAIN 0
152 static int pm = DEFAULT_MOUNTAIN; /* mountain percentage */
153 #define DEFAULT_CONTDIST 2
154 static int di = DEFAULT_CONTDIST; /* min. distance between continents */
155 #define DEFAULT_ISLDIST 1
156 static int id = DEFAULT_ISLDIST; /* ... continents and islands */
157 /* don't let the islands crash into each other.
158 1 = don't merge, 0 = merge. */
159 static int DISTINCT_ISLANDS = 1;
161 #define DEFAULT_OUTFILE_NAME "newcap_script"
162 static const char *outfile = DEFAULT_OUTFILE_NAME;
164 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
165 #define INFINITE_ELEVATION 999
167 /* these defines prevent infinite loops:
170 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
171 when growing continents and islands */
172 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
173 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
174 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
179 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
180 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
182 static int ctot; /* total number of continents and islands grown */
183 static int *isecs; /* array of how large each island is */
185 static int *capx, *capy; /* location of the nc capitals */
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 *weight; /* used for placing mountains */
194 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
196 #define NUMTRIES 10 /* keep trying to grow this many times */
198 static const char *numletter =
199 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
201 static void help(char *);
202 static void usage(void);
203 static void parse_args(int argc, char *argv[]);
204 static void allocate_memory(void);
205 static void init(void);
206 static int drift(void);
207 static int grow_continents(void);
208 static void create_elevations(void);
209 static void write_sects(void);
210 static void output(void);
211 static int write_newcap_script(void);
212 static int stable(int);
213 static void elevate_land(void);
214 static void elevate_sea(void);
215 static void set_coastal_flags(void);
217 static void print_vars(void);
218 static void fl_move(int);
219 static void grow_islands(void);
221 /* Debugging aids: */
222 void print_own_map(void);
223 void print_elev_map(void);
225 /****************************************************************************
227 ****************************************************************************/
230 main(int argc, char *argv[])
233 char *config_file = NULL;
235 unsigned rnd_seed = 0;
238 program_name = argv[0];
240 while ((opt = getopt(argc, argv, "e:hiqR:s:v")) != EOF) {
243 config_file = optarg;
246 DISTINCT_ISLANDS = 0;
252 rnd_seed = strtoul(optarg, NULL, 10);
262 printf("%s\n\n%s", version, legal);
271 rnd_seed = pick_seed();
274 if (emp_config(config_file) < 0)
278 parse_args(argc - optind, argv + optind);
283 qprint("\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
284 qprint("seed is %u\n", rnd_seed);
289 qprint("\ntry #%d (out of %d)...\n", try + 1, NUMTRIES);
290 qprint("placing capitals...\n");
292 qprint("unstable drift\n");
293 qprint("growing continents...\n");
294 done = grow_continents();
295 } while (!done && ++try < NUMTRIES);
297 fprintf(stderr, "%s: world not large enough to hold continents\n",
301 qprint("growing islands:");
303 qprint("\nelevating land...\n");
306 qprint("writing to sectors file...\n");
307 if (!write_newcap_script())
309 if (chdir(gamedir)) {
310 fprintf(stderr, "%s: can't chdir to %s (%s)\n",
311 program_name, gamedir, strerror(errno));
314 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
317 if (!ef_close(EF_SECTOR))
321 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
331 puts("Creating a planet with:\n");
332 printf("%d continents\n", nc);
333 printf("continent size: %d\n", sc);
334 printf("number of islands: %d\n", ni);
335 printf("average size of islands: %d\n", is);
336 printf("spike: %d%%\n", sp);
337 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
338 pm, (pm * sc) / 100);
339 printf("minimum distance between continents: %d\n", di);
340 printf("minimum distance from islands to continents: %d\n", id);
341 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
345 help(char *complaint)
348 fprintf(stderr, "%s: %s\n", program_name, complaint);
349 fprintf(stderr, "Try -h for help.\n");
355 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
356 " -e CONFIG-FILE configuration file\n"
358 " -i islands may merge\n"
360 " -R SEED seed for random number generator\n"
361 " -s SCRIPT name of script to create (default %s)\n"
362 " -h display this help and exit\n"
363 " -v display version information and exit\n"
364 " NC number of continents\n"
365 " SC continent size\n"
366 " NI number of islands (default NC)\n"
367 " IS average island size (default SC/2)\n"
368 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
369 " PM percentage of land that is mountain (default %d)\n"
370 " DI minimum distance between continents (default %d)\n"
371 " ID minimum distance from islands to continents (default %d)\n",
372 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
373 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
377 parse_args(int argc, char *argv[])
379 int dist_max = mapdist(0, 0, WORLD_X / 2, WORLD_Y / 2);
382 help("missing arguments");
386 help("too many arguments");
391 fprintf(stderr, "%s: number of continents must be > 0\n",
398 fprintf(stderr, "%s: size of continents must be > 1\n",
409 fprintf(stderr, "%s: number of islands must be >= 0\n",
417 fprintf(stderr, "%s: size of islands must be > 0\n",
424 if (sp < 0 || sp > 100) {
426 "%s: spike percentage must be between 0 and 100\n",
433 if (pm < 0 || pm > 100) {
435 "%s: mountain percentage must be between 0 and 100\n",
443 fprintf(stderr, "%s: distance between continents must be >= 0\n",
448 fprintf(stderr, "%s: distance between continents too large\n",
457 "%s: distance from islands to continents must be >= 0\n",
463 "%s: distance from islands to continents too large\n",
469 /****************************************************************************
470 VARIABLE INITIALIZATION
471 ****************************************************************************/
474 allocate_memory(void)
478 capx = calloc(nc, sizeof(int));
479 capy = calloc(nc, sizeof(int));
480 own = calloc(WORLD_X, sizeof(int *));
481 elev = calloc(WORLD_X, sizeof(int *));
482 for (i = 0; i < WORLD_X; ++i) {
483 own[i] = calloc(WORLD_Y, sizeof(int));
484 elev[i] = calloc(WORLD_Y, sizeof(int));
486 sectx = calloc(nc + ni, sizeof(int *));
487 secty = calloc(nc + ni, sizeof(int *));
488 sectc = calloc(nc + ni, sizeof(int *));
489 isecs = calloc(nc + ni, sizeof(int));
490 weight = calloc(MAX(sc, is * 2), sizeof(int));
491 dsea = calloc(MAX(sc, is * 2), sizeof(int));
492 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
493 for (i = 0; i < nc; ++i) {
494 sectx[i] = calloc(sc, sizeof(int));
495 secty[i] = calloc(sc, sizeof(int));
496 sectc[i] = calloc(sc, sizeof(int));
498 for (i = nc; i < nc + ni; ++i) {
499 sectx[i] = calloc(is * 2, sizeof(int));
500 secty[i] = calloc(is * 2, sizeof(int));
501 sectc[i] = calloc(is * 2, sizeof(int));
511 for (i = 0; i < WORLD_X; ++i) {
512 for (j = 0; j < WORLD_Y; ++j) {
518 /****************************************************************************
519 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
520 ****************************************************************************/
523 * How isolated is capital @j at @newx,@newy?
524 * Return the distance to the closest other capital.
527 iso(int j, int newx, int newy)
532 for (i = 0; i < nc; ++i) {
535 md = mapdist(capx[i], capy[i], newx, newy);
545 * Return 1 for a stable drift, 0 for an unstable one.
552 for (i = 0; i < nc; i++) {
553 capy[i] = (2 * i) / WORLD_X;
554 capx[i] = (2 * i) % WORLD_X + capy[i] % 2;
555 if (capy[i] >= WORLD_Y) {
557 "%s: world not big enough for all the continents\n",
563 for (turns = 0; turns < DRIFT_MAX; ++turns) {
566 for (i = 0; i < nc; ++i)
573 * Has the drift stabilized?
574 * @turns is the number of turns so far.
579 static int mc[STABLE_CYCLE];
580 int i, isod, d = 0, stab = 1;
583 for (i = 0; i < STABLE_CYCLE; i++)
587 if (turns <= DRIFT_BEFORE_CHECK)
590 for (i = 0; i < nc; ++i) {
591 isod = iso(i, capx[i], capy[i]);
596 for (i = 0; i < STABLE_CYCLE; ++i)
600 mc[turns % STABLE_CYCLE] = d;
604 /* This routine does the actual drifting
610 int i, n, newx, newy;
612 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
613 newx = new_x(capx[j] + dirx[i]);
614 newy = new_y(capy[j] + diry[i]);
615 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
623 /****************************************************************************
625 ****************************************************************************/
627 /* Look for a coastal sector of continent c
635 for (i = 0; i < isecs[c]; ++i) {
637 for (j = 0; j < 6; ++j)
638 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
643 struct hexagon_iter {
648 * Start iterating around @x0,@y0 at distance @d.
649 * Set *x,*y to coordinates of the first sector.
652 hexagon_first(struct hexagon_iter *iter, int x0, int y0, int n,
655 *x = new_x(x0 - 2 * n);
657 iter->dir = DIR_FIRST;
663 * Continue iteration started with hexagon_first().
664 * Set *x,*y to coordinates of the next sector.
665 * Return whether we're back at the first sector, i.e. iteration is
669 hexagon_next(struct hexagon_iter *iter, int *x, int *y)
671 *x = new_x(*x + diroff[iter->dir][0]);
672 *y = new_y(*y + diroff[iter->dir][1]);
674 if (iter->i == iter->n) {
678 return iter->dir <= DIR_LAST;
682 try_to_grow(int c, int newx, int newy, int extra_dist)
684 int d = (c < nc ? di : id) + extra_dist;
686 struct hexagon_iter hexit;
688 if (own[newx][newy] != -1)
691 for (i = 1; i <= d; ++i) {
692 hexagon_first(&hexit, newx, newy, i, &px, &py);
694 if (own[px][py] != -1 &&
696 (DISTINCT_ISLANDS || own[px][py] < nc))
698 } while (hexagon_next(&hexit, &px, &py));
700 sectx[c][isecs[c]] = newx;
701 secty[c][isecs[c]] = 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
738 new_try(int c, int spike)
747 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
752 } while (i != starti);
759 /* Grow continent c by 1 sector
763 grow_one_sector(int c)
765 int spike = roll0(100) < sp;
766 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
768 if ((try1 = new_try(c, spike)) == -1)
770 x = sx = sectx[c][try1];
771 y = sy = secty[c][try1];
776 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
777 newx = new_x(x + dirx[i]);
778 newy = new_y(y + diry[i]);
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, 0))
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 (try_to_grow(c, newx, newy, 0))
792 next_coast(c, x, y, &x, &y);
794 } while (!done && coast_search < COAST_SEARCH_MAX &&
795 (isecs[c] == 1 || x != sx || y != sy));
800 * Grow the continents.
801 * Return 1 on success, 0 on error.
804 grow_continents(void)
809 for (c = 0; c < nc; ++c) {
811 if (!try_to_grow(c, capx[c], capy[c], 0)
812 || !try_to_grow(c, new_x(capx[c] + 2), capy[c], 0)) {
819 qprint("No room for continents\n");
823 for (secs = 2; secs < sc && done; secs++) {
824 for (c = 0; c < nc; ++c) {
826 if (!grow_one_sector(c))
831 for (c = 0; c < nc; ++c)
835 qprint("Only managed to grow %d out of %d sectors.\n",
841 /****************************************************************************
843 ****************************************************************************/
845 /* Choose a place to start growing an island from
848 place_island(int c, int *xp, int *yp)
851 int ssy = roll0(WORLD_Y);
852 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
854 if (ssx > WORLD_X - 2)
855 ssx = new_x(ssx + 2);
856 for (d = di; d >= 0; --d) {
860 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
861 if (*xp >= WORLD_X) {
862 *yp = new_y(*yp + 1);
864 if (*xp == sx && *yp == sy)
867 if (try_to_grow(c, *xp, *yp, d))
874 /* Grow all the islands
880 int stunted_islands = 0;
881 int c, secs, x, y, isiz;
883 for (c = nc; c < nc + ni; ++c) {
884 if (!place_island(c, &x, &y)) {
885 qprint("\nNo room for island #%d", c - nc + 1);
889 isiz = roll(is) + roll0(is);
890 for (secs = 1; secs < isiz; secs++) {
892 if (!grow_one_sector(c)) {
899 qprint(" %d(%d)", c - nc + 1, secs);
904 qprint("\n%d stunted island%s",
905 stunted_islands, splur(stunted_islands));
908 /****************************************************************************
910 ****************************************************************************/
912 create_elevations(void)
916 for (i = 0; i < WORLD_X; i++) {
917 for (j = 0; j < WORLD_Y; j++)
918 elev[i][j] = -INFINITE_ELEVATION;
924 /* Generic function for finding the distance to the closest sea, land, or
928 distance_to_what(int x, int y, int flag)
931 struct hexagon_iter hexit;
933 for (d = 1; d < 5; ++d) {
934 hexagon_first(&hexit, x, y, d, &px, &py);
937 case 0: /* distance to sea */
938 if (own[px][py] == -1)
941 case 1: /* distance to land */
942 if (own[px][py] != -1)
945 case 2: /* distance to mountain */
946 if (elev[px][py] == INFINITE_ELEVATION)
950 } while (hexagon_next(&hexit, &px, &py));
955 #define ELEV elev[sectx[c][i]][secty[c][i]]
956 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
957 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
959 /* Decide where the mountains go
964 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
967 for (c = 0; c < ctot; ++c) {
970 nm = (pm * ns) / 100;
972 /* Place the mountains */
974 for (i = 0; i < ns; ++i) {
975 dsea[i] = distance_to_sea();
976 weight[i] = (total += (dsea[i] * dsea[i]));
979 for (k = nm, mountain_search = 0;
980 k && mountain_search < MOUNTAIN_SEARCH_MAX;
983 for (i = 0; i < ns; ++i)
984 if (r < weight[i] && ELEV == -INFINITE_ELEVATION &&
986 ((!(capx[c] == sectx[c][i] &&
987 capy[c] == secty[c][i])) &&
988 (!(new_x(capx[c] + 2) == sectx[c][i] &&
989 capy[c] == secty[c][i]))))) {
990 ELEV = INFINITE_ELEVATION;
996 /* Elevate land that is not mountain and not capital */
998 for (i = 0; i < ns; ++i)
999 dmoun[i] = distance_to_mountain();
1000 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
1001 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
1002 100 * INFINITE_ELEVATION;
1003 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
1006 for (i = 0; i < ns; ++i) {
1007 if (ELEV == -INFINITE_ELEVATION &&
1008 (c >= nc || ((!(capx[c] == sectx[c][i] &&
1009 capy[c] == secty[c][i])) &&
1010 (!(new_x(capx[c] + 2) == sectx[c][i] &&
1011 capy[c] == secty[c][i]))))) {
1012 h = 3 * (5 - dmoun[i]) + dsea[i];
1023 if (newk >= HILLMIN && newk < PLATMIN)
1027 elev[sectx[c][where]][secty[c][where]] = newk;
1030 /* Elevate the mountains and capitals */
1032 for (i = 0; i < ns; ++i) {
1033 if (ELEV == INFINITE_ELEVATION) {
1035 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
1037 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
1038 roll0((256 - HIGHMIN) / 2);
1039 } else if (c < nc &&
1040 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
1041 ((new_x(capx[c] + 2) == sectx[c][i] &&
1042 capy[c] == secty[c][i]))))
1048 #define distance_to_land() distance_to_what(x, y, 1)
1055 for (y = 0; y < WORLD_Y; ++y) {
1056 for (x = y % 2; x < WORLD_X; x += 2) {
1057 if (elev[x][y] == -INFINITE_ELEVATION)
1058 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1064 elev_to_sct_type(int elevation)
1066 if (elevation < LANDMIN)
1068 if (elevation < HILLMIN)
1070 if (elevation < PLATMIN)
1072 if (elevation < HIGHMIN)
1077 /****************************************************************************
1079 ****************************************************************************/
1086 fert = LANDMIN - e + 40;
1087 else if (e < FERT_MAX)
1088 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1099 oil = (LANDMIN - e) * 2 + roll0(2);
1100 else if (e <= OIL_MAX)
1101 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1111 if (e >= IRON_MIN && e < HIGHMIN)
1112 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1122 if (e >= GOLD_MIN) {
1124 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1126 gold = 100 - 20 * HIGHMIN / e;
1137 if (e >= URAN_MIN && e < HIGHMIN)
1138 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1145 add_resources(struct sctstr *sct)
1147 sct->sct_fertil = set_fert(sct->sct_elev);
1148 sct->sct_oil = set_oil(sct->sct_elev);
1149 sct->sct_min = set_iron(sct->sct_elev);
1150 sct->sct_gmin = set_gold(sct->sct_elev);
1151 sct->sct_uran = set_uran(sct->sct_elev);
1154 /****************************************************************************
1155 DESIGNATE THE SECTORS
1156 ****************************************************************************/
1164 for (y = 0; y < WORLD_Y; y++) {
1165 for (x = y % 2; x < WORLD_X; x += 2) {
1166 sct = getsectp(x, y);
1167 sct->sct_elev = elev[x][y];
1168 sct->sct_type = elev_to_sct_type(elev[x][y]);
1169 sct->sct_newtype = sct->sct_type;
1170 sct->sct_dterr = own[sct->sct_x][y] + 1;
1174 set_coastal_flags();
1177 /****************************************************************************
1178 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1179 ****************************************************************************/
1183 int sx, sy, x, y, c, type;
1186 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1191 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1194 type = elev_to_sct_type(elev[x][y]);
1195 if (type == SCT_WATER)
1197 else if (type == SCT_MOUNT)
1202 assert(0 <= c && c < nc);
1203 if ((x == capx[c] || x == new_x(capx[c] + 2))
1205 printf("%c ", numletter[c % 62]);
1215 * Print a map to help visualize own[][].
1216 * This is for debugging.
1223 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1226 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1230 else if (own[x][y] == -1)
1233 putchar(numletter[own[x][y] % 62]);
1240 * Print a map to help visualize elev[][].
1241 * This is for debugging. It expects the terminal to understand
1242 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1245 print_elev_map(void)
1247 int sx, sy, x, y, sat;
1249 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1252 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1256 else if (!elev[x][y])
1258 else if (elev[x][y] < 0) {
1259 sat = 256 + elev[x][y] * 2;
1260 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1261 } else if (elev[x][y] < HIGHMIN / 2) {
1262 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1263 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1264 } else if (elev[x][y] < HIGHMIN) {
1265 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1266 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1268 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1269 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1276 /***************************************************************************
1277 WRITE A SCRIPT FOR PLACING CAPITALS
1278 ****************************************************************************/
1280 write_newcap_script(void)
1283 FILE *script = fopen(outfile, "w");
1286 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1287 program_name, outfile, strerror(errno));
1291 for (c = 0; c < nc; ++c) {
1292 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1293 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1295 fprintf(script, "add %d visitor visitor v\n", c + 1);
1301 qprint(const char *const fmt, ...)
1307 vfprintf(stdout, fmt, ap);
1313 set_coastal_flags(void)
1318 for (i = 0; i < nc + ni; ++i) {
1319 for (j = 0; j < isecs[i]; j++) {
1320 sp = getsectp(sectx[i][j], secty[i][j]);
1321 sp->sct_coastal = sectc[i][j];