2 * Empire - A multi-player, client/server Internet based war game.
3 * Copyright (C) 1986-2000, 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 */
82 #include "prototypes.h"
84 /* do not change these 4 defines */
85 #define LANDMIN 1 /* plate altitude for normal land */
86 #define HILLMIN 34 /* plate altitude for hills */
87 #define PLATMIN 36 /* plate altitude for plateau */
88 #define HIGHMIN 98 /* plate altitude for mountains */
90 static void qprint(const char *str);
92 static const char *outfile = "newcap_script";
93 /* mark the continents with a * so you can tell them
94 from the islands 1 = mark, 0 = don't mark. */
95 static int AIRPORT_MARKER = 0;
97 /* don't let the islands crash into each other.
98 1 = don't merge, 0 = merge. */
99 static int DISTINCT_ISLANDS = 1;
101 #define XSIZE ((WORLD_X) / 2) /* basically world x-y size */
102 #define YSIZE (WORLD_Y)
103 #define STABLE_CYCLE 4 /* stability required for perterbed capitals */
104 #define INFINITY 999 /* a number which means "BIG" */
106 /* these defines prevent infinite loops:
109 #define COAST_SEARCH_MAX 200 /* how many times do we look for a coast sector
110 when growing continents and islands */
111 #define DRIFT_BEFORE_CHECK ((WORLD_X + WORLD_Y)/2)
112 #define DRIFT_MAX ((WORLD_X + WORLD_Y)*2)
113 #define MOUNTAIN_SEARCH_MAX 1000 /* how long do we try to place mountains */
118 #define new_x(newx) (((newx) + WORLD_X) % WORLD_X)
119 #define new_y(newy) (((newy) + WORLD_Y) % WORLD_Y)
121 #define max(a,b) (a>b?a:b)
123 #define rnd(x) (random() % (x))
125 int secs; /* number of sectors grown */
126 int ctot; /* total number of continents and islands grown */
127 int *isecs; /* array of how large each island is */
129 int nc, sc, di, sp, pm, ni, is, id; /* the 8 arguments to this program */
130 int *capx, *capy; /* location of the nc capitals */
131 int *mc, mcc; /* array and counter used for stability
132 check when perturbing */
133 int spike; /* are we spiking? */
134 int mind; /* the final distance between capitals that
136 int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
137 int diry[] = { 0, -1, -1, 0, 1, 1 };
139 int **own; /* owner of the sector. -1 means water */
140 int **elev; /* elevation of the sectors */
141 int **sectx, **secty; /* the sectors for each continent */
142 int **sectc; /* which sectors are on the coast? */
143 int *vector; /* used for measuring distances */
144 int *weight; /* used for placing mountains */
145 int *dsea, *dmoun; /* the dist to the ocean and mountain */
146 int the_file; /* the file we write everything to */
147 struct sctstr **sects;
148 struct sctstr *sectsbuf;
149 int fl_status; /* is anything wrong? */
150 #define STATUS_NO_ROOM (1) /* there was no room to grow */
151 #define NUMTRIES 10 /* keep trying to grow this many times */
153 const char *numletter =
154 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
156 static void parse_args(int argc, char *argv[]);
157 static int allocate_memory(void);
158 static void init(void);
159 static int drift(void);
160 static void grow_continents(void);
161 static void create_elevations(void);
162 static void write_sects(void);
163 static int write_file(void);
164 static void output(void);
165 static int write_newcap_script(void);
166 static int stable(void);
167 static void elevate_land(void);
168 static void elevate_sea(void);
169 static void translate_continents(void);
170 static int map_symbol(int x, int y);
171 static void fl_sct_init(coord x, coord y, s_char *ptr);
173 static void print_vars(void);
174 static void fl_move(int);
175 static void next_coast(int c, int x, int y, int *xp, int *yp);
176 static void grow_islands(void);
178 /****************************************************************************
180 ****************************************************************************/
183 main(int argc, char *argv[])
188 char *config_file = NULL;
193 while ((opt = getopt(argc, argv, "ae:ioqs:")) != EOF) {
199 DISTINCT_ISLANDS = 0;
202 config_file = optarg;
216 if (config_file == NULL) {
217 sprintf(tbuf, "%s/econfig", datadir);
220 emp_config(config_file);
223 parse_args(argc - optind, argv + optind);
225 parse_args(argc - 1, argv + 1);
227 if (allocate_memory() == -1)
234 printf("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
235 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
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");
255 qprint("writing to sectors file...\n");
256 if (write_file() == -1)
259 write_newcap_script();
261 printf("\t*** Resources have not been added ***\n");
270 puts("Creating a planet with:\n");
271 printf("%d continents\n", nc);
272 printf("continent size: %d\n", sc);
273 printf("number of islands: %d\n", ni);
274 printf("average size of islands: %d\n", is);
275 printf("spike: %d%%\n", sp);
276 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
277 pm, (pm * sc) / 100);
278 printf("minimum distance between continents: %d\n", di);
279 printf("minimum distance from islands to continents: %d\n", id);
280 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
288 for (i = 1; i * i < n * 10000; ++i) ;
289 return (i + 50) / 100;
292 /****************************************************************************
293 PARSE COMMAND LINE ARGUMENTS
294 ****************************************************************************/
297 parse_args(int argc, char *argv[])
299 if (argc < 2 || argc > 8) {
300 puts("fairland syntax:\n");
301 puts("fairland [-e config] [-aiqo] [-s script] <nc> <sc> [<ni>] [<is>] [<sp>] [<pm>] [<di>] [<id>]");
302 puts("-q = quiet, -o = no ore produced");
303 puts("-a = Airport marker for continents, -i = islands not distinct");
304 printf("-e = read config file, -s = name of script (default %s)\n",
306 puts("nc = number of continents [MANDATORY]");
307 puts("sc = continent size [MANDATORY]");
308 puts("ni = number of islands (default = nc)");
309 puts("is = average size of islands (default = sc/2)");
310 printf("sp = spike percentage: 0 = round, 100 = snake (default = %d)\n",
312 printf("pm = the percentage of land that is mountain (default = %d)\n",
314 printf("di = the minimum distance between continents (default = %d)\n",
316 printf("id = minimum distance from islands to continents (default = %d)\n",
322 puts("fairland: error -- number of continents must be > 0");
328 puts("fairland: error -- size of continents must be > 0");
356 pm = DEFAULT_MOUNTAIN;
363 di = DEFAULT_CONTDIST;
366 puts("fairland: error -- distance between continents must be >= 0");
369 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
370 puts("fairland: error -- distance between continents too large");
377 id = DEFAULT_ISLDIST;
379 puts("fairland: error -- distance from islands to continents must be >= 0");
382 if (id > WORLD_X || id > WORLD_Y) {
383 puts("fairland: error -- distance from islands to continents too large");
386 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
387 puts("fairland: error -- world not big enough to fit continents.");
388 puts("arguments must satisfy:");
389 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
394 /****************************************************************************
395 VARIABLE INITIALIZATION
396 ****************************************************************************/
399 allocate_memory(void)
406 open(empfile[EF_SECTOR].file, O_RDWR | O_CREAT | O_TRUNC, 0660);
409 open(empfile[EF_SECTOR].file,
410 O_RDWR | O_CREAT | O_TRUNC | O_BINARY, 0660);
413 perror(empfile[EF_SECTOR].file);
417 (struct sctstr *)calloc((YSIZE * XSIZE), sizeof(struct sctstr));
418 sects = (struct sctstr **)calloc(YSIZE, sizeof(struct sctstr *));
419 for (i = 0; i < YSIZE; i++)
420 sects[i] = §sbuf[XSIZE * i];
423 srandom(now + getpid());
427 capx = (int *)calloc(nc, sizeof(int));
428 capy = (int *)calloc(nc, sizeof(int));
429 vector = (int *)calloc(WORLD_X + WORLD_Y, sizeof(int));
430 mc = (int *)calloc(STABLE_CYCLE, sizeof(int));
431 own = (int **)calloc(WORLD_X, sizeof(int *));
432 elev = (int **)calloc(WORLD_X, sizeof(int *));
433 for (i = 0; i < WORLD_X; ++i) {
434 own[i] = (int *)calloc(WORLD_Y, sizeof(int));
435 elev[i] = (int *)calloc(WORLD_Y, sizeof(int));
437 sectx = (int **)calloc(nc + ni, sizeof(int *));
438 secty = (int **)calloc(nc + ni, sizeof(int *));
439 sectc = (int **)calloc(nc + ni, sizeof(int *));
440 isecs = (int *)calloc(nc + ni, sizeof(int));
441 weight = (int *)calloc(max(sc, is * 2), sizeof(int));
442 dsea = (int *)calloc(max(sc, is * 2), sizeof(int));
443 dmoun = (int *)calloc(max(sc, is * 2), sizeof(int));
444 for (i = 0; i < nc; ++i) {
445 sectx[i] = (int *)calloc(sc, sizeof(int));
446 secty[i] = (int *)calloc(sc, sizeof(int));
447 sectc[i] = (int *)calloc(sc, sizeof(int));
449 for (i = nc; i < nc + ni; ++i) {
450 sectx[i] = (int *)calloc(is * 2, sizeof(int));
451 secty[i] = (int *)calloc(is * 2, sizeof(int));
452 sectc[i] = (int *)calloc(is * 2, sizeof(int));
461 int i, j, xx = 0, yy = 0;
466 for (i = 0; i < WORLD_X; ++i) {
467 for (j = 0; j < WORLD_Y; ++j) {
469 elev[i][j] = -INFINITY;
473 for (i = 0; i < nc; ++i, xx += 2) {
478 puts("fairland error: world not big enough for all the continents.\n");
485 for (i = 0; i < STABLE_CYCLE; ++i)
489 /****************************************************************************
490 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
491 ****************************************************************************/
493 /* How isolated is capital j?
496 iso(int j, int newx, int newy)
498 int i, md, d = WORLD_X + WORLD_Y;
500 for (i = 0; i < nc; ++i) {
503 md = mapdist(capx[i], capy[i], newx, newy);
511 /* Drift all the capitals
518 for (turns = 0; turns < DRIFT_MAX; ++turns) {
519 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
521 for (i = 0; i < nc; ++i)
527 /* Check to see if we have stabilized--can we stop drifting the capitals?
533 int i, isod, d = 0, stab = 1;
535 for (i = 0; i < nc; ++i) {
536 isod = iso(i, capx[i], capy[i]);
540 for (i = 0; i < STABLE_CYCLE; ++i)
544 mcc = (mcc + 1) % STABLE_CYCLE;
548 /* This routine does the actual drifting
554 int i, n, newx, newy;
556 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
557 newx = new_x(capx[j] + dirx[i]);
558 newy = new_y(capy[j] + diry[i]);
559 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
567 /****************************************************************************
569 ****************************************************************************/
571 /* Look for a coastal sector of continent c
579 for (i = 0; i < secs; ++i) {
581 for (j = 0; j < 6; ++j)
582 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
587 /* Used for measuring distances
599 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
602 return i > 1 || vector[0] > 0;
605 /* Test to see if we're allowed to grow there: the arguments di and id
608 try_to_grow(int c, int newx, int newy, int d)
612 for (i = 1; i <= d; ++i) {
613 for (j = 0; j < i; ++j)
618 for (j = 0; j < i; ++j) {
619 px = new_x(px + dirx[vector[j]]);
620 py = new_y(py + diry[vector[j]]);
622 if (own[px][py] != -1 &&
624 (DISTINCT_ISLANDS || own[px][py] < nc))
626 } while (next_vector(i));
628 sectx[c][secs] = newx;
629 secty[c][secs] = newy;
634 /* Move along the coast in a clockwise direction.
638 next_coast(int c, int x, int y, int *xp, int *yp)
640 int i, nx, ny, wat = 0;
648 for (i = 0; i < 12; ++i) {
649 nx = new_x(x + dirx[i % 6]);
650 ny = new_y(y + diry[i % 6]);
651 if (own[nx][ny] == -1)
653 if (wat && own[nx][ny] == c) {
661 /* Choose a sector to grow from
673 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
678 } while (i != starti);
680 printf("fairland: BUG -- couldn't find coast for continent %c, sector %d.\nPlease mail stevens@math.utoronto.ca.\n",
689 /* Grow continent c by 1 sector
693 grow_one_sector(int c)
695 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
697 spike = rnd(100) < sp;
698 if ((try1 = new_try(c)) == -1)
700 x = sx = sectx[c][try1];
701 y = sy = secty[c][try1];
706 for (i = rnd(6), n = 0; n < 12 && !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 &&
711 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
712 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
713 if (try_to_grow(c, newx, newy, c < nc ? di : id))
717 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
718 newx = new_x(x + dirx[i]);
719 newy = new_y(y + diry[i]);
720 if (own[newx][newy] == -1)
721 if (try_to_grow(c, newx, newy, c < nc ? di : id))
724 next_coast(c, x, y, &x, &y);
726 } while (!done && coast_search < COAST_SEARCH_MAX &&
727 (secs == 1 || x != sx || y != sy));
728 if (!done && c < nc) {
730 printf("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 if (fl_status && !quiet)
760 printf("Only managed to grow %d out of %d sectors.\n", secs, sc);
764 /****************************************************************************
766 ****************************************************************************/
768 /* Choose a place to start growing an island from
771 place_island(int c, int *xp, int *yp)
774 int ssy = rnd(WORLD_Y);
775 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
777 if (ssx > WORLD_X - 2)
778 ssx = new_x(ssx + 2);
779 for (d = di + id; d >= id; --d) {
783 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
784 if (*xp >= WORLD_X) {
785 *yp = new_y(*yp + 1);
787 if (*xp == sx && *yp == sy)
790 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
797 /* Grow all the islands
805 for (c = nc; c < nc + ni; ++c) {
807 if (!place_island(c, &x, &y))
809 isiz = 1 + rnd(2 * is - 1);
813 } while (secs < isiz && grow_one_sector(c));
815 printf(" %d(%d)", c - nc + 1, secs);
821 /****************************************************************************
823 ****************************************************************************/
825 create_elevations(void)
831 /* Generic function for finding the distance to the closest sea, land, or
835 distance_to_what(int x, int y, int flag)
839 for (d = 1; d < 5; ++d) {
840 for (j = 0; j < d; ++j)
845 for (j = 0; j < d; ++j) {
846 px = new_x(px + dirx[vector[j]]);
847 py = new_y(py + diry[vector[j]]);
850 case 0: /* distance to sea */
851 if (own[px][py] == -1)
854 case 1: /* distance to land */
855 if (own[px][py] != -1)
858 case 2: /* distance to mountain */
859 if (elev[px][py] == INFINITY)
863 } while (next_vector(d));
868 #define ELEV elev[sectx[c][i]][secty[c][i]]
869 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
870 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
872 /* Decide where the mountains go
877 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
880 for (c = 0; c < ctot; ++c) {
882 ns = (c < nc) ? sc : isecs[c];
883 nm = (pm * ns) / 100;
885 /* Place the mountains */
887 for (i = 0; i < ns; ++i) {
888 dsea[i] = distance_to_sea();
889 weight[i] = (total += (dsea[i] * dsea[i]));
892 for (k = nm, mountain_search = 0;
893 k && mountain_search < MOUNTAIN_SEARCH_MAX;
896 for (i = 0; i < ns; ++i)
897 if (r < weight[i] && ELEV == -INFINITY &&
899 ((!(capx[c] == sectx[c][i] &&
900 capy[c] == secty[c][i])) &&
901 (!(new_x(capx[c] + 2) == sectx[c][i] &&
902 capy[c] == secty[c][i]))))) {
909 /* Elevate land that is not mountain and not capital */
911 for (i = 0; i < ns; ++i)
912 dmoun[i] = distance_to_mountain();
913 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
914 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
916 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
919 for (i = 0; i < ns; ++i) {
920 if (ELEV != INFINITY &&
921 (c >= nc || ((!(capx[c] == sectx[c][i] &&
922 capy[c] == secty[c][i])) &&
923 (!(new_x(capx[c] + 2) == sectx[c][i] &&
924 capy[c] == secty[c][i]))))) {
925 h = 3 * (5 - dmoun[i]) + dsea[i];
935 if (newk >= HILLMIN && newk < PLATMIN)
939 elev[sectx[c][where]][secty[c][where]] = newk;
940 dsea[where] = -INFINITY;
941 dmoun[where] = INFINITY;
944 /* Elevate the mountains and capitals */
946 for (i = 0; i < ns; ++i) {
947 if (ELEV == INFINITY) {
949 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
951 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
952 rnd((256 - HIGHMIN) / 2);
953 } else if ((c < nc &&
954 ((capx[c] == sectx[c][i] && capy[c] == secty[c][i]))) ||
955 ((new_x(capx[c] + 2) == sectx[c][i] &&
956 capy[c] == secty[c][i])))
962 #define distance_to_land() distance_to_what(x, y, 1)
969 for (y = 0; y < WORLD_Y; ++y) {
970 for (x = y % 2; x < WORLD_X; x += 2) {
971 if (elev[x][y] == -INFINITY)
972 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
977 /****************************************************************************
979 ****************************************************************************/
986 fert = LANDMIN - e + 40;
987 else if (e < FERT_MAX)
988 fert = (140 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
999 oil = (LANDMIN - e) * 2 + rnd(2);
1000 else if (e <= OIL_MAX)
1001 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1011 if (e >= IRON_MIN && e < HIGHMIN)
1012 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1022 if (e >= GOLD_MIN) {
1024 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1026 gold = 100 - 20 * HIGHMIN / e;
1037 if (e >= URAN_MIN && e < HIGHMIN)
1038 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1045 add_resources(struct sctstr *sct)
1047 sct->sct_fertil = set_fert(sct->sct_elev);
1048 sct->sct_oil = set_oil(sct->sct_elev);
1049 sct->sct_min = set_iron(sct->sct_elev);
1050 sct->sct_gmin = set_gold(sct->sct_elev);
1051 sct->sct_uran = set_uran(sct->sct_elev);
1054 /****************************************************************************
1055 DESIGNATE THE SECTORS
1056 ****************************************************************************/
1061 register struct sctstr *sct;
1064 /* sct = §s[0][0]; */
1066 for (y = 0; y < YSIZE; y++) {
1067 for (x = 0; x < XSIZE; x++, sct++) {
1068 fl_sct_init(x * 2 + (y & 01), y, (s_char *)sct);
1069 total = elev[sct->sct_x][y];
1070 if (total < LANDMIN) {
1071 sct->sct_type = SCT_WATER;
1072 } else if (total < HILLMIN)
1073 sct->sct_type = SCT_RURAL;
1074 else if (total < PLATMIN)
1075 sct->sct_type = SCT_MOUNT;
1076 else if (total < HIGHMIN)
1077 sct->sct_type = SCT_RURAL;
1079 sct->sct_type = SCT_MOUNT;
1080 sct->sct_elev = total;
1081 sct->sct_newtype = sct->sct_type;
1087 for (c = 0; c < nc; ++c) {
1088 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_type = SCT_AIRPT;
1089 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_newtype = SCT_AIRPT;
1093 /****************************************************************************
1094 WRITE ALL THIS STUFF TO THE FILE
1095 ****************************************************************************/
1101 /* if ((n = write(the_file, sects, sizeof(sects))) < 0) { */
1102 if ((n = write(the_file, sectsbuf, YSIZE * XSIZE * sizeof(struct sctstr))) < 0) {
1103 perror(empfile[EF_SECTOR].file);
1106 if (n != (int)(YSIZE * XSIZE * sizeof(struct sctstr))) {
1107 printf("%s:partial write\n", empfile[EF_SECTOR].file);
1114 /****************************************************************************
1115 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1116 ****************************************************************************/
1122 translate_continents();
1124 for (i = 0; i < WORLD_Y; ++i) {
1128 for (j = i % 2; j < WORLD_X; j += 2) {
1129 if (own[j][i] == -1)
1132 printf("%c ", map_symbol(j, i));
1138 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");
1141 /* Reorder the continents from top left to bottom right */
1143 translate_continents(void)
1145 int i, j, n = 0, k, gotit, c;
1146 int *trans, *trans_cont, *oldcapx, *oldcapy;
1148 trans = (int *)calloc(nc, sizeof(int));
1149 trans_cont = (int *)calloc(nc, sizeof(int));
1150 oldcapx = (int *)calloc(nc, sizeof(int));
1151 oldcapy = (int *)calloc(nc, sizeof(int));
1153 for (i = 0; i < WORLD_Y; ++i) {
1154 for (j = i % 2; j < WORLD_X; j += 2) {
1155 if (own[j][i] > -1 && own[j][i] < nc) {
1157 for (k = 0; k < n; ++k) {
1158 if (trans[k] == own[j][i])
1163 printf("fairland: BUG in translate continents! mail stevens@math.utoronto.ca\n");
1166 trans[n] = own[j][i];
1167 trans_cont[own[j][i]] = n;
1173 for (i = 0; i < WORLD_Y; ++i) {
1174 for (j = i % 2; j < WORLD_X; j += 2) {
1175 if (own[j][i] > -1 && own[j][i] < nc) {
1176 own[j][i] = trans_cont[own[j][i]];
1180 for (c = 0; c < nc; ++c) {
1181 oldcapx[c] = capx[c];
1182 oldcapy[c] = capy[c];
1184 for (c = 0; c < nc; ++c) {
1185 capx[c] = oldcapx[trans[c]];
1186 capy[c] = oldcapy[trans[c]];
1191 map_symbol(int x, int y)
1195 for (c = 0; c < nc; ++c)
1196 if ((x == capx[c] && y == capy[c])
1197 || (x == new_x(capx[c] + 2) && y == capy[c]))
1199 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1200 || elev[x][y] >= HIGHMIN)
1202 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1205 /***************************************************************************
1206 WRITE A SCRIPT FOR PLACING CAPITALS
1207 ****************************************************************************/
1209 write_newcap_script(void)
1212 FILE *script = fopen(outfile, "w");
1215 printf("fairland: error, unable to write to %s.\n", outfile);
1219 for (c = 0; c < nc; ++c) {
1220 fprintf(script, "add %d %d %d n i\n", c + 1, c + 1, c + 1);
1222 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1223 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1225 fprintf(script, "add %d visitor visitor v i\n", c + 1);
1229 printf("\n\nA script for adding all the countries can be found in \"%s\".\n",
1235 qprint(const char *str)
1242 fl_sct_init(coord x, coord y, s_char *ptr)
1244 struct sctstr *sp = (struct sctstr *)ptr;
1246 sp->ef_type = EF_SECTOR;
1253 sp->sct_defense = 0;