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 */
75 #include "prototypes.h"
80 /* do not change these 4 defines */
81 #define LANDMIN 1 /* plate altitude for normal land */
82 #define HILLMIN 34 /* plate altitude for hills */
83 #define PLATMIN 36 /* plate altitude for plateau */
84 #define HIGHMIN 98 /* plate altitude for mountains */
86 static void qprint(const char * const fmt, ...)
87 ATTRIBUTE((format (printf, 1, 2)));
89 #define DEFAULT_OUTFILE_NAME "newcap_script"
90 static const char *outfile = DEFAULT_OUTFILE_NAME;
91 /* mark the continents with a * so you can tell them
92 from the islands 1 = mark, 0 = don't mark. */
93 static int AIRPORT_MARKER = 0;
95 /* don't let the islands crash into each other.
96 1 = don't merge, 0 = merge. */
97 static int DISTINCT_ISLANDS = 1;
99 static char *program_name;
101 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
102 #define INFINITY 999 /* a number which means "BIG" */
104 /* these defines prevent infinite loops:
107 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
108 when growing continents and islands */
109 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
110 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
111 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
116 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
117 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
118 #define rnd(x) (random() % (x))
120 static int secs; /* number of sectors grown */
121 static int ctot; /* total number of continents and islands grown */
122 static int *isecs; /* array of how large each island is */
124 static int nc, sc, di, sp, pm, ni, is, id; /* the 8 args to this program */
125 static unsigned long rnd_seed; /* optional seed argument */
126 static int *capx, *capy; /* location of the nc capitals */
127 static int *mc, mcc; /* array and counter used for stability
128 check when perturbing */
129 static int spike; /* are we spiking? */
130 static int mind; /* the final distance between capitals that
132 static int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
133 static int diry[] = { 0, -1, -1, 0, 1, 1 };
135 static int **own; /* owner of the sector. -1 means water */
136 static int **elev; /* elevation of the sectors */
137 static int **sectx, **secty; /* the sectors for each continent */
138 static int **sectc; /* which sectors are on the coast? */
139 static int *vector; /* used for measuring distances */
140 static int *weight; /* used for placing mountains */
141 static int *dsea, *dmoun; /* the dist to the ocean and mountain */
142 static int fl_status; /* is anything wrong? */
143 #define STATUS_NO_ROOM 1 /* there was no room to grow */
144 #define NUMTRIES 10 /* keep trying to grow this many times */
146 static const char *numletter =
147 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
149 static void help(char *);
150 static void usage(void);
151 static void parse_args(int argc, char *argv[]);
152 static void allocate_memory(void);
153 static void init(void);
154 static int drift(void);
155 static void grow_continents(void);
156 static void create_elevations(void);
157 static void write_sects(void);
158 static void output(void);
159 static int write_newcap_script(void);
160 static int stable(void);
161 static void elevate_land(void);
162 static void elevate_sea(void);
163 static int map_symbol(int x, int y);
164 static void set_coastal_flags(void);
166 static void print_vars(void);
167 static void fl_move(int);
168 static void next_coast(int c, int x, int y, int *xp, int *yp);
169 static void grow_islands(void);
171 /****************************************************************************
173 ****************************************************************************/
176 main(int argc, char *argv[])
179 char *config_file = NULL;
182 program_name = argv[0];
183 rnd_seed = time(NULL);
185 while ((opt = getopt(argc, argv, "ae:hioqR:s:v")) != EOF) {
191 config_file = optarg;
194 DISTINCT_ISLANDS = 0;
203 rnd_seed = strtoul(optarg, NULL, 10);
212 printf("%s\n\n%s", version, legal);
219 parse_args(argc - optind, argv + optind);
223 if (emp_config(config_file) < 0)
233 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
234 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
235 qprint("seed is %lu\n", rnd_seed);
236 qprint("placing capitals...\n");
238 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
239 qprint("growing continents...\n");
241 } while (fl_status && ++i < NUMTRIES);
243 fputs("ERROR: World not large enough to hold continents\n",
247 qprint("growing islands:");
249 qprint("\nelevating land...\n");
251 qprint("designating sectors...\n");
253 qprint("adding resources...\n");
254 write_newcap_script();
256 if (chdir(gamedir)) {
257 fprintf(stderr, "Can't chdir to %s (%s)\n", gamedir, strerror(errno));
260 if (!ef_open(EF_SECTOR, EFF_MEM | EFF_NOTIME))
263 qprint("writing to sectors file...\n");
264 if (!ef_close(EF_SECTOR))
268 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
271 qprint("\t*** Resources have not been added ***\n");
280 puts("Creating a planet with:\n");
281 printf("%d continents\n", nc);
282 printf("continent size: %d\n", sc);
283 printf("number of islands: %d\n", ni);
284 printf("average size of islands: %d\n", is);
285 printf("spike: %d%%\n", sp);
286 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
287 pm, (pm * sc) / 100);
288 printf("minimum distance between continents: %d\n", di);
289 printf("minimum distance from islands to continents: %d\n", id);
290 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
298 for (i = 1; i * i < n * 10000; ++i) ;
299 return (i + 50) / 100;
302 /****************************************************************************
303 PARSE COMMAND LINE ARGUMENTS
304 ****************************************************************************/
307 help(char *complaint)
310 fprintf(stderr, "%s: %s\n", program_name, complaint);
311 fprintf(stderr, "Try -h for help.\n");
317 printf("Usage: %s [OPTION]... NC SC [NI] [IS] [SP] [PM] [DI] [ID]\n"
318 " -a airport marker for continents\n"
319 " -e CONFIG-FILE configuration file\n"
321 " -h display this help and exit\n"
322 " -i islands may merge\n"
323 " -o don't set resources\n"
325 " -R SEED seed for random number generator\n"
326 " -s SCRIPT name of script to create (default %s)\n"
327 " NC number of continents\n"
328 " SC continent size\n"
329 " NI number of islands (default NC)\n"
330 " IS average island size (default SC/2)\n"
331 " SP spike percentage: 0 = round, 100 = snake (default %d)\n"
332 " PM percentage of land that is mountain (default %d)\n"
333 " DI minimum distance between continents (default %d)\n"
334 " ID minimum distance from islands to continents (default %d)\n",
335 program_name, dflt_econfig, DEFAULT_OUTFILE_NAME,
336 DEFAULT_SPIKE, DEFAULT_MOUNTAIN, DEFAULT_CONTDIST, DEFAULT_ISLDIST);
340 parse_args(int argc, char *argv[])
343 help("missing arguments");
347 help("too many arguments");
352 puts("fairland: error -- number of continents must be > 0");
358 puts("fairland: error -- size of continents must be > 0");
386 pm = DEFAULT_MOUNTAIN;
393 di = DEFAULT_CONTDIST;
396 puts("fairland: error -- distance between continents must be >= 0");
399 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
400 puts("fairland: error -- distance between continents too large");
407 id = DEFAULT_ISLDIST;
409 puts("fairland: error -- distance from islands to continents must be >= 0");
412 if (id > WORLD_X || id > WORLD_Y) {
413 puts("fairland: error -- distance from islands to continents too large");
416 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
417 puts("fairland: warning -- world might be too small to fit continents.");
418 puts("arguments should satisfy:");
419 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
423 /****************************************************************************
424 VARIABLE INITIALIZATION
425 ****************************************************************************/
428 allocate_memory(void)
432 capx = calloc(nc, sizeof(int));
433 capy = calloc(nc, sizeof(int));
434 vector = calloc(WORLD_X + WORLD_Y, sizeof(int));
435 mc = calloc(STABLE_CYCLE, sizeof(int));
436 own = calloc(WORLD_X, sizeof(int *));
437 elev = calloc(WORLD_X, sizeof(int *));
438 for (i = 0; i < WORLD_X; ++i) {
439 own[i] = calloc(WORLD_Y, sizeof(int));
440 elev[i] = calloc(WORLD_Y, sizeof(int));
442 sectx = calloc(nc + ni, sizeof(int *));
443 secty = calloc(nc + ni, sizeof(int *));
444 sectc = calloc(nc + ni, sizeof(int *));
445 isecs = calloc(nc + ni, sizeof(int));
446 weight = calloc(MAX(sc, is * 2), sizeof(int));
447 dsea = calloc(MAX(sc, is * 2), sizeof(int));
448 dmoun = calloc(MAX(sc, is * 2), sizeof(int));
449 for (i = 0; i < nc; ++i) {
450 sectx[i] = calloc(sc, sizeof(int));
451 secty[i] = calloc(sc, sizeof(int));
452 sectc[i] = calloc(sc, sizeof(int));
454 for (i = nc; i < nc + ni; ++i) {
455 sectx[i] = calloc(is * 2, sizeof(int));
456 secty[i] = calloc(is * 2, sizeof(int));
457 sectc[i] = calloc(is * 2, sizeof(int));
465 int i, j, xx = 0, yy = 0;
470 for (i = 0; i < WORLD_X; ++i) {
471 for (j = 0; j < WORLD_Y; ++j) {
473 elev[i][j] = -INFINITY;
477 for (i = 0; i < nc; ++i) {
482 puts("fairland error: world not big enough for all the continents.\n");
490 for (i = 0; i < STABLE_CYCLE; ++i)
494 /****************************************************************************
495 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
496 ****************************************************************************/
498 /* How isolated is capital j?
501 iso(int j, int newx, int newy)
503 int i, md, d = WORLD_X + WORLD_Y;
505 for (i = 0; i < nc; ++i) {
508 md = mapdist(capx[i], capy[i], newx, newy);
516 /* Drift all the capitals
523 for (turns = 0; turns < DRIFT_MAX; ++turns) {
524 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
526 for (i = 0; i < nc; ++i)
532 /* Check to see if we have stabilized--can we stop drifting the capitals?
538 int i, isod, d = 0, stab = 1;
540 for (i = 0; i < nc; ++i) {
541 isod = iso(i, capx[i], capy[i]);
545 for (i = 0; i < STABLE_CYCLE; ++i)
549 mcc = (mcc + 1) % STABLE_CYCLE;
553 /* This routine does the actual drifting
559 int i, n, newx, newy;
561 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
562 newx = new_x(capx[j] + dirx[i]);
563 newy = new_y(capy[j] + diry[i]);
564 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
572 /****************************************************************************
574 ****************************************************************************/
576 /* Look for a coastal sector of continent c
584 for (i = 0; i < secs; ++i) {
586 for (j = 0; j < 6; ++j)
587 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
592 /* Used for measuring distances
604 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
607 return i > 1 || vector[0] > 0;
610 /* Test to see if we're allowed to grow there: the arguments di and id
613 try_to_grow(int c, int newx, int newy, int d)
617 for (i = 1; i <= d; ++i) {
618 for (j = 0; j < i; ++j)
623 for (j = 0; j < i; ++j) {
624 px = new_x(px + dirx[vector[j]]);
625 py = new_y(py + diry[vector[j]]);
627 if (own[px][py] != -1 &&
629 (DISTINCT_ISLANDS || own[px][py] < nc))
631 } while (next_vector(i));
633 sectx[c][secs] = newx;
634 secty[c][secs] = newy;
639 /* Move along the coast in a clockwise direction.
643 next_coast(int c, int x, int y, int *xp, int *yp)
645 int i, nx, ny, wat = 0;
653 for (i = 0; i < 12; ++i) {
654 nx = new_x(x + dirx[i % 6]);
655 ny = new_y(y + diry[i % 6]);
656 if (own[nx][ny] == -1)
658 if (wat && own[nx][ny] == c) {
666 /* Choose a sector to grow from
678 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
683 } while (i != starti);
690 /* Grow continent c by 1 sector
694 grow_one_sector(int c)
696 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
698 spike = rnd(100) < sp;
699 if ((try1 = new_try(c)) == -1)
701 x = sx = sectx[c][try1];
702 y = sy = secty[c][try1];
707 for (i = rnd(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
708 newx = new_x(x + dirx[i]);
709 newy = new_y(y + diry[i]);
710 if (own[newx][newy] == -1 &&
712 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
713 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
714 if (try_to_grow(c, newx, newy, c < nc ? di : id))
718 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
719 newx = new_x(x + dirx[i]);
720 newy = new_y(y + diry[i]);
721 if (own[newx][newy] == -1)
722 if (try_to_grow(c, newx, newy, c < nc ? di : id))
725 next_coast(c, x, y, &x, &y);
727 } while (!done && coast_search < COAST_SEARCH_MAX &&
728 (secs == 1 || x != sx || y != sy));
729 if (!done && c < nc) {
730 qprint("fairland: error -- continent %c had no room to grow!\n",
732 fl_status |= STATUS_NO_ROOM;
737 /* Grow all the continents
740 grow_continents(void)
744 for (c = 0; c < nc; ++c) {
745 sectx[c][0] = capx[c];
746 secty[c][0] = capy[c];
747 own[sectx[c][0]][secty[c][0]] = c;
748 sectx[c][1] = new_x(capx[c] + 2);
749 secty[c][1] = capy[c];
750 own[sectx[c][1]][secty[c][1]] = c;
753 for (secs = 2; secs < sc && !fl_status; ++secs) {
754 for (c = 0; c < nc; ++c) {
759 for (c = 0; c < nc; ++c)
763 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
767 /****************************************************************************
769 ****************************************************************************/
771 /* Choose a place to start growing an island from
774 place_island(int c, int *xp, int *yp)
777 int ssy = rnd(WORLD_Y);
778 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
780 if (ssx > WORLD_X - 2)
781 ssx = new_x(ssx + 2);
782 for (d = di + id; d >= id; --d) {
786 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
787 if (*xp >= WORLD_X) {
788 *yp = new_y(*yp + 1);
790 if (*xp == sx && *yp == sy)
793 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
800 /* Grow all the islands
808 for (c = nc; c < nc + ni; ++c) {
810 if (!place_island(c, &x, &y))
812 isiz = 1 + rnd(2 * is - 1);
816 } while (secs < isiz && grow_one_sector(c));
818 qprint(" %d(%d)", c - nc + 1, secs);
824 /****************************************************************************
826 ****************************************************************************/
828 create_elevations(void)
834 /* Generic function for finding the distance to the closest sea, land, or
838 distance_to_what(int x, int y, int flag)
842 for (d = 1; d < 5; ++d) {
843 for (j = 0; j < d; ++j)
848 for (j = 0; j < d; ++j) {
849 px = new_x(px + dirx[vector[j]]);
850 py = new_y(py + diry[vector[j]]);
853 case 0: /* distance to sea */
854 if (own[px][py] == -1)
857 case 1: /* distance to land */
858 if (own[px][py] != -1)
861 case 2: /* distance to mountain */
862 if (elev[px][py] == INFINITY)
866 } while (next_vector(d));
871 #define ELEV elev[sectx[c][i]][secty[c][i]]
872 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
873 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
875 /* Decide where the mountains go
880 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
883 for (c = 0; c < ctot; ++c) {
885 ns = (c < nc) ? sc : isecs[c];
886 nm = (pm * ns) / 100;
888 /* Place the mountains */
890 for (i = 0; i < ns; ++i) {
891 dsea[i] = distance_to_sea();
892 weight[i] = (total += (dsea[i] * dsea[i]));
895 for (k = nm, mountain_search = 0;
896 k && mountain_search < MOUNTAIN_SEARCH_MAX;
899 for (i = 0; i < ns; ++i)
900 if (r < weight[i] && ELEV == -INFINITY &&
902 ((!(capx[c] == sectx[c][i] &&
903 capy[c] == secty[c][i])) &&
904 (!(new_x(capx[c] + 2) == sectx[c][i] &&
905 capy[c] == secty[c][i]))))) {
912 /* Elevate land that is not mountain and not capital */
914 for (i = 0; i < ns; ++i)
915 dmoun[i] = distance_to_mountain();
916 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
917 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
919 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
922 for (i = 0; i < ns; ++i) {
923 if (ELEV != INFINITY &&
924 (c >= nc || ((!(capx[c] == sectx[c][i] &&
925 capy[c] == secty[c][i])) &&
926 (!(new_x(capx[c] + 2) == sectx[c][i] &&
927 capy[c] == secty[c][i]))))) {
928 h = 3 * (5 - dmoun[i]) + dsea[i];
938 if (newk >= HILLMIN && newk < PLATMIN)
942 elev[sectx[c][where]][secty[c][where]] = newk;
943 dsea[where] = -INFINITY;
944 dmoun[where] = INFINITY;
947 /* Elevate the mountains and capitals */
949 for (i = 0; i < ns; ++i) {
950 if (ELEV == INFINITY) {
952 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
954 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
955 rnd((256 - HIGHMIN) / 2);
957 (((capx[c] == sectx[c][i] && capy[c] == secty[c][i])) ||
958 ((new_x(capx[c] + 2) == sectx[c][i] &&
959 capy[c] == secty[c][i]))))
965 #define distance_to_land() distance_to_what(x, y, 1)
972 for (y = 0; y < WORLD_Y; ++y) {
973 for (x = y % 2; x < WORLD_X; x += 2) {
974 if (elev[x][y] == -INFINITY)
975 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
980 /****************************************************************************
982 ****************************************************************************/
989 fert = LANDMIN - e + 40;
990 else if (e < FERT_MAX)
991 fert = (120 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1002 oil = (LANDMIN - e) * 2 + rnd(2);
1003 else if (e <= OIL_MAX)
1004 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1014 if (e >= IRON_MIN && e < HIGHMIN)
1015 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1025 if (e >= GOLD_MIN) {
1027 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1029 gold = 100 - 20 * HIGHMIN / e;
1040 if (e >= URAN_MIN && e < HIGHMIN)
1041 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1048 add_resources(struct sctstr *sct)
1050 sct->sct_fertil = set_fert(sct->sct_elev);
1051 sct->sct_oil = set_oil(sct->sct_elev);
1052 sct->sct_min = set_iron(sct->sct_elev);
1053 sct->sct_gmin = set_gold(sct->sct_elev);
1054 sct->sct_uran = set_uran(sct->sct_elev);
1057 /****************************************************************************
1058 DESIGNATE THE SECTORS
1059 ****************************************************************************/
1067 for (y = 0; y < WORLD_Y; y++) {
1068 for (x = y % 2; x < WORLD_X; x += 2) {
1069 sct = getsectp(x, y);
1071 if (total < LANDMIN) {
1072 sct->sct_type = SCT_WATER;
1073 } else if (total < HILLMIN)
1074 sct->sct_type = SCT_RURAL;
1075 else if (total < PLATMIN)
1076 sct->sct_type = SCT_MOUNT;
1077 else if (total < HIGHMIN)
1078 sct->sct_type = SCT_RURAL;
1080 sct->sct_type = SCT_MOUNT;
1081 sct->sct_elev = total;
1082 sct->sct_newtype = sct->sct_type;
1088 for (c = 0; c < nc; ++c) {
1089 sct = getsectp(capx[c], capy[c]);
1090 sct->sct_type = SCT_AIRPT;
1091 sct->sct_newtype = SCT_AIRPT;
1093 set_coastal_flags();
1096 /****************************************************************************
1097 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1098 ****************************************************************************/
1104 for (i = 0; i < WORLD_Y; ++i) {
1108 for (j = i % 2; j < WORLD_X; j += 2) {
1109 if (own[j][i] == -1)
1112 printf("%c ", map_symbol(j, i));
1118 printf("\n\nEach continent is marked by a \"*\" on the map (to distinguish them from\n"
1119 "the islands). You can redesignate these airfields to wilderness sectors\n"
1120 "one at a time, each time you add a new country to the game.\n");
1124 map_symbol(int x, int y)
1128 for (c = 0; c < nc; ++c)
1129 if ((x == capx[c] && y == capy[c])
1130 || (x == new_x(capx[c] + 2) && y == capy[c]))
1132 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1133 || elev[x][y] >= HIGHMIN)
1135 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1138 /***************************************************************************
1139 WRITE A SCRIPT FOR PLACING CAPITALS
1140 ****************************************************************************/
1142 write_newcap_script(void)
1145 FILE *script = fopen(outfile, "w");
1148 printf("fairland: error, unable to write to %s.\n", outfile);
1152 for (c = 0; c < nc; ++c) {
1153 fprintf(script, "add %d %d %d p\n", c + 1, c + 1, c + 1);
1155 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1156 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1158 fprintf(script, "add %d visitor visitor v\n", c + 1);
1164 qprint(const char *const fmt, ...)
1170 vfprintf(stdout, fmt, ap);
1176 set_coastal_flags(void)
1181 qprint("setting coastal flags...\n");
1182 for (i = 0; i < nc; ++i) {
1183 for (j = 0; j < sc; j++) {
1184 sp = getsectp(sectx[i][j], secty[i][j]);
1185 sp->sct_coastal = sectc[i][j];
1188 for (i = nc; i < nc + ni; ++i) {
1189 for (j = 0; j < isecs[i]; j++) {
1190 sp = getsectp(sectx[i][j], secty[i][j]);
1191 sp->sct_coastal = sectc[i][j];