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;
196 rnd_seed = time(NULL);
198 while ((opt = getopt(argc, argv, "ae:ioqs:R:")) != EOF) {
204 DISTINCT_ISLANDS = 0;
207 config_file = optarg;
219 rnd_seed = strtoul(optarg, NULL, 10);
224 if (emp_config(config_file))
227 parse_args(argc - optind, argv + optind);
228 if (allocate_memory() == -1)
235 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
236 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
237 qprint("seed is %lu\n", rnd_seed);
238 qprint("placing capitals...\n");
240 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
241 qprint("growing continents...\n");
243 } while (fl_status && ++i < NUMTRIES);
245 fputs("ERROR: World not large enough to hold continents\n",
249 qprint("growing islands:");
251 qprint("\nelevating land...\n");
253 qprint("designating sectors...\n");
255 qprint("adding resources...\n");
257 qprint("writing to sectors file...\n");
258 if (write_file() == -1)
261 write_newcap_script();
263 qprint("\t*** Resources have not been added ***\n");
272 puts("Creating a planet with:\n");
273 printf("%d continents\n", nc);
274 printf("continent size: %d\n", sc);
275 printf("number of islands: %d\n", ni);
276 printf("average size of islands: %d\n", is);
277 printf("spike: %d%%\n", sp);
278 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
279 pm, (pm * sc) / 100);
280 printf("minimum distance between continents: %d\n", di);
281 printf("minimum distance from islands to continents: %d\n", id);
282 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
290 for (i = 1; i * i < n * 10000; ++i) ;
291 return (i + 50) / 100;
294 /****************************************************************************
295 PARSE COMMAND LINE ARGUMENTS
296 ****************************************************************************/
299 parse_args(int argc, char *argv[])
301 if (argc < 2 || argc > 8) {
302 puts("fairland syntax:\n");
303 puts("fairland [-e config] [-aiqo] [-s script] [-R seed] <nc> <sc> [<ni>] [<is>] [<sp>] [<pm>] [<di>] [<id>]");
304 puts("-q = quiet, -o = no ore produced");
305 puts("-a = Airport marker for continents, -i = islands not distinct");
306 puts("-R = seed to use for random, -e = read config file");
307 printf("-s = name of script (default = %s)\n",
308 DEFAULT_OUTFILE_NAME);
309 puts("nc = number of continents [MANDATORY]");
310 puts("sc = continent size [MANDATORY]");
311 puts("ni = number of islands (default = nc)");
312 puts("is = average size of islands (default = sc/2)");
313 printf("sp = spike percentage: 0 = round, 100 = snake (default = %d)\n",
315 printf("pm = the percentage of land that is mountain (default = %d)\n",
317 printf("di = the minimum distance between continents (default = %d)\n",
319 printf("id = minimum distance from islands to continents (default = %d)\n",
325 puts("fairland: error -- number of continents must be > 0");
331 puts("fairland: error -- size of continents must be > 0");
359 pm = DEFAULT_MOUNTAIN;
366 di = DEFAULT_CONTDIST;
369 puts("fairland: error -- distance between continents must be >= 0");
372 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
373 puts("fairland: error -- distance between continents too large");
380 id = DEFAULT_ISLDIST;
382 puts("fairland: error -- distance from islands to continents must be >= 0");
385 if (id > WORLD_X || id > WORLD_Y) {
386 puts("fairland: error -- distance from islands to continents too large");
389 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
390 puts("fairland: error -- world not big enough to fit continents.");
391 puts("arguments must satisfy:");
392 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
397 /****************************************************************************
398 VARIABLE INITIALIZATION
399 ****************************************************************************/
402 allocate_memory(void)
406 sect_fptr = fopen(empfile[EF_SECTOR].file, "wb");
407 if (sect_fptr == NULL) {
408 perror(empfile[EF_SECTOR].file);
412 (struct sctstr *)calloc((YSIZE * XSIZE), sizeof(struct sctstr));
413 sects = (struct sctstr **)calloc(YSIZE, sizeof(struct sctstr *));
414 for (i = 0; i < YSIZE; i++)
415 sects[i] = §sbuf[XSIZE * i];
416 capx = (int *)calloc(nc, sizeof(int));
417 capy = (int *)calloc(nc, sizeof(int));
418 vector = (int *)calloc(WORLD_X + WORLD_Y, sizeof(int));
419 mc = (int *)calloc(STABLE_CYCLE, sizeof(int));
420 own = (int **)calloc(WORLD_X, sizeof(int *));
421 elev = (int **)calloc(WORLD_X, sizeof(int *));
422 for (i = 0; i < WORLD_X; ++i) {
423 own[i] = (int *)calloc(WORLD_Y, sizeof(int));
424 elev[i] = (int *)calloc(WORLD_Y, sizeof(int));
426 sectx = (int **)calloc(nc + ni, sizeof(int *));
427 secty = (int **)calloc(nc + ni, sizeof(int *));
428 sectc = (int **)calloc(nc + ni, sizeof(int *));
429 isecs = (int *)calloc(nc + ni, sizeof(int));
430 weight = (int *)calloc(max(sc, is * 2), sizeof(int));
431 dsea = (int *)calloc(max(sc, is * 2), sizeof(int));
432 dmoun = (int *)calloc(max(sc, is * 2), sizeof(int));
433 for (i = 0; i < nc; ++i) {
434 sectx[i] = (int *)calloc(sc, sizeof(int));
435 secty[i] = (int *)calloc(sc, sizeof(int));
436 sectc[i] = (int *)calloc(sc, sizeof(int));
438 for (i = nc; i < nc + ni; ++i) {
439 sectx[i] = (int *)calloc(is * 2, sizeof(int));
440 secty[i] = (int *)calloc(is * 2, sizeof(int));
441 sectc[i] = (int *)calloc(is * 2, sizeof(int));
450 int i, j, xx = 0, yy = 0;
455 for (i = 0; i < WORLD_X; ++i) {
456 for (j = 0; j < WORLD_Y; ++j) {
458 elev[i][j] = -INFINITY;
462 for (i = 0; i < nc; ++i, xx += 2) {
467 puts("fairland error: world not big enough for all the continents.\n");
474 for (i = 0; i < STABLE_CYCLE; ++i)
478 /****************************************************************************
479 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
480 ****************************************************************************/
482 /* How isolated is capital j?
485 iso(int j, int newx, int newy)
487 int i, md, d = WORLD_X + WORLD_Y;
489 for (i = 0; i < nc; ++i) {
492 md = mapdist(capx[i], capy[i], newx, newy);
500 /* Drift all the capitals
507 for (turns = 0; turns < DRIFT_MAX; ++turns) {
508 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
510 for (i = 0; i < nc; ++i)
516 /* Check to see if we have stabilized--can we stop drifting the capitals?
522 int i, isod, d = 0, stab = 1;
524 for (i = 0; i < nc; ++i) {
525 isod = iso(i, capx[i], capy[i]);
529 for (i = 0; i < STABLE_CYCLE; ++i)
533 mcc = (mcc + 1) % STABLE_CYCLE;
537 /* This routine does the actual drifting
543 int i, n, newx, newy;
545 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
546 newx = new_x(capx[j] + dirx[i]);
547 newy = new_y(capy[j] + diry[i]);
548 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
556 /****************************************************************************
558 ****************************************************************************/
560 /* Look for a coastal sector of continent c
568 for (i = 0; i < secs; ++i) {
570 for (j = 0; j < 6; ++j)
571 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
576 /* Used for measuring distances
588 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
591 return i > 1 || vector[0] > 0;
594 /* Test to see if we're allowed to grow there: the arguments di and id
597 try_to_grow(int c, int newx, int newy, int d)
601 for (i = 1; i <= d; ++i) {
602 for (j = 0; j < i; ++j)
607 for (j = 0; j < i; ++j) {
608 px = new_x(px + dirx[vector[j]]);
609 py = new_y(py + diry[vector[j]]);
611 if (own[px][py] != -1 &&
613 (DISTINCT_ISLANDS || own[px][py] < nc))
615 } while (next_vector(i));
617 sectx[c][secs] = newx;
618 secty[c][secs] = newy;
623 /* Move along the coast in a clockwise direction.
627 next_coast(int c, int x, int y, int *xp, int *yp)
629 int i, nx, ny, wat = 0;
637 for (i = 0; i < 12; ++i) {
638 nx = new_x(x + dirx[i % 6]);
639 ny = new_y(y + diry[i % 6]);
640 if (own[nx][ny] == -1)
642 if (wat && own[nx][ny] == c) {
650 /* Choose a sector to grow from
662 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
667 } while (i != starti);
669 printf("fairland: BUG -- couldn't find coast for continent %c, sector %d.\nPlease mail stevens@math.utoronto.ca.\n",
678 /* Grow continent c by 1 sector
682 grow_one_sector(int c)
684 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
686 spike = rnd(100) < sp;
687 if ((try1 = new_try(c)) == -1)
689 x = sx = sectx[c][try1];
690 y = sy = secty[c][try1];
695 for (i = rnd(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
696 newx = new_x(x + dirx[i]);
697 newy = new_y(y + diry[i]);
698 if (own[newx][newy] == -1 &&
700 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
701 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
702 if (try_to_grow(c, newx, newy, c < nc ? di : id))
706 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
707 newx = new_x(x + dirx[i]);
708 newy = new_y(y + diry[i]);
709 if (own[newx][newy] == -1)
710 if (try_to_grow(c, newx, newy, c < nc ? di : id))
713 next_coast(c, x, y, &x, &y);
715 } while (!done && coast_search < COAST_SEARCH_MAX &&
716 (secs == 1 || x != sx || y != sy));
717 if (!done && c < nc) {
718 qprint("fairland: error -- continent %c had no room to grow!\n",
720 fl_status |= STATUS_NO_ROOM;
725 /* Grow all the continents
728 grow_continents(void)
732 for (c = 0; c < nc; ++c) {
733 sectx[c][0] = capx[c];
734 secty[c][0] = capy[c];
735 own[sectx[c][0]][secty[c][0]] = c;
736 sectx[c][1] = new_x(capx[c] + 2);
737 secty[c][1] = capy[c];
738 own[sectx[c][1]][secty[c][1]] = c;
741 for (secs = 2; secs < sc && !fl_status; ++secs) {
742 for (c = 0; c < nc; ++c) {
748 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
752 /****************************************************************************
754 ****************************************************************************/
756 /* Choose a place to start growing an island from
759 place_island(int c, int *xp, int *yp)
762 int ssy = rnd(WORLD_Y);
763 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
765 if (ssx > WORLD_X - 2)
766 ssx = new_x(ssx + 2);
767 for (d = di + id; d >= id; --d) {
771 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
772 if (*xp >= WORLD_X) {
773 *yp = new_y(*yp + 1);
775 if (*xp == sx && *yp == sy)
778 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
785 /* Grow all the islands
793 for (c = nc; c < nc + ni; ++c) {
795 if (!place_island(c, &x, &y))
797 isiz = 1 + rnd(2 * is - 1);
801 } while (secs < isiz && grow_one_sector(c));
802 qprint(" %d(%d)", c - nc + 1, secs);
808 /****************************************************************************
810 ****************************************************************************/
812 create_elevations(void)
818 /* Generic function for finding the distance to the closest sea, land, or
822 distance_to_what(int x, int y, int flag)
826 for (d = 1; d < 5; ++d) {
827 for (j = 0; j < d; ++j)
832 for (j = 0; j < d; ++j) {
833 px = new_x(px + dirx[vector[j]]);
834 py = new_y(py + diry[vector[j]]);
837 case 0: /* distance to sea */
838 if (own[px][py] == -1)
841 case 1: /* distance to land */
842 if (own[px][py] != -1)
845 case 2: /* distance to mountain */
846 if (elev[px][py] == INFINITY)
850 } while (next_vector(d));
855 #define ELEV elev[sectx[c][i]][secty[c][i]]
856 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
857 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
859 /* Decide where the mountains go
864 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
867 for (c = 0; c < ctot; ++c) {
869 ns = (c < nc) ? sc : isecs[c];
870 nm = (pm * ns) / 100;
872 /* Place the mountains */
874 for (i = 0; i < ns; ++i) {
875 dsea[i] = distance_to_sea();
876 weight[i] = (total += (dsea[i] * dsea[i]));
879 for (k = nm, mountain_search = 0;
880 k && mountain_search < MOUNTAIN_SEARCH_MAX;
883 for (i = 0; i < ns; ++i)
884 if (r < weight[i] && ELEV == -INFINITY &&
886 ((!(capx[c] == sectx[c][i] &&
887 capy[c] == secty[c][i])) &&
888 (!(new_x(capx[c] + 2) == sectx[c][i] &&
889 capy[c] == secty[c][i]))))) {
896 /* Elevate land that is not mountain and not capital */
898 for (i = 0; i < ns; ++i)
899 dmoun[i] = distance_to_mountain();
900 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
901 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
903 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
906 for (i = 0; i < ns; ++i) {
907 if (ELEV != INFINITY &&
908 (c >= nc || ((!(capx[c] == sectx[c][i] &&
909 capy[c] == secty[c][i])) &&
910 (!(new_x(capx[c] + 2) == sectx[c][i] &&
911 capy[c] == secty[c][i]))))) {
912 h = 3 * (5 - dmoun[i]) + dsea[i];
922 if (newk >= HILLMIN && newk < PLATMIN)
926 elev[sectx[c][where]][secty[c][where]] = newk;
927 dsea[where] = -INFINITY;
928 dmoun[where] = INFINITY;
931 /* Elevate the mountains and capitals */
933 for (i = 0; i < ns; ++i) {
934 if (ELEV == INFINITY) {
936 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
938 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
939 rnd((256 - HIGHMIN) / 2);
940 } else if ((c < nc &&
941 ((capx[c] == sectx[c][i] && capy[c] == secty[c][i]))) ||
942 ((new_x(capx[c] + 2) == sectx[c][i] &&
943 capy[c] == secty[c][i])))
949 #define distance_to_land() distance_to_what(x, y, 1)
956 for (y = 0; y < WORLD_Y; ++y) {
957 for (x = y % 2; x < WORLD_X; x += 2) {
958 if (elev[x][y] == -INFINITY)
959 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
964 /****************************************************************************
966 ****************************************************************************/
973 fert = LANDMIN - e + 40;
974 else if (e < FERT_MAX)
975 fert = (140 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
986 oil = (LANDMIN - e) * 2 + rnd(2);
987 else if (e <= OIL_MAX)
988 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
998 if (e >= IRON_MIN && e < HIGHMIN)
999 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1009 if (e >= GOLD_MIN) {
1011 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1013 gold = 100 - 20 * HIGHMIN / e;
1024 if (e >= URAN_MIN && e < HIGHMIN)
1025 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1032 add_resources(struct sctstr *sct)
1034 sct->sct_fertil = set_fert(sct->sct_elev);
1035 sct->sct_oil = set_oil(sct->sct_elev);
1036 sct->sct_min = set_iron(sct->sct_elev);
1037 sct->sct_gmin = set_gold(sct->sct_elev);
1038 sct->sct_uran = set_uran(sct->sct_elev);
1041 /****************************************************************************
1042 DESIGNATE THE SECTORS
1043 ****************************************************************************/
1051 /* sct = §s[0][0]; */
1053 for (y = 0; y < YSIZE; y++) {
1054 for (x = 0; x < XSIZE; x++, sct++) {
1055 fl_sct_init(x * 2 + (y & 01), y, (s_char *)sct);
1056 total = elev[sct->sct_x][y];
1057 if (total < LANDMIN) {
1058 sct->sct_type = SCT_WATER;
1059 } else if (total < HILLMIN)
1060 sct->sct_type = SCT_RURAL;
1061 else if (total < PLATMIN)
1062 sct->sct_type = SCT_MOUNT;
1063 else if (total < HIGHMIN)
1064 sct->sct_type = SCT_RURAL;
1066 sct->sct_type = SCT_MOUNT;
1067 sct->sct_elev = total;
1068 sct->sct_newtype = sct->sct_type;
1074 for (c = 0; c < nc; ++c) {
1075 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_type = SCT_AIRPT;
1076 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_newtype = SCT_AIRPT;
1080 /****************************************************************************
1081 WRITE ALL THIS STUFF TO THE FILE
1082 ****************************************************************************/
1088 if ((n = fwrite((void *)sectsbuf, sizeof(struct sctstr),
1089 YSIZE * XSIZE, sect_fptr)) <= 0) {
1090 perror(empfile[EF_SECTOR].file);
1093 if (n != YSIZE * XSIZE) {
1094 printf("%s:partial write\n", empfile[EF_SECTOR].file);
1101 /****************************************************************************
1102 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1103 ****************************************************************************/
1109 translate_continents();
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\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");
1128 /* Reorder the continents from top left to bottom right */
1130 translate_continents(void)
1132 int i, j, n = 0, k, gotit, c;
1133 int *trans, *trans_cont, *oldcapx, *oldcapy;
1135 trans = (int *)calloc(nc, sizeof(int));
1136 trans_cont = (int *)calloc(nc, sizeof(int));
1137 oldcapx = (int *)calloc(nc, sizeof(int));
1138 oldcapy = (int *)calloc(nc, sizeof(int));
1140 for (i = 0; i < WORLD_Y; ++i) {
1141 for (j = i % 2; j < WORLD_X; j += 2) {
1142 if (own[j][i] > -1 && own[j][i] < nc) {
1144 for (k = 0; k < n; ++k) {
1145 if (trans[k] == own[j][i])
1150 printf("fairland: BUG in translate continents! mail stevens@math.utoronto.ca\n");
1153 trans[n] = own[j][i];
1154 trans_cont[own[j][i]] = n;
1160 for (i = 0; i < WORLD_Y; ++i) {
1161 for (j = i % 2; j < WORLD_X; j += 2) {
1162 if (own[j][i] > -1 && own[j][i] < nc) {
1163 own[j][i] = trans_cont[own[j][i]];
1167 for (c = 0; c < nc; ++c) {
1168 oldcapx[c] = capx[c];
1169 oldcapy[c] = capy[c];
1171 for (c = 0; c < nc; ++c) {
1172 capx[c] = oldcapx[trans[c]];
1173 capy[c] = oldcapy[trans[c]];
1178 map_symbol(int x, int y)
1182 for (c = 0; c < nc; ++c)
1183 if ((x == capx[c] && y == capy[c])
1184 || (x == new_x(capx[c] + 2) && y == capy[c]))
1186 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1187 || elev[x][y] >= HIGHMIN)
1189 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1192 /***************************************************************************
1193 WRITE A SCRIPT FOR PLACING CAPITALS
1194 ****************************************************************************/
1196 write_newcap_script(void)
1199 FILE *script = fopen(outfile, "w");
1202 printf("fairland: error, unable to write to %s.\n", outfile);
1206 for (c = 0; c < nc; ++c) {
1207 fprintf(script, "add %d %d %d n i\n", c + 1, c + 1, c + 1);
1209 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1210 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1212 fprintf(script, "add %d visitor visitor v i\n", c + 1);
1215 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
1221 qprint(const char * const fmt, ...)
1227 vfprintf(stdout, fmt, ap);
1233 fl_sct_init(coord x, coord y, s_char *ptr)
1235 struct sctstr *sp = (struct sctstr *)ptr;
1237 sp->ef_type = EF_SECTOR;
1244 sp->sct_defense = 0;