2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2011, 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:
36 /* define ORE 1 to add resources, define ORE 0 if you want to use another
37 program to add the resources */
41 /* If you don't specify these command line arguments, then these are the
43 #define DEFAULT_SPIKE 10
44 #define DEFAULT_MOUNTAIN 0
45 #define DEFAULT_CONTDIST 2
46 #define DEFAULT_ISLDIST 1
48 /* The following five numbers refer to elevation under which (in the case of
49 fertility or oil) or over which (in the case of iron, gold, and uranium)
50 sectors with that elevation will contain that resource. Elevation ranges
53 /* raise FERT_MAX for more fertility */
56 /* raise OIL_MAX for more oil */
59 /* lower IRON_MIN for more iron */
62 /* lower GOLD_MIN for more gold */
65 /* lower URAN_MIN for more uranium */
78 #include "prototypes.h"
83 /* do not change these 4 defines */
84 #define LANDMIN 1 /* plate altitude for normal land */
85 #define HILLMIN 34 /* plate altitude for hills */
86 #define PLATMIN 36 /* plate altitude for plateau */
87 #define HIGHMIN 98 /* plate altitude for mountains */
89 static void qprint(const char * const fmt, ...)
90 ATTRIBUTE((format (printf, 1, 2)));
92 #define DEFAULT_OUTFILE_NAME "newcap_script"
93 static const char *outfile = DEFAULT_OUTFILE_NAME;
94 /* mark the continents with a * so you can tell them
95 from the islands 1 = mark, 0 = don't mark. */
96 static int AIRPORT_MARKER = 0;
98 /* don't let the islands crash into each other.
99 1 = don't merge, 0 = merge. */
100 static int DISTINCT_ISLANDS = 1;
102 static char *program_name;
104 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
105 #define INFINITY 999 /* a number which means "BIG" */
107 /* these defines prevent infinite loops:
110 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
111 when growing continents and islands */
112 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
113 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
114 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
119 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
120 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
121 #define rnd(x) (random() % (x))
123 static int secs; /* number of sectors grown */
124 static int ctot; /* total number of continents and islands grown */
125 static int *isecs; /* array of how large each island is */
127 static int nc, sc, di, sp, pm, ni, is, id; /* the 8 args to this program */
128 static unsigned long rnd_seed; /* optional seed argument */
129 static int *capx, *capy; /* location of the nc capitals */
130 static int *mc, mcc; /* array and counter used for stability
131 check when perturbing */
132 static int spike; /* are we spiking? */
133 static int mind; /* the final distance between capitals that
135 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
136 static int diry[] = { 0, -1, -1, 0, 1, 1 };
138 static int **own; /* owner of the sector. -1 means water */
139 static int **elev; /* elevation of the sectors */
140 static int **sectx, **secty; /* the sectors for each continent */
141 static int **sectc; /* which sectors are on the coast? */
142 static int *vector; /* used for measuring distances */
143 static int *weight; /* used for placing mountains */
144 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
145 static int fl_status; /* is anything wrong? */
146 #define STATUS_NO_ROOM 1 /* there was no room to grow */
147 #define NUMTRIES 10 /* keep trying to grow this many times */
149 static const char *numletter =
150 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
152 static void help(char *);
153 static void usage(void);
154 static void parse_args(int argc, char *argv[]);
155 static int allocate_memory(void);
156 static void init(void);
157 static int drift(void);
158 static void grow_continents(void);
159 static void create_elevations(void);
160 static void write_sects(void);
161 static void output(void);
162 static int write_newcap_script(void);
163 static int stable(void);
164 static void elevate_land(void);
165 static void elevate_sea(void);
166 static int map_symbol(int x, int y);
167 static void set_coastal_flags(void);
169 static void print_vars(void);
170 static void fl_move(int);
171 static void next_coast(int c, int x, int y, int *xp, int *yp);
172 static void grow_islands(void);
174 /****************************************************************************
176 ****************************************************************************/
179 main(int argc, char *argv[])
182 char *config_file = NULL;
185 program_name = argv[0];
186 rnd_seed = time(NULL);
188 while ((opt = getopt(argc, argv, "ae:hioqR:s:v")) != EOF) {
194 config_file = optarg;
197 DISTINCT_ISLANDS = 0;
206 rnd_seed = strtoul(optarg, NULL, 10);
215 printf("%s\n\n%s", version, legal);
222 parse_args(argc - optind, argv + optind);
226 if (emp_config(config_file) < 0)
230 if (allocate_memory() == -1)
237 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
238 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
239 qprint("seed is %lu\n", rnd_seed);
240 qprint("placing capitals...\n");
242 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
243 qprint("growing continents...\n");
245 } while (fl_status && ++i < NUMTRIES);
247 fputs("ERROR: World not large enough to hold continents\n",
251 qprint("growing islands:");
253 qprint("\nelevating land...\n");
255 qprint("designating sectors...\n");
257 qprint("adding resources...\n");
258 write_newcap_script();
260 if (chdir(gamedir)) {
261 fprintf(stderr, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
264 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME, WORLD_SZ())) {
269 qprint("writing to sectors file...\n");
270 if (!ef_close(EF_SECTOR))
274 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
277 qprint("\t*** Resources have not been added ***\n");
286 puts("Creating a planet with:\n");
287 printf("%d continents\n", nc);
288 printf("continent size: %d\n", sc);
289 printf("number of islands: %d\n", ni);
290 printf("average size of islands: %d\n", is);
291 printf("spike: %d%%\n", sp);
292 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
293 pm, (pm * sc) / 100);
294 printf("minimum distance between continents: %d\n", di);
295 printf("minimum distance from islands to continents: %d\n", id);
296 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
304 for (i = 1; i * i < n * 10000; ++i) ;
305 return (i + 50) / 100;
308 /****************************************************************************
309 PARSE COMMAND LINE ARGUMENTS
310 ****************************************************************************/
313 help(char *complaint)
316 fprintf(stderr, "%s: %s\n", program_name, complaint);
317 fprintf(stderr, "Try -h for help.\n");
323 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
324 " -a airport marker for continents\n"
325 " -e CONFIG-FILE configuration file\n"
327 " -h display this help and exit\n"
328 " -i islands may merge\n"
329 " -o don't set resources\n"
331 " -R SEED seed for random number generator\n"
332 " -s SCRIPT name of script to create (default %s)\n"
333 " NC number of continents\n"
334 " SC continent size\n"
335 " NI number of islands (default NC)\n"
336 " IS average island size (default SC/2)\n"
337 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
338 " PM percentage of land that is mountain (default %d)\n"
339 " DI minimum distance between continents (default %d)\n"
340 " ID minimum distance from islands to continents (default %d)\n",
341 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
342 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
346 parse_args(int argc, char *argv[])
349 help("missing arguments");
353 help("too many arguments");
358 puts("fairland: error -- number of continents must be > 0");
364 puts("fairland: error -- size of continents must be > 0");
392 pm = DEFAULT_MOUNTAIN;
399 di = DEFAULT_CONTDIST;
402 puts("fairland: error -- distance between continents must be >= 0");
405 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
406 puts("fairland: error -- distance between continents too large");
413 id = DEFAULT_ISLDIST;
415 puts("fairland: error -- distance from islands to continents must be >= 0");
418 if (id > WORLD_X || id > WORLD_Y) {
419 puts("fairland: error -- distance from islands to continents too large");
422 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
423 puts("fairland: warning -- world might be too small to fit continents.");
424 puts("arguments should satisfy:");
425 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
429 /****************************************************************************
430 VARIABLE INITIALIZATION
431 ****************************************************************************/
434 allocate_memory(void)
438 capx = calloc(nc, sizeof(int));
439 capy = calloc(nc, sizeof(int));
440 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
441 mc = calloc(STABLE_CYCLE, sizeof(int));
442 own = calloc(WORLD_X, sizeof(int *));
443 elev = calloc(WORLD_X, sizeof(int *));
444 for (i = 0; i < WORLD_X; ++i) {
445 own[i] = calloc(WORLD_Y, sizeof(int));
446 elev[i] = calloc(WORLD_Y, sizeof(int));
448 sectx = calloc(nc + ni, sizeof(int *));
449 secty = calloc(nc + ni, sizeof(int *));
450 sectc = calloc(nc + ni, sizeof(int *));
451 isecs = calloc(nc + ni, sizeof(int));
452 weight = calloc(MAX(sc, is * 2), sizeof(int));
453 dsea = calloc(MAX(sc, is * 2), sizeof(int));
454 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
455 for (i = 0; i < nc; ++i) {
456 sectx[i] = calloc(sc, sizeof(int));
457 secty[i] = calloc(sc, sizeof(int));
458 sectc[i] = calloc(sc, sizeof(int));
460 for (i = nc; i < nc + ni; ++i) {
461 sectx[i] = calloc(is * 2, sizeof(int));
462 secty[i] = calloc(is * 2, sizeof(int));
463 sectc[i] = calloc(is * 2, sizeof(int));
472 int i, j, xx = 0, yy = 0;
477 for (i = 0; i < WORLD_X; ++i) {
478 for (j = 0; j < WORLD_Y; ++j) {
480 elev[i][j] = -INFINITY;
484 for (i = 0; i < nc; ++i) {
489 puts("fairland error: world not big enough for all the continents.\n");
497 for (i = 0; i < STABLE_CYCLE; ++i)
501 /****************************************************************************
502 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
503 ****************************************************************************/
505 /* How isolated is capital j?
508 iso(int j, int newx, int newy)
510 int i, md, d = WORLD_X + WORLD_Y;
512 for (i = 0; i < nc; ++i) {
515 md = mapdist(capx[i], capy[i], newx, newy);
523 /* Drift all the capitals
530 for (turns = 0; turns < DRIFT_MAX; ++turns) {
531 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
533 for (i = 0; i < nc; ++i)
539 /* Check to see if we have stabilized--can we stop drifting the capitals?
545 int i, isod, d = 0, stab = 1;
547 for (i = 0; i < nc; ++i) {
548 isod = iso(i, capx[i], capy[i]);
552 for (i = 0; i < STABLE_CYCLE; ++i)
556 mcc = (mcc + 1) % STABLE_CYCLE;
560 /* This routine does the actual drifting
566 int i, n, newx, newy;
568 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
569 newx = new_x(capx[j] + dirx[i]);
570 newy = new_y(capy[j] + diry[i]);
571 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
579 /****************************************************************************
581 ****************************************************************************/
583 /* Look for a coastal sector of continent c
591 for (i = 0; i < secs; ++i) {
593 for (j = 0; j < 6; ++j)
594 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
599 /* Used for measuring distances
611 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
614 return i > 1 || vector[0] > 0;
617 /* Test to see if we're allowed to grow there: the arguments di and id
620 try_to_grow(int c, int newx, int newy, int d)
624 for (i = 1; i <= d; ++i) {
625 for (j = 0; j < i; ++j)
630 for (j = 0; j < i; ++j) {
631 px = new_x(px + dirx[vector[j]]);
632 py = new_y(py + diry[vector[j]]);
634 if (own[px][py] != -1 &&
636 (DISTINCT_ISLANDS || own[px][py] < nc))
638 } while (next_vector(i));
640 sectx[c][secs] = newx;
641 secty[c][secs] = newy;
646 /* Move along the coast in a clockwise direction.
650 next_coast(int c, int x, int y, int *xp, int *yp)
652 int i, nx, ny, wat = 0;
660 for (i = 0; i < 12; ++i) {
661 nx = new_x(x + dirx[i % 6]);
662 ny = new_y(y + diry[i % 6]);
663 if (own[nx][ny] == -1)
665 if (wat && own[nx][ny] == c) {
673 /* Choose a sector to grow from
685 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
690 } while (i != starti);
697 /* Grow continent c by 1 sector
701 grow_one_sector(int c)
703 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
705 spike = rnd(100) < sp;
706 if ((try1 = new_try(c)) == -1)
708 x = sx = sectx[c][try1];
709 y = sy = secty[c][try1];
714 for (i = rnd(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
715 newx = new_x(x + dirx[i]);
716 newy = new_y(y + diry[i]);
717 if (own[newx][newy] == -1 &&
719 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
720 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
721 if (try_to_grow(c, newx, newy, c < nc ? di : id))
725 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
726 newx = new_x(x + dirx[i]);
727 newy = new_y(y + diry[i]);
728 if (own[newx][newy] == -1)
729 if (try_to_grow(c, newx, newy, c < nc ? di : id))
732 next_coast(c, x, y, &x, &y);
734 } while (!done && coast_search < COAST_SEARCH_MAX &&
735 (secs == 1 || x != sx || y != sy));
736 if (!done && c < nc) {
737 qprint("fairland: error -- continent %c had no room to grow!\n",
739 fl_status |= STATUS_NO_ROOM;
744 /* Grow all the continents
747 grow_continents(void)
751 for (c = 0; c < nc; ++c) {
752 sectx[c][0] = capx[c];
753 secty[c][0] = capy[c];
754 own[sectx[c][0]][secty[c][0]] = c;
755 sectx[c][1] = new_x(capx[c] + 2);
756 secty[c][1] = capy[c];
757 own[sectx[c][1]][secty[c][1]] = c;
760 for (secs = 2; secs < sc && !fl_status; ++secs) {
761 for (c = 0; c < nc; ++c) {
766 for (c = 0; c < nc; ++c)
770 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
774 /****************************************************************************
776 ****************************************************************************/
778 /* Choose a place to start growing an island from
781 place_island(int c, int *xp, int *yp)
784 int ssy = rnd(WORLD_Y);
785 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
787 if (ssx > WORLD_X - 2)
788 ssx = new_x(ssx + 2);
789 for (d = di + id; d >= id; --d) {
793 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
794 if (*xp >= WORLD_X) {
795 *yp = new_y(*yp + 1);
797 if (*xp == sx && *yp == sy)
800 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
807 /* Grow all the islands
815 for (c = nc; c < nc + ni; ++c) {
817 if (!place_island(c, &x, &y))
819 isiz = 1 + rnd(2 * is - 1);
823 } while (secs < isiz && grow_one_sector(c));
825 qprint(" %d(%d)", c - nc + 1, secs);
831 /****************************************************************************
833 ****************************************************************************/
835 create_elevations(void)
841 /* Generic function for finding the distance to the closest sea, land, or
845 distance_to_what(int x, int y, int flag)
849 for (d = 1; d < 5; ++d) {
850 for (j = 0; j < d; ++j)
855 for (j = 0; j < d; ++j) {
856 px = new_x(px + dirx[vector[j]]);
857 py = new_y(py + diry[vector[j]]);
860 case 0: /* distance to sea */
861 if (own[px][py] == -1)
864 case 1: /* distance to land */
865 if (own[px][py] != -1)
868 case 2: /* distance to mountain */
869 if (elev[px][py] == INFINITY)
873 } while (next_vector(d));
878 #define ELEV elev[sectx[c][i]][secty[c][i]]
879 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
880 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
882 /* Decide where the mountains go
887 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
890 for (c = 0; c < ctot; ++c) {
892 ns = (c < nc) ? sc : isecs[c];
893 nm = (pm * ns) / 100;
895 /* Place the mountains */
897 for (i = 0; i < ns; ++i) {
898 dsea[i] = distance_to_sea();
899 weight[i] = (total += (dsea[i] * dsea[i]));
902 for (k = nm, mountain_search = 0;
903 k && mountain_search < MOUNTAIN_SEARCH_MAX;
906 for (i = 0; i < ns; ++i)
907 if (r < weight[i] && ELEV == -INFINITY &&
909 ((!(capx[c] == sectx[c][i] &&
910 capy[c] == secty[c][i])) &&
911 (!(new_x(capx[c] + 2) == sectx[c][i] &&
912 capy[c] == secty[c][i]))))) {
919 /* Elevate land that is not mountain and not capital */
921 for (i = 0; i < ns; ++i)
922 dmoun[i] = distance_to_mountain();
923 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
924 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
926 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
929 for (i = 0; i < ns; ++i) {
930 if (ELEV != INFINITY &&
931 (c >= nc || ((!(capx[c] == sectx[c][i] &&
932 capy[c] == secty[c][i])) &&
933 (!(new_x(capx[c] + 2) == sectx[c][i] &&
934 capy[c] == secty[c][i]))))) {
935 h = 3 * (5 - dmoun[i]) + dsea[i];
945 if (newk >= HILLMIN && newk < PLATMIN)
949 elev[sectx[c][where]][secty[c][where]] = newk;
950 dsea[where] = -INFINITY;
951 dmoun[where] = INFINITY;
954 /* Elevate the mountains and capitals */
956 for (i = 0; i < ns; ++i) {
957 if (ELEV == INFINITY) {
959 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
961 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
962 rnd((256 - HIGHMIN) / 2);
963 } else if ((c < nc &&
964 ((capx[c] == sectx[c][i] && capy[c] == secty[c][i]))) ||
965 ((new_x(capx[c] + 2) == sectx[c][i] &&
966 capy[c] == secty[c][i])))
972 #define distance_to_land() distance_to_what(x, y, 1)
979 for (y = 0; y < WORLD_Y; ++y) {
980 for (x = y % 2; x < WORLD_X; x += 2) {
981 if (elev[x][y] == -INFINITY)
982 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
987 /****************************************************************************
989 ****************************************************************************/
996 fert = LANDMIN - e + 40;
997 else if (e < FERT_MAX)
998 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1009 oil = (LANDMIN - e) * 2 + rnd(2);
1010 else if (e <= OIL_MAX)
1011 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1021 if (e >= IRON_MIN && e < HIGHMIN)
1022 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1032 if (e >= GOLD_MIN) {
1034 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1036 gold = 100 - 20 * HIGHMIN / e;
1047 if (e >= URAN_MIN && e < HIGHMIN)
1048 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1055 add_resources(struct sctstr *sct)
1057 sct->sct_fertil = set_fert(sct->sct_elev);
1058 sct->sct_oil = set_oil(sct->sct_elev);
1059 sct->sct_min = set_iron(sct->sct_elev);
1060 sct->sct_gmin = set_gold(sct->sct_elev);
1061 sct->sct_uran = set_uran(sct->sct_elev);
1064 /****************************************************************************
1065 DESIGNATE THE SECTORS
1066 ****************************************************************************/
1074 for (y = 0; y < WORLD_Y; y++) {
1075 for (x = y % 2; x < WORLD_X; x += 2) {
1076 sct = getsectp(x, y);
1078 if (total < LANDMIN) {
1079 sct->sct_type = SCT_WATER;
1080 } else if (total < HILLMIN)
1081 sct->sct_type = SCT_RURAL;
1082 else if (total < PLATMIN)
1083 sct->sct_type = SCT_MOUNT;
1084 else if (total < HIGHMIN)
1085 sct->sct_type = SCT_RURAL;
1087 sct->sct_type = SCT_MOUNT;
1088 sct->sct_elev = total;
1089 sct->sct_newtype = sct->sct_type;
1095 for (c = 0; c < nc; ++c) {
1096 sct = getsectp(capx[c], capy[c]);
1097 sct->sct_type = SCT_AIRPT;
1098 sct->sct_newtype = SCT_AIRPT;
1100 set_coastal_flags();
1103 /****************************************************************************
1104 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1105 ****************************************************************************/
1111 for (i = 0; i < WORLD_Y; ++i) {
1115 for (j = i % 2; j < WORLD_X; j += 2) {
1116 if (own[j][i] == -1)
1119 printf("%c ", map_symbol(j, i));
1125 printf("\n\nEach continent is marked by a \"*\" on the map (to distinguish them from\n"
1126 "the islands). You can redesignate these airfields to wilderness sectors\n"
1127 "one at a time, each time you add a new country to the game.\n");
1131 map_symbol(int x, int y)
1135 for (c = 0; c < nc; ++c)
1136 if ((x == capx[c] && y == capy[c])
1137 || (x == new_x(capx[c] + 2) && y == capy[c]))
1139 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1140 || elev[x][y] >= HIGHMIN)
1142 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1145 /***************************************************************************
1146 WRITE A SCRIPT FOR PLACING CAPITALS
1147 ****************************************************************************/
1149 write_newcap_script(void)
1152 FILE *script = fopen(outfile, "w");
1155 printf("fairland: error, unable to write to %s.\n", outfile);
1159 for (c = 0; c < nc; ++c) {
1160 fprintf(script, "add %d %d %d n i\n", c + 1, c + 1, c + 1);
1162 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1163 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1165 fprintf(script, "add %d visitor visitor v i\n", c + 1);
1171 qprint(const char *const fmt, ...)
1177 vfprintf(stdout, fmt, ap);
1183 set_coastal_flags(void)
1188 qprint("setting coastal flags...\n");
1189 for (i = 0; i < nc; ++i) {
1190 for (j = 0; j < sc; j++) {
1191 sp = getsectp(sectx[i][j], secty[i][j]);
1192 sp->sct_coastal = sectc[i][j];
1195 for (i = nc; i < nc + ni; ++i) {
1196 for (j = 0; j < isecs[i]; j++) {
1197 sp = getsectp(sectx[i][j], secty[i][j]);
1198 sp->sct_coastal = sectc[i][j];