2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2013, 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-2012
37 /* define ORE 1 to add resources, define ORE 0 if you want to use another
38 program to add the resources */
42 /* If you don't specify these command line arguments, then these are the
44 #define DEFAULT_SPIKE 10
45 #define DEFAULT_MOUNTAIN 0
46 #define DEFAULT_CONTDIST 2
47 #define DEFAULT_ISLDIST 1
49 /* The following five numbers refer to elevation under which (in the case of
50 fertility or oil) or over which (in the case of iron, gold, and uranium)
51 sectors with that elevation will contain that resource. Elevation ranges
54 /* raise FERT_MAX for more fertility */
57 /* raise OIL_MAX for more oil */
60 /* lower IRON_MIN for more iron */
63 /* lower GOLD_MIN for more gold */
66 /* lower URAN_MIN for more uranium */
77 #include "prototypes.h"
82 /* do not change these 4 defines */
83 #define LANDMIN 1 /* plate altitude for normal land */
84 #define HILLMIN 34 /* plate altitude for hills */
85 #define PLATMIN 36 /* plate altitude for plateau */
86 #define HIGHMIN 98 /* plate altitude for mountains */
88 static void qprint(const char * const fmt, ...)
89 ATTRIBUTE((format (printf, 1, 2)));
91 #define DEFAULT_OUTFILE_NAME "newcap_script"
92 static const char *outfile = DEFAULT_OUTFILE_NAME;
93 /* mark the continents with a * so you can tell them
94 from the islands 1 = mark, 0 = don't mark. */
95 static int AIRPORT_MARKER = 0;
97 /* don't let the islands crash into each other.
98 1 = don't merge, 0 = merge. */
99 static int DISTINCT_ISLANDS = 1;
101 static char *program_name;
103 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
104 #define INFINITY 999 /* a number which means "BIG" */
106 /* these defines prevent infinite loops:
109 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
110 when growing continents and islands */
111 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
112 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
113 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
118 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
119 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
121 static int secs; /* number of sectors grown */
122 static int ctot; /* total number of continents and islands grown */
123 static int *isecs; /* array of how large each island is */
125 static int nc, sc, di, sp, pm, ni, is, id; /* the 8 args to this program */
126 static unsigned long rnd_seed; /* optional seed argument */
127 static int *capx, *capy; /* location of the nc capitals */
128 static int *mc, mcc; /* array and counter used for stability
129 check when perturbing */
130 static int spike; /* are we spiking? */
131 static int mind; /* the final distance between capitals that
133 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
134 static int diry[] = { 0, -1, -1, 0, 1, 1 };
136 static int **own; /* owner of the sector. -1 means water */
137 static int **elev; /* elevation of the sectors */
138 static int **sectx, **secty; /* the sectors for each continent */
139 static int **sectc; /* which sectors are on the coast? */
140 static int *vector; /* used for measuring distances */
141 static int *weight; /* used for placing mountains */
142 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
143 static int fl_status; /* is anything wrong? */
144 #define STATUS_NO_ROOM 1 /* there was no room to grow */
145 #define NUMTRIES 10 /* keep trying to grow this many times */
147 static const char *numletter =
148 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
150 static void help(char *);
151 static void usage(void);
152 static void parse_args(int argc, char *argv[]);
153 static void allocate_memory(void);
154 static void init(void);
155 static int drift(void);
156 static void grow_continents(void);
157 static void create_elevations(void);
158 static void write_sects(void);
159 static void output(void);
160 static int write_newcap_script(void);
161 static int stable(void);
162 static void elevate_land(void);
163 static void elevate_sea(void);
164 static int map_symbol(int x, int y);
165 static void set_coastal_flags(void);
167 static void print_vars(void);
168 static void fl_move(int);
169 static void next_coast(int c, int x, int y, int *xp, int *yp);
170 static void grow_islands(void);
172 /****************************************************************************
174 ****************************************************************************/
177 main(int argc, char *argv[])
180 char *config_file = NULL;
183 program_name = argv[0];
184 rnd_seed = time(NULL);
186 while ((opt = getopt(argc, argv, "ae:hioqR:s:v")) != EOF) {
192 config_file = optarg;
195 DISTINCT_ISLANDS = 0;
204 rnd_seed = strtoul(optarg, NULL, 10);
213 printf("%s\n\n%s", version, legal);
220 parse_args(argc - optind, argv + optind);
224 if (emp_config(config_file) < 0)
234 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
235 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
236 qprint("seed is %lu\n", rnd_seed);
237 qprint("placing capitals...\n");
239 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
240 qprint("growing continents...\n");
242 } while (fl_status && ++i < NUMTRIES);
244 fputs("ERROR: World not large enough to hold continents\n",
248 qprint("growing islands:");
250 qprint("\nelevating land...\n");
252 qprint("designating sectors...\n");
254 qprint("adding resources...\n");
255 write_newcap_script();
257 if (chdir(gamedir)) {
258 fprintf(stderr, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
261 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
264 qprint("writing to sectors file...\n");
265 if (!ef_close(EF_SECTOR))
269 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
272 qprint("\t*** Resources have not been added ***\n");
281 puts("Creating a planet with:\n");
282 printf("%d continents\n", nc);
283 printf("continent size: %d\n", sc);
284 printf("number of islands: %d\n", ni);
285 printf("average size of islands: %d\n", is);
286 printf("spike: %d%%\n", sp);
287 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
288 pm, (pm * sc) / 100);
289 printf("minimum distance between continents: %d\n", di);
290 printf("minimum distance from islands to continents: %d\n", id);
291 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
299 for (i = 1; i * i < n * 10000; ++i) ;
300 return (i + 50) / 100;
303 /****************************************************************************
304 PARSE COMMAND LINE ARGUMENTS
305 ****************************************************************************/
308 help(char *complaint)
311 fprintf(stderr, "%s: %s\n", program_name, complaint);
312 fprintf(stderr, "Try -h for help.\n");
318 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
319 " -a airport marker for continents\n"
320 " -e CONFIG-FILE configuration file\n"
322 " -h display this help and exit\n"
323 " -i islands may merge\n"
324 " -o don't set resources\n"
326 " -R SEED seed for random number generator\n"
327 " -s SCRIPT name of script to create (default %s)\n"
328 " NC number of continents\n"
329 " SC continent size\n"
330 " NI number of islands (default NC)\n"
331 " IS average island size (default SC/2)\n"
332 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
333 " PM percentage of land that is mountain (default %d)\n"
334 " DI minimum distance between continents (default %d)\n"
335 " ID minimum distance from islands to continents (default %d)\n",
336 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
337 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
341 parse_args(int argc, char *argv[])
344 help("missing arguments");
348 help("too many arguments");
353 puts("fairland: error -- number of continents must be > 0");
359 puts("fairland: error -- size of continents must be > 0");
387 pm = DEFAULT_MOUNTAIN;
394 di = DEFAULT_CONTDIST;
397 puts("fairland: error -- distance between continents must be >= 0");
400 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
401 puts("fairland: error -- distance between continents too large");
408 id = DEFAULT_ISLDIST;
410 puts("fairland: error -- distance from islands to continents must be >= 0");
413 if (id > WORLD_X || id > WORLD_Y) {
414 puts("fairland: error -- distance from islands to continents too large");
417 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
418 puts("fairland: warning -- world might be too small to fit continents.");
419 puts("arguments should satisfy:");
420 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
424 /****************************************************************************
425 VARIABLE INITIALIZATION
426 ****************************************************************************/
429 allocate_memory(void)
433 capx = calloc(nc, sizeof(int));
434 capy = calloc(nc, sizeof(int));
435 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
436 mc = calloc(STABLE_CYCLE, sizeof(int));
437 own = calloc(WORLD_X, sizeof(int *));
438 elev = calloc(WORLD_X, sizeof(int *));
439 for (i = 0; i < WORLD_X; ++i) {
440 own[i] = calloc(WORLD_Y, sizeof(int));
441 elev[i] = calloc(WORLD_Y, sizeof(int));
443 sectx = calloc(nc + ni, sizeof(int *));
444 secty = calloc(nc + ni, sizeof(int *));
445 sectc = calloc(nc + ni, sizeof(int *));
446 isecs = calloc(nc + ni, sizeof(int));
447 weight = calloc(MAX(sc, is * 2), sizeof(int));
448 dsea = calloc(MAX(sc, is * 2), sizeof(int));
449 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
450 for (i = 0; i < nc; ++i) {
451 sectx[i] = calloc(sc, sizeof(int));
452 secty[i] = calloc(sc, sizeof(int));
453 sectc[i] = calloc(sc, sizeof(int));
455 for (i = nc; i < nc + ni; ++i) {
456 sectx[i] = calloc(is * 2, sizeof(int));
457 secty[i] = calloc(is * 2, sizeof(int));
458 sectc[i] = calloc(is * 2, sizeof(int));
466 int i, j, xx = 0, yy = 0;
471 for (i = 0; i < WORLD_X; ++i) {
472 for (j = 0; j < WORLD_Y; ++j) {
474 elev[i][j] = -INFINITY;
478 for (i = 0; i < nc; ++i) {
483 puts("fairland error: world not big enough for all the continents.\n");
491 for (i = 0; i < STABLE_CYCLE; ++i)
495 /****************************************************************************
496 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
497 ****************************************************************************/
499 /* How isolated is capital j?
502 iso(int j, int newx, int newy)
504 int i, md, d = WORLD_X + WORLD_Y;
506 for (i = 0; i < nc; ++i) {
509 md = mapdist(capx[i], capy[i], newx, newy);
517 /* Drift all the capitals
524 for (turns = 0; turns < DRIFT_MAX; ++turns) {
525 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
527 for (i = 0; i < nc; ++i)
533 /* Check to see if we have stabilized--can we stop drifting the capitals?
539 int i, isod, d = 0, stab = 1;
541 for (i = 0; i < nc; ++i) {
542 isod = iso(i, capx[i], capy[i]);
546 for (i = 0; i < STABLE_CYCLE; ++i)
550 mcc = (mcc + 1) % STABLE_CYCLE;
554 /* This routine does the actual drifting
560 int i, n, newx, newy;
562 for (i = roll0(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
563 newx = new_x(capx[j] + dirx[i]);
564 newy = new_y(capy[j] + diry[i]);
565 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
573 /****************************************************************************
575 ****************************************************************************/
577 /* Look for a coastal sector of continent c
585 for (i = 0; i < secs; ++i) {
587 for (j = 0; j < 6; ++j)
588 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
593 /* Used for measuring distances
605 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
608 return i > 1 || vector[0] > 0;
611 /* Test to see if we're allowed to grow there: the arguments di and id
614 try_to_grow(int c, int newx, int newy, int d)
618 for (i = 1; i <= d; ++i) {
619 for (j = 0; j < i; ++j)
624 for (j = 0; j < i; ++j) {
625 px = new_x(px + dirx[vector[j]]);
626 py = new_y(py + diry[vector[j]]);
628 if (own[px][py] != -1 &&
630 (DISTINCT_ISLANDS || own[px][py] < nc))
632 } while (next_vector(i));
634 sectx[c][secs] = newx;
635 secty[c][secs] = newy;
640 /* Move along the coast in a clockwise direction.
644 next_coast(int c, int x, int y, int *xp, int *yp)
646 int i, nx, ny, wat = 0;
654 for (i = 0; i < 12; ++i) {
655 nx = new_x(x + dirx[i % 6]);
656 ny = new_y(y + diry[i % 6]);
657 if (own[nx][ny] == -1)
659 if (wat && own[nx][ny] == c) {
667 /* Choose a sector to grow from
679 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : roll0(secs);
684 } while (i != starti);
691 /* Grow continent c by 1 sector
695 grow_one_sector(int c)
697 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
699 spike = roll0(100) < sp;
700 if ((try1 = new_try(c)) == -1)
702 x = sx = sectx[c][try1];
703 y = sy = secty[c][try1];
708 for (i = roll0(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
709 newx = new_x(x + dirx[i]);
710 newy = new_y(y + diry[i]);
711 if (own[newx][newy] == -1 &&
713 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
714 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
715 if (try_to_grow(c, newx, newy, c < nc ? di : id))
719 for (i = roll0(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
720 newx = new_x(x + dirx[i]);
721 newy = new_y(y + diry[i]);
722 if (own[newx][newy] == -1)
723 if (try_to_grow(c, newx, newy, c < nc ? di : id))
726 next_coast(c, x, y, &x, &y);
728 } while (!done && coast_search < COAST_SEARCH_MAX &&
729 (secs == 1 || x != sx || y != sy));
730 if (!done && c < nc) {
731 qprint("fairland: error -- continent %c had no room to grow!\n",
733 fl_status |= STATUS_NO_ROOM;
738 /* Grow all the continents
741 grow_continents(void)
745 for (c = 0; c < nc; ++c) {
746 sectx[c][0] = capx[c];
747 secty[c][0] = capy[c];
748 own[sectx[c][0]][secty[c][0]] = c;
749 sectx[c][1] = new_x(capx[c] + 2);
750 secty[c][1] = capy[c];
751 own[sectx[c][1]][secty[c][1]] = c;
754 for (secs = 2; secs < sc && !fl_status; ++secs) {
755 for (c = 0; c < nc; ++c) {
760 for (c = 0; c < nc; ++c)
764 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
768 /****************************************************************************
770 ****************************************************************************/
772 /* Choose a place to start growing an island from
775 place_island(int c, int *xp, int *yp)
778 int ssy = roll0(WORLD_Y);
779 int ssx = new_x(roll0(WORLD_X / 2) * 2 + ssy % 2);
781 if (ssx > WORLD_X - 2)
782 ssx = new_x(ssx + 2);
783 for (d = di + id; d >= id; --d) {
787 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
788 if (*xp >= WORLD_X) {
789 *yp = new_y(*yp + 1);
791 if (*xp == sx && *yp == sy)
794 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
801 /* Grow all the islands
809 for (c = nc; c < nc + ni; ++c) {
811 if (!place_island(c, &x, &y))
813 isiz = roll(2 * is - 1);
817 } while (secs < isiz && grow_one_sector(c));
819 qprint(" %d(%d)", c - nc + 1, secs);
825 /****************************************************************************
827 ****************************************************************************/
829 create_elevations(void)
835 /* Generic function for finding the distance to the closest sea, land, or
839 distance_to_what(int x, int y, int flag)
843 for (d = 1; d < 5; ++d) {
844 for (j = 0; j < d; ++j)
849 for (j = 0; j < d; ++j) {
850 px = new_x(px + dirx[vector[j]]);
851 py = new_y(py + diry[vector[j]]);
854 case 0: /* distance to sea */
855 if (own[px][py] == -1)
858 case 1: /* distance to land */
859 if (own[px][py] != -1)
862 case 2: /* distance to mountain */
863 if (elev[px][py] == INFINITY)
867 } while (next_vector(d));
872 #define ELEV elev[sectx[c][i]][secty[c][i]]
873 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
874 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
876 /* Decide where the mountains go
881 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
884 for (c = 0; c < ctot; ++c) {
886 ns = (c < nc) ? sc : isecs[c];
887 nm = (pm * ns) / 100;
889 /* Place the mountains */
891 for (i = 0; i < ns; ++i) {
892 dsea[i] = distance_to_sea();
893 weight[i] = (total += (dsea[i] * dsea[i]));
896 for (k = nm, mountain_search = 0;
897 k && mountain_search < MOUNTAIN_SEARCH_MAX;
900 for (i = 0; i < ns; ++i)
901 if (r < weight[i] && ELEV == -INFINITY &&
903 ((!(capx[c] == sectx[c][i] &&
904 capy[c] == secty[c][i])) &&
905 (!(new_x(capx[c] + 2) == sectx[c][i] &&
906 capy[c] == secty[c][i]))))) {
913 /* Elevate land that is not mountain and not capital */
915 for (i = 0; i < ns; ++i)
916 dmoun[i] = distance_to_mountain();
917 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
918 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
920 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
923 for (i = 0; i < ns; ++i) {
924 if (ELEV != INFINITY &&
925 (c >= nc || ((!(capx[c] == sectx[c][i] &&
926 capy[c] == secty[c][i])) &&
927 (!(new_x(capx[c] + 2) == sectx[c][i] &&
928 capy[c] == secty[c][i]))))) {
929 h = 3 * (5 - dmoun[i]) + dsea[i];
939 if (newk >= HILLMIN && newk < PLATMIN)
943 elev[sectx[c][where]][secty[c][where]] = newk;
944 dsea[where] = -INFINITY;
945 dmoun[where] = INFINITY;
948 /* Elevate the mountains and capitals */
950 for (i = 0; i < ns; ++i) {
951 if (ELEV == INFINITY) {
953 ELEV = HILLMIN + roll0(PLATMIN - HILLMIN);
955 ELEV = HIGHMIN + roll0((256 - HIGHMIN) / 2) +
956 roll0((256 - HIGHMIN) / 2);
958 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
959 ((new_x(capx[c] + 2) == sectx[c][i] &&
960 capy[c] == secty[c][i]))))
966 #define distance_to_land() distance_to_what(x, y, 1)
973 for (y = 0; y < WORLD_Y; ++y) {
974 for (x = y % 2; x < WORLD_X; x += 2) {
975 if (elev[x][y] == -INFINITY)
976 elev[x][y] = -roll(distance_to_land() * 20 + 27);
981 /****************************************************************************
983 ****************************************************************************/
990 fert = LANDMIN - e + 40;
991 else if (e < FERT_MAX)
992 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1003 oil = (LANDMIN - e) * 2 + roll0(2);
1004 else if (e <= OIL_MAX)
1005 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1015 if (e >= IRON_MIN && e < HIGHMIN)
1016 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1026 if (e >= GOLD_MIN) {
1028 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1030 gold = 100 - 20 * HIGHMIN / e;
1041 if (e >= URAN_MIN && e < HIGHMIN)
1042 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1049 add_resources(struct sctstr *sct)
1051 sct->sct_fertil = set_fert(sct->sct_elev);
1052 sct->sct_oil = set_oil(sct->sct_elev);
1053 sct->sct_min = set_iron(sct->sct_elev);
1054 sct->sct_gmin = set_gold(sct->sct_elev);
1055 sct->sct_uran = set_uran(sct->sct_elev);
1058 /****************************************************************************
1059 DESIGNATE THE SECTORS
1060 ****************************************************************************/
1068 for (y = 0; y < WORLD_Y; y++) {
1069 for (x = y % 2; x < WORLD_X; x += 2) {
1070 sct = getsectp(x, y);
1072 if (total < LANDMIN) {
1073 sct->sct_type = SCT_WATER;
1074 } else if (total < HILLMIN)
1075 sct->sct_type = SCT_RURAL;
1076 else if (total < PLATMIN)
1077 sct->sct_type = SCT_MOUNT;
1078 else if (total < HIGHMIN)
1079 sct->sct_type = SCT_RURAL;
1081 sct->sct_type = SCT_MOUNT;
1082 sct->sct_elev = total;
1083 sct->sct_newtype = sct->sct_type;
1089 for (c = 0; c < nc; ++c) {
1090 sct = getsectp(capx[c], capy[c]);
1091 sct->sct_type = SCT_AIRPT;
1092 sct->sct_newtype = SCT_AIRPT;
1094 set_coastal_flags();
1097 /****************************************************************************
1098 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1099 ****************************************************************************/
1105 for (i = 0; i < WORLD_Y; ++i) {
1109 for (j = i % 2; j < WORLD_X; j += 2) {
1110 if (own[j][i] == -1)
1113 printf("%c ", map_symbol(j, i));
1119 printf("\n\nEach continent is marked by a \"*\" on the map (to distinguish them from\n"
1120 "the islands). You can redesignate these airfields to wilderness sectors\n"
1121 "one at a time, each time you add a new country to the game.\n");
1125 map_symbol(int x, int y)
1129 for (c = 0; c < nc; ++c)
1130 if ((x == capx[c] && y == capy[c])
1131 || (x == new_x(capx[c] + 2) && y == capy[c]))
1133 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1134 || elev[x][y] >= HIGHMIN)
1136 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1139 /***************************************************************************
1140 WRITE A SCRIPT FOR PLACING CAPITALS
1141 ****************************************************************************/
1143 write_newcap_script(void)
1146 FILE *script = fopen(outfile, "w");
1149 printf("fairland: error, unable to write to %s.\n", outfile);
1153 for (c = 0; c < nc; ++c) {
1154 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1156 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1157 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1159 fprintf(script, "add %d visitor visitor v\n", c + 1);
1165 qprint(const char *const fmt, ...)
1171 vfprintf(stdout, fmt, ap);
1177 set_coastal_flags(void)
1182 qprint("setting coastal flags...\n");
1183 for (i = 0; i < nc; ++i) {
1184 for (j = 0; j < sc; j++) {
1185 sp = getsectp(sectx[i][j], secty[i][j]);
1186 sp->sct_coastal = sectc[i][j];
1189 for (i = nc; i < nc + ni; ++i) {
1190 for (j = 0; j < isecs[i]; j++) {
1191 sp = getsectp(sectx[i][j], secty[i][j]);
1192 sp->sct_coastal = sectc[i][j];