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",
422 sp = LIMIT_TO(sp, 0, 100);
427 pm = DEFAULT_MOUNTAIN;
434 di = DEFAULT_CONTDIST;
437 fprintf(stderr, "%s: distance between continents must be >= 0\n",
441 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
442 fprintf(stderr, "%s: distance between continents too large\n",
450 id = DEFAULT_ISLDIST;
453 "%s: distance from islands to continents must be >= 0\n",
457 if (id > WORLD_X || id > WORLD_Y) {
459 "%s: distance from islands to continents too large\n",
465 /****************************************************************************
466 VARIABLE INITIALIZATION
467 ****************************************************************************/
470 allocate_memory(void)
474 capx = calloc(nc, sizeof(int));
475 capy = calloc(nc, sizeof(int));
476 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
477 mc = calloc(STABLE_CYCLE, sizeof(int));
478 own = calloc(WORLD_X, sizeof(int *));
479 elev = calloc(WORLD_X, sizeof(int *));
480 for (i = 0; i < WORLD_X; ++i) {
481 own[i] = calloc(WORLD_Y, sizeof(int));
482 elev[i] = calloc(WORLD_Y, sizeof(int));
484 sectx = calloc(nc + ni, sizeof(int *));
485 secty = calloc(nc + ni, sizeof(int *));
486 sectc = calloc(nc + ni, sizeof(int *));
487 isecs = calloc(nc + ni, sizeof(int));
488 weight = calloc(MAX(sc, is * 2), sizeof(int));
489 dsea = calloc(MAX(sc, is * 2), sizeof(int));
490 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
491 for (i = 0; i < nc; ++i) {
492 sectx[i] = calloc(sc, sizeof(int));
493 secty[i] = calloc(sc, sizeof(int));
494 sectc[i] = calloc(sc, sizeof(int));
496 for (i = nc; i < nc + ni; ++i) {
497 sectx[i] = calloc(is * 2, sizeof(int));
498 secty[i] = calloc(is * 2, sizeof(int));
499 sectc[i] = calloc(is * 2, sizeof(int));
507 int i, j, xx = 0, yy = 0;
512 for (i = 0; i < WORLD_X; ++i) {
513 for (j = 0; j < WORLD_Y; ++j) {
515 elev[i][j] = -INFINITY;
519 for (i = 0; i < nc; ++i) {
525 "%s: world not big enough for all the continents\n",
534 for (i = 0; i < STABLE_CYCLE; ++i)
538 /****************************************************************************
539 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
540 ****************************************************************************/
542 /* How isolated is capital j?
545 iso(int j, int newx, int newy)
547 int i, md, d = WORLD_X + WORLD_Y;
549 for (i = 0; i < nc; ++i) {
552 md = mapdist(capx[i], capy[i], newx, newy);
560 /* Drift all the capitals
567 for (turns = 0; turns < DRIFT_MAX; ++turns) {
568 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
570 for (i = 0; i < nc; ++i)
576 /* Check to see if we have stabilized--can we stop drifting the capitals?
582 int i, isod, d = 0, stab = 1;
584 for (i = 0; i < nc; ++i) {
585 isod = iso(i, capx[i], capy[i]);
589 for (i = 0; i < STABLE_CYCLE; ++i)
593 mcc = (mcc + 1) % STABLE_CYCLE;
597 /* This routine does the actual drifting
603 int i, n, newx, newy;
605 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
606 newx = new_x(capx[j] + dirx[i]);
607 newy = new_y(capy[j] + diry[i]);
608 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
616 /****************************************************************************
618 ****************************************************************************/
620 /* Look for a coastal sector of continent c
628 for (i = 0; i < secs; ++i) {
630 for (j = 0; j < 6; ++j)
631 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
636 /* Used for measuring distances
648 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
651 return i > 1 || vector[0] > 0;
654 /* Test to see if we're allowed to grow there: the arguments di and id
657 try_to_grow(int c, int newx, int newy, int d)
661 for (i = 1; i <= d; ++i) {
662 for (j = 0; j < i; ++j)
667 for (j = 0; j < i; ++j) {
668 px = new_x(px + dirx[vector[j]]);
669 py = new_y(py + diry[vector[j]]);
671 if (own[px][py] != -1 &&
673 (DISTINCT_ISLANDS || own[px][py] < nc))
675 } while (next_vector(i));
677 sectx[c][secs] = newx;
678 secty[c][secs] = newy;
683 /* Move along the coast in a clockwise direction.
687 next_coast(int c, int x, int y, int *xp, int *yp)
689 int i, nx, ny, wat = 0;
697 for (i = 0; i < 12; ++i) {
698 nx = new_x(x + dirx[i % 6]);
699 ny = new_y(y + diry[i % 6]);
700 if (own[nx][ny] == -1)
702 if (wat && own[nx][ny] == c) {
710 /* Choose a sector to grow from
722 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
727 } while (i != starti);
734 /* Grow continent c by 1 sector
738 grow_one_sector(int c)
740 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
742 spike = roll0(100) < sp;
743 if ((try1 = new_try(c)) == -1)
745 x = sx = sectx[c][try1];
746 y = sy = secty[c][try1];
751 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
752 newx = new_x(x + dirx[i]);
753 newy = new_y(y + diry[i]);
754 if (own[newx][newy] == -1 &&
756 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
757 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
758 if (try_to_grow(c, newx, newy, c < nc ? di : id))
762 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
763 newx = new_x(x + dirx[i]);
764 newy = new_y(y + diry[i]);
765 if (own[newx][newy] == -1)
766 if (try_to_grow(c, newx, newy, c < nc ? di : id))
769 next_coast(c, x, y, &x, &y);
771 } while (!done && coast_search < COAST_SEARCH_MAX &&
772 (secs == 1 || x != sx || y != sy));
774 fl_status |= STATUS_NO_ROOM;
778 /* Grow all the continents
781 grow_continents(void)
785 for (c = 0; c < nc; ++c) {
786 sectx[c][0] = capx[c];
787 secty[c][0] = capy[c];
788 own[sectx[c][0]][secty[c][0]] = c;
789 sectx[c][1] = new_x(capx[c] + 2);
790 secty[c][1] = capy[c];
791 own[sectx[c][1]][secty[c][1]] = c;
794 for (secs = 2; secs < sc && !fl_status; ++secs) {
795 for (c = 0; c < nc; ++c) {
800 for (c = 0; c < nc; ++c)
804 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
808 /****************************************************************************
810 ****************************************************************************/
812 /* Choose a place to start growing an island from
815 place_island(int c, int *xp, int *yp)
818 int ssy = roll0(WORLD_Y);
819 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
821 if (ssx > WORLD_X - 2)
822 ssx = new_x(ssx + 2);
823 for (d = di + id; d >= id; --d) {
827 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
828 if (*xp >= WORLD_X) {
829 *yp = new_y(*yp + 1);
831 if (*xp == sx && *yp == sy)
834 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
841 /* Grow all the islands
849 for (c = nc; c < nc + ni; ++c) {
851 if (!place_island(c, &x, &y))
853 isiz = roll(is) + roll0(is);
857 } while (secs < isiz && grow_one_sector(c));
859 qprint(" %d(%d)", c - nc + 1, secs);
865 /****************************************************************************
867 ****************************************************************************/
869 create_elevations(void)
875 /* Generic function for finding the distance to the closest sea, land, or
879 distance_to_what(int x, int y, int flag)
883 for (d = 1; d < 5; ++d) {
884 for (j = 0; j < d; ++j)
889 for (j = 0; j < d; ++j) {
890 px = new_x(px + dirx[vector[j]]);
891 py = new_y(py + diry[vector[j]]);
894 case 0: /* distance to sea */
895 if (own[px][py] == -1)
898 case 1: /* distance to land */
899 if (own[px][py] != -1)
902 case 2: /* distance to mountain */
903 if (elev[px][py] == INFINITY)
907 } while (next_vector(d));
912 #define ELEV elev[sectx[c][i]][secty[c][i]]
913 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
914 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
916 /* Decide where the mountains go
921 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
924 for (c = 0; c < ctot; ++c) {
926 ns = (c < nc) ? sc : isecs[c];
927 nm = (pm * ns) / 100;
929 /* Place the mountains */
931 for (i = 0; i < ns; ++i) {
932 dsea[i] = distance_to_sea();
933 weight[i] = (total += (dsea[i] * dsea[i]));
936 for (k = nm, mountain_search = 0;
937 k && mountain_search < MOUNTAIN_SEARCH_MAX;
940 for (i = 0; i < ns; ++i)
941 if (r < weight[i] && ELEV == -INFINITY &&
943 ((!(capx[c] == sectx[c][i] &&
944 capy[c] == secty[c][i])) &&
945 (!(new_x(capx[c] + 2) == sectx[c][i] &&
946 capy[c] == secty[c][i]))))) {
953 /* Elevate land that is not mountain and not capital */
955 for (i = 0; i < ns; ++i)
956 dmoun[i] = distance_to_mountain();
957 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
958 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
960 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
963 for (i = 0; i < ns; ++i) {
964 if (ELEV != INFINITY &&
965 (c >= nc || ((!(capx[c] == sectx[c][i] &&
966 capy[c] == secty[c][i])) &&
967 (!(new_x(capx[c] + 2) == sectx[c][i] &&
968 capy[c] == secty[c][i]))))) {
969 h = 3 * (5 - dmoun[i]) + dsea[i];
979 if (newk >= HILLMIN && newk < PLATMIN)
983 elev[sectx[c][where]][secty[c][where]] = newk;
984 dsea[where] = -INFINITY;
985 dmoun[where] = INFINITY;
988 /* Elevate the mountains and capitals */
990 for (i = 0; i < ns; ++i) {
991 if (ELEV == INFINITY) {
993 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
995 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
996 roll0((256 - HIGHMIN) / 2);
998 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
999 ((new_x(capx[c] + 2) == sectx[c][i] &&
1000 capy[c] == secty[c][i]))))
1006 #define distance_to_land() distance_to_what(x, y, 1)
1013 for (y = 0; y < WORLD_Y; ++y) {
1014 for (x = y % 2; x < WORLD_X; x += 2) {
1015 if (elev[x][y] == -INFINITY)
1016 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1021 /****************************************************************************
1023 ****************************************************************************/
1030 fert = LANDMIN - e + 40;
1031 else if (e < FERT_MAX)
1032 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1043 oil = (LANDMIN - e) * 2 + roll0(2);
1044 else if (e <= OIL_MAX)
1045 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1055 if (e >= IRON_MIN && e < HIGHMIN)
1056 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1066 if (e >= GOLD_MIN) {
1068 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1070 gold = 100 - 20 * HIGHMIN / e;
1081 if (e >= URAN_MIN && e < HIGHMIN)
1082 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1089 add_resources(struct sctstr *sct)
1091 sct->sct_fertil = set_fert(sct->sct_elev);
1092 sct->sct_oil = set_oil(sct->sct_elev);
1093 sct->sct_min = set_iron(sct->sct_elev);
1094 sct->sct_gmin = set_gold(sct->sct_elev);
1095 sct->sct_uran = set_uran(sct->sct_elev);
1098 /****************************************************************************
1099 DESIGNATE THE SECTORS
1100 ****************************************************************************/
1108 for (y = 0; y < WORLD_Y; y++) {
1109 for (x = y % 2; x < WORLD_X; x += 2) {
1110 sct = getsectp(x, y);
1112 if (total < LANDMIN) {
1113 sct->sct_type = SCT_WATER;
1114 } else if (total < HILLMIN)
1115 sct->sct_type = SCT_RURAL;
1116 else if (total < PLATMIN)
1117 sct->sct_type = SCT_MOUNT;
1118 else if (total < HIGHMIN)
1119 sct->sct_type = SCT_RURAL;
1121 sct->sct_type = SCT_MOUNT;
1122 sct->sct_elev = total;
1123 sct->sct_newtype = sct->sct_type;
1124 sct->sct_dterr = own[sct->sct_x][y] + 1;
1128 set_coastal_flags();
1131 /****************************************************************************
1132 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1133 ****************************************************************************/
1140 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1145 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1147 if (own[x][y] == -1)
1150 printf("%c ", map_symbol(x, y));
1158 map_symbol(int x, int y)
1162 for (c = 0; c < nc; ++c)
1163 if ((x == capx[c] && y == capy[c])
1164 || (x == new_x(capx[c] + 2) && y == capy[c]))
1165 return numletter[own[x][y] % 62];
1166 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1167 || elev[x][y] >= HIGHMIN)
1169 return own[x][y] >= nc ? '%' : '#';
1173 * Print a map to help visualize own[][].
1174 * This is for debugging.
1181 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1184 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1188 else if (own[x][y] == -1)
1191 putchar(numletter[own[x][y] % 62]);
1198 * Print a map to help visualize elev[][].
1199 * This is for debugging. It expects the terminal to understand
1200 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1203 print_elev_map(void)
1205 int sx, sy, x, y, sat;
1207 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1210 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1214 else if (!elev[x][y])
1216 else if (elev[x][y] < 0) {
1217 sat = 256 + elev[x][y] * 2;
1218 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1219 } else if (elev[x][y] < HIGHMIN / 2) {
1220 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1221 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1222 } else if (elev[x][y] < HIGHMIN) {
1223 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1224 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1226 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1227 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1234 /***************************************************************************
1235 WRITE A SCRIPT FOR PLACING CAPITALS
1236 ****************************************************************************/
1238 write_newcap_script(void)
1241 FILE *script = fopen(outfile, "w");
1244 fprintf(stderr, "%s: unable to write to %s (%s)\n",
1245 program_name, outfile, strerror(errno));
1249 for (c = 0; c < nc; ++c) {
1250 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1251 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1253 fprintf(script, "add %d visitor visitor v\n", c + 1);
1259 qprint(const char *const fmt, ...)
1265 vfprintf(stdout, fmt, ap);
1271 set_coastal_flags(void)
1276 for (i = 0; i < nc; ++i) {
1277 for (j = 0; j < sc; j++) {
1278 sp = getsectp(sectx[i][j], secty[i][j]);
1279 sp->sct_coastal = sectc[i][j];
1282 for (i = nc; i < nc + ni; ++i) {
1283 for (j = 0; j < isecs[i]; j++) {
1284 sp = getsectp(sectx[i][j], secty[i][j]);
1285 sp->sct_coastal = sectc[i][j];