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 fputs("ERROR: 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, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
318 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
321 if (!ef_close(EF_SECTOR))
325 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
335 puts("Creating a planet with:\n");
336 printf("%d continents\n", nc);
337 printf("continent size: %d\n", sc);
338 printf("number of islands: %d\n", ni);
339 printf("average size of islands: %d\n", is);
340 printf("spike: %d%%\n", sp);
341 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
342 pm, (pm * sc) / 100);
343 printf("minimum distance between continents: %d\n", di);
344 printf("minimum distance from islands to continents: %d\n", id);
345 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
349 help(char *complaint)
352 fprintf(stderr, "%s: %s\n", program_name, complaint);
353 fprintf(stderr, "Try -h for help.\n");
359 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
360 " -e CONFIG-FILE configuration file\n"
362 " -i islands may merge\n"
364 " -R SEED seed for random number generator\n"
365 " -s SCRIPT name of script to create (default %s)\n"
366 " -h display this help and exit\n"
367 " -v display version information and exit\n"
368 " NC number of continents\n"
369 " SC continent size\n"
370 " NI number of islands (default NC)\n"
371 " IS average island size (default SC/2)\n"
372 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
373 " PM percentage of land that is mountain (default %d)\n"
374 " DI minimum distance between continents (default %d)\n"
375 " ID minimum distance from islands to continents (default %d)\n",
376 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
377 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
381 parse_args(int argc, char *argv[])
384 help("missing arguments");
388 help("too many arguments");
394 "fairland: error -- number of continents must be > 0");
401 "fairland: error -- size of continents must be > 0");
421 sp = LIMIT_TO(sp, 0, 100);
426 pm = DEFAULT_MOUNTAIN;
433 di = DEFAULT_CONTDIST;
437 "fairland: error -- distance between continents must be >= 0");
440 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
442 "fairland: error -- distance between continents too large");
449 id = DEFAULT_ISLDIST;
452 "fairland: error -- distance from islands to continents must be >= 0");
455 if (id > WORLD_X || id > WORLD_Y) {
457 "fairland: error -- distance from islands to continents too large");
462 /****************************************************************************
463 VARIABLE INITIALIZATION
464 ****************************************************************************/
467 allocate_memory(void)
471 capx = calloc(nc, sizeof(int));
472 capy = calloc(nc, sizeof(int));
473 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
474 mc = calloc(STABLE_CYCLE, sizeof(int));
475 own = calloc(WORLD_X, sizeof(int *));
476 elev = calloc(WORLD_X, sizeof(int *));
477 for (i = 0; i < WORLD_X; ++i) {
478 own[i] = calloc(WORLD_Y, sizeof(int));
479 elev[i] = calloc(WORLD_Y, sizeof(int));
481 sectx = calloc(nc + ni, sizeof(int *));
482 secty = calloc(nc + ni, sizeof(int *));
483 sectc = calloc(nc + ni, sizeof(int *));
484 isecs = calloc(nc + ni, sizeof(int));
485 weight = calloc(MAX(sc, is * 2), sizeof(int));
486 dsea = calloc(MAX(sc, is * 2), sizeof(int));
487 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
488 for (i = 0; i < nc; ++i) {
489 sectx[i] = calloc(sc, sizeof(int));
490 secty[i] = calloc(sc, sizeof(int));
491 sectc[i] = calloc(sc, sizeof(int));
493 for (i = nc; i < nc + ni; ++i) {
494 sectx[i] = calloc(is * 2, sizeof(int));
495 secty[i] = calloc(is * 2, sizeof(int));
496 sectc[i] = calloc(is * 2, sizeof(int));
504 int i, j, xx = 0, yy = 0;
509 for (i = 0; i < WORLD_X; ++i) {
510 for (j = 0; j < WORLD_Y; ++j) {
512 elev[i][j] = -INFINITY;
516 for (i = 0; i < nc; ++i) {
522 "fairland error: world not big enough for all the continents.\n");
530 for (i = 0; i < STABLE_CYCLE; ++i)
534 /****************************************************************************
535 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
536 ****************************************************************************/
538 /* How isolated is capital j?
541 iso(int j, int newx, int newy)
543 int i, md, d = WORLD_X + WORLD_Y;
545 for (i = 0; i < nc; ++i) {
548 md = mapdist(capx[i], capy[i], newx, newy);
556 /* Drift all the capitals
563 for (turns = 0; turns < DRIFT_MAX; ++turns) {
564 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
566 for (i = 0; i < nc; ++i)
572 /* Check to see if we have stabilized--can we stop drifting the capitals?
578 int i, isod, d = 0, stab = 1;
580 for (i = 0; i < nc; ++i) {
581 isod = iso(i, capx[i], capy[i]);
585 for (i = 0; i < STABLE_CYCLE; ++i)
589 mcc = (mcc + 1) % STABLE_CYCLE;
593 /* This routine does the actual drifting
599 int i, n, newx, newy;
601 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
602 newx = new_x(capx[j] + dirx[i]);
603 newy = new_y(capy[j] + diry[i]);
604 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
612 /****************************************************************************
614 ****************************************************************************/
616 /* Look for a coastal sector of continent c
624 for (i = 0; i < secs; ++i) {
626 for (j = 0; j < 6; ++j)
627 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
632 /* Used for measuring distances
644 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
647 return i > 1 || vector[0] > 0;
650 /* Test to see if we're allowed to grow there: the arguments di and id
653 try_to_grow(int c, int newx, int newy, int d)
657 for (i = 1; i <= d; ++i) {
658 for (j = 0; j < i; ++j)
663 for (j = 0; j < i; ++j) {
664 px = new_x(px + dirx[vector[j]]);
665 py = new_y(py + diry[vector[j]]);
667 if (own[px][py] != -1 &&
669 (DISTINCT_ISLANDS || own[px][py] < nc))
671 } while (next_vector(i));
673 sectx[c][secs] = newx;
674 secty[c][secs] = newy;
679 /* Move along the coast in a clockwise direction.
683 next_coast(int c, int x, int y, int *xp, int *yp)
685 int i, nx, ny, wat = 0;
693 for (i = 0; i < 12; ++i) {
694 nx = new_x(x + dirx[i % 6]);
695 ny = new_y(y + diry[i % 6]);
696 if (own[nx][ny] == -1)
698 if (wat && own[nx][ny] == c) {
706 /* Choose a sector to grow from
718 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
723 } while (i != starti);
730 /* Grow continent c by 1 sector
734 grow_one_sector(int c)
736 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
738 spike = roll0(100) < sp;
739 if ((try1 = new_try(c)) == -1)
741 x = sx = sectx[c][try1];
742 y = sy = secty[c][try1];
747 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
748 newx = new_x(x + dirx[i]);
749 newy = new_y(y + diry[i]);
750 if (own[newx][newy] == -1 &&
752 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
753 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
754 if (try_to_grow(c, newx, newy, c < nc ? di : id))
758 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
759 newx = new_x(x + dirx[i]);
760 newy = new_y(y + diry[i]);
761 if (own[newx][newy] == -1)
762 if (try_to_grow(c, newx, newy, c < nc ? di : id))
765 next_coast(c, x, y, &x, &y);
767 } while (!done && coast_search < COAST_SEARCH_MAX &&
768 (secs == 1 || x != sx || y != sy));
770 fl_status |= STATUS_NO_ROOM;
774 /* Grow all the continents
777 grow_continents(void)
781 for (c = 0; c < nc; ++c) {
782 sectx[c][0] = capx[c];
783 secty[c][0] = capy[c];
784 own[sectx[c][0]][secty[c][0]] = c;
785 sectx[c][1] = new_x(capx[c] + 2);
786 secty[c][1] = capy[c];
787 own[sectx[c][1]][secty[c][1]] = c;
790 for (secs = 2; secs < sc && !fl_status; ++secs) {
791 for (c = 0; c < nc; ++c) {
796 for (c = 0; c < nc; ++c)
800 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
804 /****************************************************************************
806 ****************************************************************************/
808 /* Choose a place to start growing an island from
811 place_island(int c, int *xp, int *yp)
814 int ssy = roll0(WORLD_Y);
815 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
817 if (ssx > WORLD_X - 2)
818 ssx = new_x(ssx + 2);
819 for (d = di + id; d >= id; --d) {
823 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
824 if (*xp >= WORLD_X) {
825 *yp = new_y(*yp + 1);
827 if (*xp == sx && *yp == sy)
830 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
837 /* Grow all the islands
845 for (c = nc; c < nc + ni; ++c) {
847 if (!place_island(c, &x, &y))
849 isiz = roll(is) + roll0(is);
853 } while (secs < isiz && grow_one_sector(c));
855 qprint(" %d(%d)", c - nc + 1, secs);
861 /****************************************************************************
863 ****************************************************************************/
865 create_elevations(void)
871 /* Generic function for finding the distance to the closest sea, land, or
875 distance_to_what(int x, int y, int flag)
879 for (d = 1; d < 5; ++d) {
880 for (j = 0; j < d; ++j)
885 for (j = 0; j < d; ++j) {
886 px = new_x(px + dirx[vector[j]]);
887 py = new_y(py + diry[vector[j]]);
890 case 0: /* distance to sea */
891 if (own[px][py] == -1)
894 case 1: /* distance to land */
895 if (own[px][py] != -1)
898 case 2: /* distance to mountain */
899 if (elev[px][py] == INFINITY)
903 } while (next_vector(d));
908 #define ELEV elev[sectx[c][i]][secty[c][i]]
909 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
910 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
912 /* Decide where the mountains go
917 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
920 for (c = 0; c < ctot; ++c) {
922 ns = (c < nc) ? sc : isecs[c];
923 nm = (pm * ns) / 100;
925 /* Place the mountains */
927 for (i = 0; i < ns; ++i) {
928 dsea[i] = distance_to_sea();
929 weight[i] = (total += (dsea[i] * dsea[i]));
932 for (k = nm, mountain_search = 0;
933 k && mountain_search < MOUNTAIN_SEARCH_MAX;
936 for (i = 0; i < ns; ++i)
937 if (r < weight[i] && ELEV == -INFINITY &&
939 ((!(capx[c] == sectx[c][i] &&
940 capy[c] == secty[c][i])) &&
941 (!(new_x(capx[c] + 2) == sectx[c][i] &&
942 capy[c] == secty[c][i]))))) {
949 /* Elevate land that is not mountain and not capital */
951 for (i = 0; i < ns; ++i)
952 dmoun[i] = distance_to_mountain();
953 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
954 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
956 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
959 for (i = 0; i < ns; ++i) {
960 if (ELEV != INFINITY &&
961 (c >= nc || ((!(capx[c] == sectx[c][i] &&
962 capy[c] == secty[c][i])) &&
963 (!(new_x(capx[c] + 2) == sectx[c][i] &&
964 capy[c] == secty[c][i]))))) {
965 h = 3 * (5 - dmoun[i]) + dsea[i];
975 if (newk >= HILLMIN && newk < PLATMIN)
979 elev[sectx[c][where]][secty[c][where]] = newk;
980 dsea[where] = -INFINITY;
981 dmoun[where] = INFINITY;
984 /* Elevate the mountains and capitals */
986 for (i = 0; i < ns; ++i) {
987 if (ELEV == INFINITY) {
989 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
991 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
992 roll0((256 - HIGHMIN) / 2);
994 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
995 ((new_x(capx[c] + 2) == sectx[c][i] &&
996 capy[c] == secty[c][i]))))
1002 #define distance_to_land() distance_to_what(x, y, 1)
1009 for (y = 0; y < WORLD_Y; ++y) {
1010 for (x = y % 2; x < WORLD_X; x += 2) {
1011 if (elev[x][y] == -INFINITY)
1012 elev[x][y] = -roll(distance_to_land() * 20 + 27);
1017 /****************************************************************************
1019 ****************************************************************************/
1026 fert = LANDMIN - e + 40;
1027 else if (e < FERT_MAX)
1028 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1039 oil = (LANDMIN - e) * 2 + roll0(2);
1040 else if (e <= OIL_MAX)
1041 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1051 if (e >= IRON_MIN && e < HIGHMIN)
1052 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1062 if (e >= GOLD_MIN) {
1064 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1066 gold = 100 - 20 * HIGHMIN / e;
1077 if (e >= URAN_MIN && e < HIGHMIN)
1078 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1085 add_resources(struct sctstr *sct)
1087 sct->sct_fertil = set_fert(sct->sct_elev);
1088 sct->sct_oil = set_oil(sct->sct_elev);
1089 sct->sct_min = set_iron(sct->sct_elev);
1090 sct->sct_gmin = set_gold(sct->sct_elev);
1091 sct->sct_uran = set_uran(sct->sct_elev);
1094 /****************************************************************************
1095 DESIGNATE THE SECTORS
1096 ****************************************************************************/
1104 for (y = 0; y < WORLD_Y; y++) {
1105 for (x = y % 2; x < WORLD_X; x += 2) {
1106 sct = getsectp(x, y);
1108 if (total < LANDMIN) {
1109 sct->sct_type = SCT_WATER;
1110 } else if (total < HILLMIN)
1111 sct->sct_type = SCT_RURAL;
1112 else if (total < PLATMIN)
1113 sct->sct_type = SCT_MOUNT;
1114 else if (total < HIGHMIN)
1115 sct->sct_type = SCT_RURAL;
1117 sct->sct_type = SCT_MOUNT;
1118 sct->sct_elev = total;
1119 sct->sct_newtype = sct->sct_type;
1120 sct->sct_dterr = own[sct->sct_x][y] + 1;
1124 set_coastal_flags();
1127 /****************************************************************************
1128 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1129 ****************************************************************************/
1136 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1141 for (sx = -WORLD_X / 2 + y % 2; sx < WORLD_X / 2; sx += 2) {
1143 if (own[x][y] == -1)
1146 printf("%c ", map_symbol(x, y));
1154 map_symbol(int x, int y)
1158 for (c = 0; c < nc; ++c)
1159 if ((x == capx[c] && y == capy[c])
1160 || (x == new_x(capx[c] + 2) && y == capy[c]))
1161 return numletter[own[x][y] % 62];
1162 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1163 || elev[x][y] >= HIGHMIN)
1165 return own[x][y] >= nc ? '%' : '#';
1169 * Print a map to help visualize own[][].
1170 * This is for debugging.
1177 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1180 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1184 else if (own[x][y] == -1)
1187 putchar(numletter[own[x][y] % 62]);
1194 * Print a map to help visualize elev[][].
1195 * This is for debugging. It expects the terminal to understand
1196 * 24-bit color escape sequences \e[48;2;$red;$green;$blue;m.
1199 print_elev_map(void)
1201 int sx, sy, x, y, sat;
1203 for (sy = -WORLD_Y / 2; sy < WORLD_Y / 2; sy++) {
1206 for (sx = -WORLD_X / 2; sx < WORLD_X / 2; sx++) {
1210 else if (!elev[x][y])
1212 else if (elev[x][y] < 0) {
1213 sat = 256 + elev[x][y] * 2;
1214 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat, 255);
1215 } else if (elev[x][y] < HIGHMIN / 2) {
1216 sat = (HIGHMIN / 2 - elev[x][y]) * 4;
1217 printf("\033[48;2;%d;%d;%dm \033[0m", sat, 255, sat);
1218 } else if (elev[x][y] < HIGHMIN) {
1219 sat = 128 + (HIGHMIN - elev[x][y]) * 2;
1220 printf("\033[48;2;%d;%d;%dm \033[0m", sat, sat / 2, sat / 4);
1222 sat = 128 + (elev[x][y] - HIGHMIN) * 4 / 5;
1223 printf("\033[48;2;%d;%d;%dm^\033[0m", sat, sat, sat);
1230 /***************************************************************************
1231 WRITE A SCRIPT FOR PLACING CAPITALS
1232 ****************************************************************************/
1234 write_newcap_script(void)
1237 FILE *script = fopen(outfile, "w");
1240 fprintf(stderr, "fairland: error, unable to write to %s.\n",
1245 for (c = 0; c < nc; ++c) {
1246 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1247 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1249 fprintf(script, "add %d visitor visitor v\n", c + 1);
1255 qprint(const char *const fmt, ...)
1261 vfprintf(stdout, fmt, ap);
1267 set_coastal_flags(void)
1272 for (i = 0; i < nc; ++i) {
1273 for (j = 0; j < sc; j++) {
1274 sp = getsectp(sectx[i][j], secty[i][j]);
1275 sp->sct_coastal = sectc[i][j];
1278 for (i = nc; i < nc + ni; ++i) {
1279 for (j = 0; j < isecs[i]; j++) {
1280 sp = getsectp(sectx[i][j], secty[i][j]);
1281 sp->sct_coastal = sectc[i][j];