2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2004, Dave Pare, Jeff Bailey, Thomas Ruschak,
4 * Ken Stevens, Steve McClure
6 * This program 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 2 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, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 * See the "LEGAL", "LICENSE", "CREDITS" and "README" files for all the
23 * related information and legal notices. It is expected that any future
24 * projects/authors will amend these files as needed.
28 * fairland.c: Create a nice, new world
30 * Known contributors to this file:
35 /* define ORE 1 to add resources, define ORE 0 if you want to use another
36 program to add the resources */
40 /* If you don't specify these command line arguments, then these are the
42 #define DEFAULT_SPIKE 10
43 #define DEFAULT_MOUNTAIN 0
44 #define DEFAULT_CONTDIST 2
45 #define DEFAULT_ISLDIST 1
47 /* The following five numbers refer to elevation under which (in the case of
48 fertility or oil) or over which (in the case of iron, gold, and uranium)
49 sectors with that elevation will contain that resource. Elevation ranges
52 /* raise FERT_MAX for more fertility */
55 /* raise OIL_MAX for more oil */
58 /* lower IRON_MIN for more iron */
61 /* lower GOLD_MIN for more gold */
64 /* lower URAN_MIN for more uranium */
67 #if defined(aix) || defined(linux) || defined(solaris)
69 #endif /* aix or linux */
71 #include "../lib/gen/getopt.h"
86 #include "prototypes.h"
88 /* do not change these 4 defines */
89 #define LANDMIN 1 /* plate altitude for normal land */
90 #define HILLMIN 34 /* plate altitude for hills */
91 #define PLATMIN 36 /* plate altitude for plateau */
92 #define HIGHMIN 98 /* plate altitude for mountains */
94 static void qprint(const char * const fmt, ...)
95 ATTRIBUTE((format (printf, 1, 2)));
97 #define DEFAULT_OUTFILE_NAME "newcap_script"
98 static const char *outfile = DEFAULT_OUTFILE_NAME;
99 /* mark the continents with a * so you can tell them
100 from the islands 1 = mark, 0 = don't mark. */
101 static int AIRPORT_MARKER = 0;
103 /* don't let the islands crash into each other.
104 1 = don't merge, 0 = merge. */
105 static int DISTINCT_ISLANDS = 1;
107 #define XSIZE ((WORLD_X) / 2) /* basically world x-y size */
108 #define YSIZE (WORLD_Y)
109 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
110 #define INFINITY 999 /* a number which means "BIG" */
112 /* these defines prevent infinite loops:
115 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
116 when growing continents and islands */
117 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
118 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
119 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
124 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
125 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
127 #define max(a,b) (a>b?a:b)
129 #define rnd(x) (random() % (x))
131 int secs; /* number of sectors grown */
132 int ctot; /* total number of continents and islands grown */
133 int *isecs; /* array of how large each island is */
135 int nc, sc, di, sp, pm, ni, is, id; /* the 8 arguments to this program */
136 unsigned long rnd_seed; /* optional seed can be passed as an argument */
137 int *capx, *capy; /* location of the nc capitals */
138 int *mc, mcc; /* array and counter used for stability
139 check when perturbing */
140 int spike; /* are we spiking? */
141 int mind; /* the final distance between capitals that
143 int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
144 int diry[] = { 0, -1, -1, 0, 1, 1 };
146 int **own; /* owner of the sector. -1 means water */
147 int **elev; /* elevation of the sectors */
148 int **sectx, **secty; /* the sectors for each continent */
149 int **sectc; /* which sectors are on the coast? */
150 int *vector; /* used for measuring distances */
151 int *weight; /* used for placing mountains */
152 int *dsea, *dmoun; /* the dist to the ocean and mountain */
153 FILE *sect_fptr; /* the file we write everything to */
154 struct sctstr **sects;
155 struct sctstr *sectsbuf;
156 int fl_status; /* is anything wrong? */
157 #define STATUS_NO_ROOM (1) /* there was no room to grow */
158 #define NUMTRIES 10 /* keep trying to grow this many times */
160 const char *numletter =
161 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
163 static void parse_args(int argc, char *argv[]);
164 static int allocate_memory(void);
165 static void init(void);
166 static int drift(void);
167 static void grow_continents(void);
168 static void create_elevations(void);
169 static void write_sects(void);
170 static int write_file(void);
171 static void output(void);
172 static int write_newcap_script(void);
173 static int stable(void);
174 static void elevate_land(void);
175 static void elevate_sea(void);
176 static void translate_continents(void);
177 static int map_symbol(int x, int y);
178 static void fl_sct_init(coord x, coord y, s_char *ptr);
180 static void print_vars(void);
181 static void fl_move(int);
182 static void next_coast(int c, int x, int y, int *xp, int *yp);
183 static void grow_islands(void);
185 /****************************************************************************
187 ****************************************************************************/
190 main(int argc, char *argv[])
193 char *config_file = NULL;
197 rnd_seed = time(NULL);
199 while ((opt = getopt(argc, argv, "ae:ioqs:R:")) != EOF) {
205 DISTINCT_ISLANDS = 0;
208 config_file = optarg;
220 rnd_seed = strtoul(optarg, NULL, 10);
225 if (config_file == NULL) {
226 sprintf(tbuf, "%s/econfig", datadir);
229 emp_config(config_file);
231 parse_args(argc - optind, argv + optind);
232 if (allocate_memory() == -1)
239 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
240 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
241 qprint("seed is %lu\n", rnd_seed);
242 qprint("placing capitals...\n");
244 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
245 qprint("growing continents...\n");
247 } while (fl_status && ++i < NUMTRIES);
249 fputs("ERROR: World not large enough to hold continents\n",
253 qprint("growing islands:");
255 qprint("\nelevating land...\n");
257 qprint("designating sectors...\n");
259 qprint("adding resources...\n");
261 qprint("writing to sectors file...\n");
262 if (write_file() == -1)
265 write_newcap_script();
267 qprint("\t*** Resources have not been added ***\n");
276 puts("Creating a planet with:\n");
277 printf("%d continents\n", nc);
278 printf("continent size: %d\n", sc);
279 printf("number of islands: %d\n", ni);
280 printf("average size of islands: %d\n", is);
281 printf("spike: %d%%\n", sp);
282 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
283 pm, (pm * sc) / 100);
284 printf("minimum distance between continents: %d\n", di);
285 printf("minimum distance from islands to continents: %d\n", id);
286 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
294 for (i = 1; i * i < n * 10000; ++i) ;
295 return (i + 50) / 100;
298 /****************************************************************************
299 PARSE COMMAND LINE ARGUMENTS
300 ****************************************************************************/
303 parse_args(int argc, char *argv[])
305 if (argc < 2 || argc > 8) {
306 puts("fairland syntax:\n");
307 puts("fairland [-e config] [-aiqo] [-s script] [-R seed] <nc> <sc> [<ni>] [<is>] [<sp>] [<pm>] [<di>] [<id>]");
308 puts("-q = quiet, -o = no ore produced");
309 puts("-a = Airport marker for continents, -i = islands not distinct");
310 puts("-R = seed to use for random, -e = read config file");
311 printf("-s = name of script (default = %s)\n",
312 DEFAULT_OUTFILE_NAME);
313 puts("nc = number of continents [MANDATORY]");
314 puts("sc = continent size [MANDATORY]");
315 puts("ni = number of islands (default = nc)");
316 puts("is = average size of islands (default = sc/2)");
317 printf("sp = spike percentage: 0 = round, 100 = snake (default = %d)\n",
319 printf("pm = the percentage of land that is mountain (default = %d)\n",
321 printf("di = the minimum distance between continents (default = %d)\n",
323 printf("id = minimum distance from islands to continents (default = %d)\n",
329 puts("fairland: error -- number of continents must be > 0");
335 puts("fairland: error -- size of continents must be > 0");
363 pm = DEFAULT_MOUNTAIN;
370 di = DEFAULT_CONTDIST;
373 puts("fairland: error -- distance between continents must be >= 0");
376 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
377 puts("fairland: error -- distance between continents too large");
384 id = DEFAULT_ISLDIST;
386 puts("fairland: error -- distance from islands to continents must be >= 0");
389 if (id > WORLD_X || id > WORLD_Y) {
390 puts("fairland: error -- distance from islands to continents too large");
393 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
394 puts("fairland: error -- world not big enough to fit continents.");
395 puts("arguments must satisfy:");
396 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
401 /****************************************************************************
402 VARIABLE INITIALIZATION
403 ****************************************************************************/
406 allocate_memory(void)
410 sect_fptr = fopen(empfile[EF_SECTOR].file, "wb");
411 if (sect_fptr == NULL) {
412 perror(empfile[EF_SECTOR].file);
416 (struct sctstr *)calloc((YSIZE * XSIZE), sizeof(struct sctstr));
417 sects = (struct sctstr **)calloc(YSIZE, sizeof(struct sctstr *));
418 for (i = 0; i < YSIZE; i++)
419 sects[i] = §sbuf[XSIZE * i];
420 capx = (int *)calloc(nc, sizeof(int));
421 capy = (int *)calloc(nc, sizeof(int));
422 vector = (int *)calloc(WORLD_X + WORLD_Y, sizeof(int));
423 mc = (int *)calloc(STABLE_CYCLE, sizeof(int));
424 own = (int **)calloc(WORLD_X, sizeof(int *));
425 elev = (int **)calloc(WORLD_X, sizeof(int *));
426 for (i = 0; i < WORLD_X; ++i) {
427 own[i] = (int *)calloc(WORLD_Y, sizeof(int));
428 elev[i] = (int *)calloc(WORLD_Y, sizeof(int));
430 sectx = (int **)calloc(nc + ni, sizeof(int *));
431 secty = (int **)calloc(nc + ni, sizeof(int *));
432 sectc = (int **)calloc(nc + ni, sizeof(int *));
433 isecs = (int *)calloc(nc + ni, sizeof(int));
434 weight = (int *)calloc(max(sc, is * 2), sizeof(int));
435 dsea = (int *)calloc(max(sc, is * 2), sizeof(int));
436 dmoun = (int *)calloc(max(sc, is * 2), sizeof(int));
437 for (i = 0; i < nc; ++i) {
438 sectx[i] = (int *)calloc(sc, sizeof(int));
439 secty[i] = (int *)calloc(sc, sizeof(int));
440 sectc[i] = (int *)calloc(sc, sizeof(int));
442 for (i = nc; i < nc + ni; ++i) {
443 sectx[i] = (int *)calloc(is * 2, sizeof(int));
444 secty[i] = (int *)calloc(is * 2, sizeof(int));
445 sectc[i] = (int *)calloc(is * 2, sizeof(int));
454 int i, j, xx = 0, yy = 0;
459 for (i = 0; i < WORLD_X; ++i) {
460 for (j = 0; j < WORLD_Y; ++j) {
462 elev[i][j] = -INFINITY;
466 for (i = 0; i < nc; ++i, xx += 2) {
471 puts("fairland error: world not big enough for all the continents.\n");
478 for (i = 0; i < STABLE_CYCLE; ++i)
482 /****************************************************************************
483 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
484 ****************************************************************************/
486 /* How isolated is capital j?
489 iso(int j, int newx, int newy)
491 int i, md, d = WORLD_X + WORLD_Y;
493 for (i = 0; i < nc; ++i) {
496 md = mapdist(capx[i], capy[i], newx, newy);
504 /* Drift all the capitals
511 for (turns = 0; turns < DRIFT_MAX; ++turns) {
512 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
514 for (i = 0; i < nc; ++i)
520 /* Check to see if we have stabilized--can we stop drifting the capitals?
526 int i, isod, d = 0, stab = 1;
528 for (i = 0; i < nc; ++i) {
529 isod = iso(i, capx[i], capy[i]);
533 for (i = 0; i < STABLE_CYCLE; ++i)
537 mcc = (mcc + 1) % STABLE_CYCLE;
541 /* This routine does the actual drifting
547 int i, n, newx, newy;
549 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
550 newx = new_x(capx[j] + dirx[i]);
551 newy = new_y(capy[j] + diry[i]);
552 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
560 /****************************************************************************
562 ****************************************************************************/
564 /* Look for a coastal sector of continent c
572 for (i = 0; i < secs; ++i) {
574 for (j = 0; j < 6; ++j)
575 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
580 /* Used for measuring distances
592 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
595 return i > 1 || vector[0] > 0;
598 /* Test to see if we're allowed to grow there: the arguments di and id
601 try_to_grow(int c, int newx, int newy, int d)
605 for (i = 1; i <= d; ++i) {
606 for (j = 0; j < i; ++j)
611 for (j = 0; j < i; ++j) {
612 px = new_x(px + dirx[vector[j]]);
613 py = new_y(py + diry[vector[j]]);
615 if (own[px][py] != -1 &&
617 (DISTINCT_ISLANDS || own[px][py] < nc))
619 } while (next_vector(i));
621 sectx[c][secs] = newx;
622 secty[c][secs] = newy;
627 /* Move along the coast in a clockwise direction.
631 next_coast(int c, int x, int y, int *xp, int *yp)
633 int i, nx, ny, wat = 0;
641 for (i = 0; i < 12; ++i) {
642 nx = new_x(x + dirx[i % 6]);
643 ny = new_y(y + diry[i % 6]);
644 if (own[nx][ny] == -1)
646 if (wat && own[nx][ny] == c) {
654 /* Choose a sector to grow from
666 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
671 } while (i != starti);
673 printf("fairland: BUG -- couldn't find coast for continent %c, sector %d.\nPlease mail stevens@math.utoronto.ca.\n",
682 /* Grow continent c by 1 sector
686 grow_one_sector(int c)
688 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
690 spike = rnd(100) < sp;
691 if ((try1 = new_try(c)) == -1)
693 x = sx = sectx[c][try1];
694 y = sy = secty[c][try1];
699 for (i = rnd(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
700 newx = new_x(x + dirx[i]);
701 newy = new_y(y + diry[i]);
702 if (own[newx][newy] == -1 &&
704 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
705 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
706 if (try_to_grow(c, newx, newy, c < nc ? di : id))
710 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
711 newx = new_x(x + dirx[i]);
712 newy = new_y(y + diry[i]);
713 if (own[newx][newy] == -1)
714 if (try_to_grow(c, newx, newy, c < nc ? di : id))
717 next_coast(c, x, y, &x, &y);
719 } while (!done && coast_search < COAST_SEARCH_MAX &&
720 (secs == 1 || x != sx || y != sy));
721 if (!done && c < nc) {
722 qprint("fairland: error -- continent %c had no room to grow!\n",
724 fl_status |= STATUS_NO_ROOM;
729 /* Grow all the continents
732 grow_continents(void)
736 for (c = 0; c < nc; ++c) {
737 sectx[c][0] = capx[c];
738 secty[c][0] = capy[c];
739 own[sectx[c][0]][secty[c][0]] = c;
740 sectx[c][1] = new_x(capx[c] + 2);
741 secty[c][1] = capy[c];
742 own[sectx[c][1]][secty[c][1]] = c;
745 for (secs = 2; secs < sc && !fl_status; ++secs) {
746 for (c = 0; c < nc; ++c) {
752 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
756 /****************************************************************************
758 ****************************************************************************/
760 /* Choose a place to start growing an island from
763 place_island(int c, int *xp, int *yp)
766 int ssy = rnd(WORLD_Y);
767 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
769 if (ssx > WORLD_X - 2)
770 ssx = new_x(ssx + 2);
771 for (d = di + id; d >= id; --d) {
775 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
776 if (*xp >= WORLD_X) {
777 *yp = new_y(*yp + 1);
779 if (*xp == sx && *yp == sy)
782 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
789 /* Grow all the islands
797 for (c = nc; c < nc + ni; ++c) {
799 if (!place_island(c, &x, &y))
801 isiz = 1 + rnd(2 * is - 1);
805 } while (secs < isiz && grow_one_sector(c));
806 qprint(" %d(%d)", c - nc + 1, secs);
812 /****************************************************************************
814 ****************************************************************************/
816 create_elevations(void)
822 /* Generic function for finding the distance to the closest sea, land, or
826 distance_to_what(int x, int y, int flag)
830 for (d = 1; d < 5; ++d) {
831 for (j = 0; j < d; ++j)
836 for (j = 0; j < d; ++j) {
837 px = new_x(px + dirx[vector[j]]);
838 py = new_y(py + diry[vector[j]]);
841 case 0: /* distance to sea */
842 if (own[px][py] == -1)
845 case 1: /* distance to land */
846 if (own[px][py] != -1)
849 case 2: /* distance to mountain */
850 if (elev[px][py] == INFINITY)
854 } while (next_vector(d));
859 #define ELEV elev[sectx[c][i]][secty[c][i]]
860 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
861 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
863 /* Decide where the mountains go
868 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
871 for (c = 0; c < ctot; ++c) {
873 ns = (c < nc) ? sc : isecs[c];
874 nm = (pm * ns) / 100;
876 /* Place the mountains */
878 for (i = 0; i < ns; ++i) {
879 dsea[i] = distance_to_sea();
880 weight[i] = (total += (dsea[i] * dsea[i]));
883 for (k = nm, mountain_search = 0;
884 k && mountain_search < MOUNTAIN_SEARCH_MAX;
887 for (i = 0; i < ns; ++i)
888 if (r < weight[i] && ELEV == -INFINITY &&
890 ((!(capx[c] == sectx[c][i] &&
891 capy[c] == secty[c][i])) &&
892 (!(new_x(capx[c] + 2) == sectx[c][i] &&
893 capy[c] == secty[c][i]))))) {
900 /* Elevate land that is not mountain and not capital */
902 for (i = 0; i < ns; ++i)
903 dmoun[i] = distance_to_mountain();
904 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
905 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
907 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
910 for (i = 0; i < ns; ++i) {
911 if (ELEV != INFINITY &&
912 (c >= nc || ((!(capx[c] == sectx[c][i] &&
913 capy[c] == secty[c][i])) &&
914 (!(new_x(capx[c] + 2) == sectx[c][i] &&
915 capy[c] == secty[c][i]))))) {
916 h = 3 * (5 - dmoun[i]) + dsea[i];
926 if (newk >= HILLMIN && newk < PLATMIN)
930 elev[sectx[c][where]][secty[c][where]] = newk;
931 dsea[where] = -INFINITY;
932 dmoun[where] = INFINITY;
935 /* Elevate the mountains and capitals */
937 for (i = 0; i < ns; ++i) {
938 if (ELEV == INFINITY) {
940 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
942 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
943 rnd((256 - HIGHMIN) / 2);
944 } else if ((c < nc &&
945 ((capx[c] == sectx[c][i] && capy[c] == secty[c][i]))) ||
946 ((new_x(capx[c] + 2) == sectx[c][i] &&
947 capy[c] == secty[c][i])))
953 #define distance_to_land() distance_to_what(x, y, 1)
960 for (y = 0; y < WORLD_Y; ++y) {
961 for (x = y % 2; x < WORLD_X; x += 2) {
962 if (elev[x][y] == -INFINITY)
963 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
968 /****************************************************************************
970 ****************************************************************************/
977 fert = LANDMIN - e + 40;
978 else if (e < FERT_MAX)
979 fert = (140 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
990 oil = (LANDMIN - e) * 2 + rnd(2);
991 else if (e <= OIL_MAX)
992 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1002 if (e >= IRON_MIN && e < HIGHMIN)
1003 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1013 if (e >= GOLD_MIN) {
1015 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1017 gold = 100 - 20 * HIGHMIN / e;
1028 if (e >= URAN_MIN && e < HIGHMIN)
1029 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1036 add_resources(struct sctstr *sct)
1038 sct->sct_fertil = set_fert(sct->sct_elev);
1039 sct->sct_oil = set_oil(sct->sct_elev);
1040 sct->sct_min = set_iron(sct->sct_elev);
1041 sct->sct_gmin = set_gold(sct->sct_elev);
1042 sct->sct_uran = set_uran(sct->sct_elev);
1045 /****************************************************************************
1046 DESIGNATE THE SECTORS
1047 ****************************************************************************/
1055 /* sct = §s[0][0]; */
1057 for (y = 0; y < YSIZE; y++) {
1058 for (x = 0; x < XSIZE; x++, sct++) {
1059 fl_sct_init(x * 2 + (y & 01), y, (s_char *)sct);
1060 total = elev[sct->sct_x][y];
1061 if (total < LANDMIN) {
1062 sct->sct_type = SCT_WATER;
1063 } else if (total < HILLMIN)
1064 sct->sct_type = SCT_RURAL;
1065 else if (total < PLATMIN)
1066 sct->sct_type = SCT_MOUNT;
1067 else if (total < HIGHMIN)
1068 sct->sct_type = SCT_RURAL;
1070 sct->sct_type = SCT_MOUNT;
1071 sct->sct_elev = total;
1072 sct->sct_newtype = sct->sct_type;
1078 for (c = 0; c < nc; ++c) {
1079 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_type = SCT_AIRPT;
1080 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_newtype = SCT_AIRPT;
1084 /****************************************************************************
1085 WRITE ALL THIS STUFF TO THE FILE
1086 ****************************************************************************/
1092 if ((n = fwrite((void *)sectsbuf, sizeof(struct sctstr),
1093 YSIZE * XSIZE, sect_fptr)) <= 0) {
1094 perror(empfile[EF_SECTOR].file);
1097 if (n != YSIZE * XSIZE) {
1098 printf("%s:partial write\n", empfile[EF_SECTOR].file);
1105 /****************************************************************************
1106 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1107 ****************************************************************************/
1113 translate_continents();
1115 for (i = 0; i < WORLD_Y; ++i) {
1119 for (j = i % 2; j < WORLD_X; j += 2) {
1120 if (own[j][i] == -1)
1123 printf("%c ", map_symbol(j, i));
1129 printf("\n\nEach continent is marked by a \"*\" on the map (to distinguish them from\nthe islands). You can redesignate these airfields to wilderness sectors\none at a time, each time you add a new country to the game.\n");
1132 /* Reorder the continents from top left to bottom right */
1134 translate_continents(void)
1136 int i, j, n = 0, k, gotit, c;
1137 int *trans, *trans_cont, *oldcapx, *oldcapy;
1139 trans = (int *)calloc(nc, sizeof(int));
1140 trans_cont = (int *)calloc(nc, sizeof(int));
1141 oldcapx = (int *)calloc(nc, sizeof(int));
1142 oldcapy = (int *)calloc(nc, sizeof(int));
1144 for (i = 0; i < WORLD_Y; ++i) {
1145 for (j = i % 2; j < WORLD_X; j += 2) {
1146 if (own[j][i] > -1 && own[j][i] < nc) {
1148 for (k = 0; k < n; ++k) {
1149 if (trans[k] == own[j][i])
1154 printf("fairland: BUG in translate continents! mail stevens@math.utoronto.ca\n");
1157 trans[n] = own[j][i];
1158 trans_cont[own[j][i]] = n;
1164 for (i = 0; i < WORLD_Y; ++i) {
1165 for (j = i % 2; j < WORLD_X; j += 2) {
1166 if (own[j][i] > -1 && own[j][i] < nc) {
1167 own[j][i] = trans_cont[own[j][i]];
1171 for (c = 0; c < nc; ++c) {
1172 oldcapx[c] = capx[c];
1173 oldcapy[c] = capy[c];
1175 for (c = 0; c < nc; ++c) {
1176 capx[c] = oldcapx[trans[c]];
1177 capy[c] = oldcapy[trans[c]];
1182 map_symbol(int x, int y)
1186 for (c = 0; c < nc; ++c)
1187 if ((x == capx[c] && y == capy[c])
1188 || (x == new_x(capx[c] + 2) && y == capy[c]))
1190 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1191 || elev[x][y] >= HIGHMIN)
1193 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1196 /***************************************************************************
1197 WRITE A SCRIPT FOR PLACING CAPITALS
1198 ****************************************************************************/
1200 write_newcap_script(void)
1203 FILE *script = fopen(outfile, "w");
1206 printf("fairland: error, unable to write to %s.\n", outfile);
1210 for (c = 0; c < nc; ++c) {
1211 fprintf(script, "add %d %d %d n i\n", c + 1, c + 1, c + 1);
1213 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1214 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1216 fprintf(script, "add %d visitor visitor v i\n", c + 1);
1219 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
1225 qprint(const char * const fmt, ...)
1231 vfprintf(stdout, fmt, ap);
1237 fl_sct_init(coord x, coord y, s_char *ptr)
1239 struct sctstr *sp = (struct sctstr *)ptr;
1241 sp->ef_type = EF_SECTOR;
1248 sp->sct_defense = 0;