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)
130 #define SRANDOM srandom
133 #define RANDOM random
135 #define rnd(x) (RANDOM() % (x))
137 int secs; /* number of sectors grown */
138 int ctot; /* total number of continents and islands grown */
139 int *isecs; /* array of how large each island is */
141 int nc, sc, di, sp, pm, ni, is, id; /* the 8 arguments to this program */
142 unsigned long rnd_seed; /* optional seed can be passed as an argument */
143 int *capx, *capy; /* location of the nc capitals */
144 int *mc, mcc; /* array and counter used for stability
145 check when perturbing */
146 int spike; /* are we spiking? */
147 int mind; /* the final distance between capitals that
149 int dirx[] = { -2, -1, 1, 2, 1, -1 }; /* gyujnb */
150 int diry[] = { 0, -1, -1, 0, 1, 1 };
152 int **own; /* owner of the sector. -1 means water */
153 int **elev; /* elevation of the sectors */
154 int **sectx, **secty; /* the sectors for each continent */
155 int **sectc; /* which sectors are on the coast? */
156 int *vector; /* used for measuring distances */
157 int *weight; /* used for placing mountains */
158 int *dsea, *dmoun; /* the dist to the ocean and mountain */
159 int the_file; /* the file we write everything to */
160 struct sctstr **sects;
161 struct sctstr *sectsbuf;
162 int fl_status; /* is anything wrong? */
163 #define STATUS_NO_ROOM (1) /* there was no room to grow */
164 #define NUMTRIES 10 /* keep trying to grow this many times */
166 const char *numletter =
167 "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
169 static void parse_args(int argc, char *argv[]);
170 static int allocate_memory(void);
171 static void init(void);
172 static int drift(void);
173 static void grow_continents(void);
174 static void create_elevations(void);
175 static void write_sects(void);
176 static int write_file(void);
177 static void output(void);
178 static int write_newcap_script(void);
179 static int stable(void);
180 static void elevate_land(void);
181 static void elevate_sea(void);
182 static void translate_continents(void);
183 static int map_symbol(int x, int y);
184 static void fl_sct_init(coord x, coord y, s_char *ptr);
186 static void print_vars(void);
187 static void fl_move(int);
188 static void next_coast(int c, int x, int y, int *xp, int *yp);
189 static void grow_islands(void);
191 /****************************************************************************
193 ****************************************************************************/
196 main(int argc, char *argv[])
199 char *config_file = NULL;
203 rnd_seed = time(NULL);
205 rnd_seed += getpid();
208 while ((opt = getopt(argc, argv, "ae:ioqs:R:")) != EOF) {
214 DISTINCT_ISLANDS = 0;
217 config_file = optarg;
229 rnd_seed = strtoul(optarg, NULL, 10);
234 if (config_file == NULL) {
235 sprintf(tbuf, "%s/econfig", datadir);
238 emp_config(config_file);
240 parse_args(argc - optind, argv + optind);
241 if (allocate_memory() == -1)
248 qprint("\ntry #%d (out of %d)...", i + 1, NUMTRIES);
249 qprint("\n\n #*# ...fairland rips open a rift in the datumplane... #*#\n\n");
250 qprint("seed is %lu\n", rnd_seed);
251 qprint("placing capitals...\n");
253 qprint("fairland: unstable drift -- try increasisg DRIFT_MAX\n");
254 qprint("growing continents...\n");
256 } while (fl_status && ++i < NUMTRIES);
258 fputs("ERROR: World not large enough to hold continents\n",
262 qprint("growing islands:");
264 qprint("\nelevating land...\n");
266 qprint("designating sectors...\n");
268 qprint("adding resources...\n");
270 qprint("writing to sectors file...\n");
271 if (write_file() == -1)
274 write_newcap_script();
276 qprint("\t*** Resources have not been added ***\n");
285 puts("Creating a planet with:\n");
286 printf("%d continents\n", nc);
287 printf("continent size: %d\n", sc);
288 printf("number of islands: %d\n", ni);
289 printf("average size of islands: %d\n", is);
290 printf("spike: %d%%\n", sp);
291 printf("%d%% of land is mountain (each continent will have %d mountains)\n",
292 pm, (pm * sc) / 100);
293 printf("minimum distance between continents: %d\n", di);
294 printf("minimum distance from islands to continents: %d\n", id);
295 printf("World dimensions: %dx%d\n", WORLD_X, WORLD_Y);
303 for (i = 1; i * i < n * 10000; ++i) ;
304 return (i + 50) / 100;
307 /****************************************************************************
308 PARSE COMMAND LINE ARGUMENTS
309 ****************************************************************************/
312 parse_args(int argc, char *argv[])
314 if (argc < 2 || argc > 8) {
315 puts("fairland syntax:\n");
316 puts("fairland [-e config] [-aiqo] [-s script] [-R seed] <nc> <sc> [<ni>] [<is>] [<sp>] [<pm>] [<di>] [<id>]");
317 puts("-q = quiet, -o = no ore produced");
318 puts("-a = Airport marker for continents, -i = islands not distinct");
319 puts("-R = seed to use for random, -e = read config file");
320 printf("-s = name of script (default = %s)\n",
321 DEFAULT_OUTFILE_NAME);
322 puts("nc = number of continents [MANDATORY]");
323 puts("sc = continent size [MANDATORY]");
324 puts("ni = number of islands (default = nc)");
325 puts("is = average size of islands (default = sc/2)");
326 printf("sp = spike percentage: 0 = round, 100 = snake (default = %d)\n",
328 printf("pm = the percentage of land that is mountain (default = %d)\n",
330 printf("di = the minimum distance between continents (default = %d)\n",
332 printf("id = minimum distance from islands to continents (default = %d)\n",
338 puts("fairland: error -- number of continents must be > 0");
344 puts("fairland: error -- size of continents must be > 0");
372 pm = DEFAULT_MOUNTAIN;
379 di = DEFAULT_CONTDIST;
382 puts("fairland: error -- distance between continents must be >= 0");
385 if (di > WORLD_X / 2 || di > WORLD_Y / 2) {
386 puts("fairland: error -- distance between continents too large");
393 id = DEFAULT_ISLDIST;
395 puts("fairland: error -- distance from islands to continents must be >= 0");
398 if (id > WORLD_X || id > WORLD_Y) {
399 puts("fairland: error -- distance from islands to continents too large");
402 if (nc * sc + nc * my_sqrt(sc) * 2 * (di + 1) > WORLD_X * WORLD_Y) {
403 puts("fairland: error -- world not big enough to fit continents.");
404 puts("arguments must satisfy:");
405 puts("nc*sc*sc + nc*sqrt(sc)*2*(di+1) < WORLD_X * WORLD_Y");
410 /****************************************************************************
411 VARIABLE INITIALIZATION
412 ****************************************************************************/
415 allocate_memory(void)
421 open(empfile[EF_SECTOR].file, O_RDWR | O_CREAT | O_TRUNC, 0660);
424 open(empfile[EF_SECTOR].file,
425 O_RDWR | O_CREAT | O_TRUNC | O_BINARY, 0660);
428 perror(empfile[EF_SECTOR].file);
432 (struct sctstr *)calloc((YSIZE * XSIZE), sizeof(struct sctstr));
433 sects = (struct sctstr **)calloc(YSIZE, sizeof(struct sctstr *));
434 for (i = 0; i < YSIZE; i++)
435 sects[i] = §sbuf[XSIZE * i];
436 capx = (int *)calloc(nc, sizeof(int));
437 capy = (int *)calloc(nc, sizeof(int));
438 vector = (int *)calloc(WORLD_X + WORLD_Y, sizeof(int));
439 mc = (int *)calloc(STABLE_CYCLE, sizeof(int));
440 own = (int **)calloc(WORLD_X, sizeof(int *));
441 elev = (int **)calloc(WORLD_X, sizeof(int *));
442 for (i = 0; i < WORLD_X; ++i) {
443 own[i] = (int *)calloc(WORLD_Y, sizeof(int));
444 elev[i] = (int *)calloc(WORLD_Y, sizeof(int));
446 sectx = (int **)calloc(nc + ni, sizeof(int *));
447 secty = (int **)calloc(nc + ni, sizeof(int *));
448 sectc = (int **)calloc(nc + ni, sizeof(int *));
449 isecs = (int *)calloc(nc + ni, sizeof(int));
450 weight = (int *)calloc(max(sc, is * 2), sizeof(int));
451 dsea = (int *)calloc(max(sc, is * 2), sizeof(int));
452 dmoun = (int *)calloc(max(sc, is * 2), sizeof(int));
453 for (i = 0; i < nc; ++i) {
454 sectx[i] = (int *)calloc(sc, sizeof(int));
455 secty[i] = (int *)calloc(sc, sizeof(int));
456 sectc[i] = (int *)calloc(sc, sizeof(int));
458 for (i = nc; i < nc + ni; ++i) {
459 sectx[i] = (int *)calloc(is * 2, sizeof(int));
460 secty[i] = (int *)calloc(is * 2, sizeof(int));
461 sectc[i] = (int *)calloc(is * 2, sizeof(int));
470 int i, j, xx = 0, yy = 0;
475 for (i = 0; i < WORLD_X; ++i) {
476 for (j = 0; j < WORLD_Y; ++j) {
478 elev[i][j] = -INFINITY;
482 for (i = 0; i < nc; ++i, xx += 2) {
487 puts("fairland error: world not big enough for all the continents.\n");
494 for (i = 0; i < STABLE_CYCLE; ++i)
498 /****************************************************************************
499 DRIFT THE CAPITALS UNTIL THEY ARE AS FAR AWAY FROM EACH OTHER AS POSSIBLE
500 ****************************************************************************/
502 /* How isolated is capital j?
505 iso(int j, int newx, int newy)
507 int i, md, d = WORLD_X + WORLD_Y;
509 for (i = 0; i < nc; ++i) {
512 md = mapdist(capx[i], capy[i], newx, newy);
520 /* Drift all the capitals
527 for (turns = 0; turns < DRIFT_MAX; ++turns) {
528 if (turns > DRIFT_BEFORE_CHECK && (mind = stable()))
530 for (i = 0; i < nc; ++i)
536 /* Check to see if we have stabilized--can we stop drifting the capitals?
542 int i, isod, d = 0, stab = 1;
544 for (i = 0; i < nc; ++i) {
545 isod = iso(i, capx[i], capy[i]);
549 for (i = 0; i < STABLE_CYCLE; ++i)
553 mcc = (mcc + 1) % STABLE_CYCLE;
557 /* This routine does the actual drifting
563 int i, n, newx, newy;
565 for (i = rnd(6), n = 0; n < 6; i = (i + 1) % 6, ++n) {
566 newx = new_x(capx[j] + dirx[i]);
567 newy = new_y(capy[j] + diry[i]);
568 if (iso(j, newx, newy) >= iso(j, capx[j], capy[j])) {
576 /****************************************************************************
578 ****************************************************************************/
580 /* Look for a coastal sector of continent c
588 for (i = 0; i < secs; ++i) {
590 for (j = 0; j < 6; ++j)
591 if (own[new_x(sectx[c][i] + dirx[j])][new_y(secty[c][i] + diry[j])] == -1)
596 /* Used for measuring distances
608 for (i = 1; i < n && vector[i] == vector[i - 1]; ++i) ;
611 return i > 1 || vector[0] > 0;
614 /* Test to see if we're allowed to grow there: the arguments di and id
617 try_to_grow(int c, int newx, int newy, int d)
621 for (i = 1; i <= d; ++i) {
622 for (j = 0; j < i; ++j)
627 for (j = 0; j < i; ++j) {
628 px = new_x(px + dirx[vector[j]]);
629 py = new_y(py + diry[vector[j]]);
631 if (own[px][py] != -1 &&
633 (DISTINCT_ISLANDS || own[px][py] < nc))
635 } while (next_vector(i));
637 sectx[c][secs] = newx;
638 secty[c][secs] = newy;
643 /* Move along the coast in a clockwise direction.
647 next_coast(int c, int x, int y, int *xp, int *yp)
649 int i, nx, ny, wat = 0;
657 for (i = 0; i < 12; ++i) {
658 nx = new_x(x + dirx[i % 6]);
659 ny = new_y(y + diry[i % 6]);
660 if (own[nx][ny] == -1)
662 if (wat && own[nx][ny] == c) {
670 /* Choose a sector to grow from
682 i = starti = (spike && sectc[c][secs - 1]) ? secs - 1 : rnd(secs);
687 } while (i != starti);
689 printf("fairland: BUG -- couldn't find coast for continent %c, sector %d.\nPlease mail stevens@math.utoronto.ca.\n",
698 /* Grow continent c by 1 sector
702 grow_one_sector(int c)
704 int done, coast_search, try1, x, y, newx, newy, i, n, sx, sy;
706 spike = rnd(100) < sp;
707 if ((try1 = new_try(c)) == -1)
709 x = sx = sectx[c][try1];
710 y = sy = secty[c][try1];
715 for (i = rnd(6), n = 0; n < 12 && !done; i = (i + 1) % 6, ++n) {
716 newx = new_x(x + dirx[i]);
717 newy = new_y(y + diry[i]);
718 if (own[newx][newy] == -1 &&
720 (own[new_x(x+dirx[(i+5)%6])][new_y(y+diry[(i+5)%6])] == -1 &&
721 own[new_x(x+dirx[(i+1)%6])][new_y(y+diry[(i+1)%6])] == -1)))
722 if (try_to_grow(c, newx, newy, c < nc ? di : id))
726 for (i = rnd(6), n = 0; n < 6 && !done; i = (i + 1) % 6, ++n) {
727 newx = new_x(x + dirx[i]);
728 newy = new_y(y + diry[i]);
729 if (own[newx][newy] == -1)
730 if (try_to_grow(c, newx, newy, c < nc ? di : id))
733 next_coast(c, x, y, &x, &y);
735 } while (!done && coast_search < COAST_SEARCH_MAX &&
736 (secs == 1 || x != sx || y != sy));
737 if (!done && c < nc) {
738 qprint("fairland: error -- continent %c had no room to grow!\n",
740 fl_status |= STATUS_NO_ROOM;
745 /* Grow all the continents
748 grow_continents(void)
752 for (c = 0; c < nc; ++c) {
753 sectx[c][0] = capx[c];
754 secty[c][0] = capy[c];
755 own[sectx[c][0]][secty[c][0]] = c;
756 sectx[c][1] = new_x(capx[c] + 2);
757 secty[c][1] = capy[c];
758 own[sectx[c][1]][secty[c][1]] = c;
761 for (secs = 2; secs < sc && !fl_status; ++secs) {
762 for (c = 0; c < nc; ++c) {
768 qprint("Only managed to grow %d out of %d sectors.\n", secs, sc);
772 /****************************************************************************
774 ****************************************************************************/
776 /* Choose a place to start growing an island from
779 place_island(int c, int *xp, int *yp)
782 int ssy = rnd(WORLD_Y);
783 int ssx = new_x(rnd(WORLD_X / 2) * 2 + ssy % 2);
785 if (ssx > WORLD_X - 2)
786 ssx = new_x(ssx + 2);
787 for (d = di + id; d >= id; --d) {
791 for (*yp = sy; *xp != sx || *yp != sy; *xp += 2) {
792 if (*xp >= WORLD_X) {
793 *yp = new_y(*yp + 1);
795 if (*xp == sx && *yp == sy)
798 if (own[*xp][*yp] == -1 && try_to_grow(c, *xp, *yp, d))
805 /* Grow all the islands
813 for (c = nc; c < nc + ni; ++c) {
815 if (!place_island(c, &x, &y))
817 isiz = 1 + rnd(2 * is - 1);
821 } while (secs < isiz && grow_one_sector(c));
822 qprint(" %d(%d)", c - nc + 1, secs);
828 /****************************************************************************
830 ****************************************************************************/
832 create_elevations(void)
838 /* Generic function for finding the distance to the closest sea, land, or
842 distance_to_what(int x, int y, int flag)
846 for (d = 1; d < 5; ++d) {
847 for (j = 0; j < d; ++j)
852 for (j = 0; j < d; ++j) {
853 px = new_x(px + dirx[vector[j]]);
854 py = new_y(py + diry[vector[j]]);
857 case 0: /* distance to sea */
858 if (own[px][py] == -1)
861 case 1: /* distance to land */
862 if (own[px][py] != -1)
865 case 2: /* distance to mountain */
866 if (elev[px][py] == INFINITY)
870 } while (next_vector(d));
875 #define ELEV elev[sectx[c][i]][secty[c][i]]
876 #define distance_to_sea() (sectc[c][i]?1:distance_to_what(sectx[c][i], secty[c][i], 0))
877 #define distance_to_mountain() distance_to_what(sectx[c][i], secty[c][i], 2)
879 /* Decide where the mountains go
884 int i, mountain_search, k, c, total, ns, nm, highest, where, h, newk,
887 for (c = 0; c < ctot; ++c) {
889 ns = (c < nc) ? sc : isecs[c];
890 nm = (pm * ns) / 100;
892 /* Place the mountains */
894 for (i = 0; i < ns; ++i) {
895 dsea[i] = distance_to_sea();
896 weight[i] = (total += (dsea[i] * dsea[i]));
899 for (k = nm, mountain_search = 0;
900 k && mountain_search < MOUNTAIN_SEARCH_MAX;
903 for (i = 0; i < ns; ++i)
904 if (r < weight[i] && ELEV == -INFINITY &&
906 ((!(capx[c] == sectx[c][i] &&
907 capy[c] == secty[c][i])) &&
908 (!(new_x(capx[c] + 2) == sectx[c][i] &&
909 capy[c] == secty[c][i]))))) {
916 /* Elevate land that is not mountain and not capital */
918 for (i = 0; i < ns; ++i)
919 dmoun[i] = distance_to_mountain();
920 dk = (ns - nm - ((c < nc) ? 3 : 1) > 0) ?
921 (100 * (HIGHMIN - LANDMIN)) / (ns - nm - ((c < nc) ? 3 : 1)) :
923 for (k = 100 * (HIGHMIN - 1);; k -= dk) {
926 for (i = 0; i < ns; ++i) {
927 if (ELEV != INFINITY &&
928 (c >= nc || ((!(capx[c] == sectx[c][i] &&
929 capy[c] == secty[c][i])) &&
930 (!(new_x(capx[c] + 2) == sectx[c][i] &&
931 capy[c] == secty[c][i]))))) {
932 h = 3 * (5 - dmoun[i]) + dsea[i];
942 if (newk >= HILLMIN && newk < PLATMIN)
946 elev[sectx[c][where]][secty[c][where]] = newk;
947 dsea[where] = -INFINITY;
948 dmoun[where] = INFINITY;
951 /* Elevate the mountains and capitals */
953 for (i = 0; i < ns; ++i) {
954 if (ELEV == INFINITY) {
956 ELEV = HILLMIN + rnd(PLATMIN - HILLMIN);
958 ELEV = HIGHMIN + rnd((256 - HIGHMIN) / 2) +
959 rnd((256 - HIGHMIN) / 2);
960 } else if ((c < nc &&
961 ((capx[c] == sectx[c][i] && capy[c] == secty[c][i]))) ||
962 ((new_x(capx[c] + 2) == sectx[c][i] &&
963 capy[c] == secty[c][i])))
969 #define distance_to_land() distance_to_what(x, y, 1)
976 for (y = 0; y < WORLD_Y; ++y) {
977 for (x = y % 2; x < WORLD_X; x += 2) {
978 if (elev[x][y] == -INFINITY)
979 elev[x][y] = -rnd((distance_to_land() * 20 + 27)) - 1;
984 /****************************************************************************
986 ****************************************************************************/
993 fert = LANDMIN - e + 40;
994 else if (e < FERT_MAX)
995 fert = (140 * (FERT_MAX - e)) / (FERT_MAX - LANDMIN);
1006 oil = (LANDMIN - e) * 2 + rnd(2);
1007 else if (e <= OIL_MAX)
1008 oil = (120 * (OIL_MAX - e + 1)) / (OIL_MAX - LANDMIN + 1);
1018 if (e >= IRON_MIN && e < HIGHMIN)
1019 iron = (120 * (e - IRON_MIN + 1)) / (HIGHMIN - IRON_MIN);
1029 if (e >= GOLD_MIN) {
1031 gold = (80 * (e - GOLD_MIN + 1)) / (HIGHMIN - GOLD_MIN);
1033 gold = 100 - 20 * HIGHMIN / e;
1044 if (e >= URAN_MIN && e < HIGHMIN)
1045 uran = (120 * (e - URAN_MIN + 1)) / (HIGHMIN - URAN_MIN);
1052 add_resources(struct sctstr *sct)
1054 sct->sct_fertil = set_fert(sct->sct_elev);
1055 sct->sct_oil = set_oil(sct->sct_elev);
1056 sct->sct_min = set_iron(sct->sct_elev);
1057 sct->sct_gmin = set_gold(sct->sct_elev);
1058 sct->sct_uran = set_uran(sct->sct_elev);
1061 /****************************************************************************
1062 DESIGNATE THE SECTORS
1063 ****************************************************************************/
1071 /* sct = §s[0][0]; */
1073 for (y = 0; y < YSIZE; y++) {
1074 for (x = 0; x < XSIZE; x++, sct++) {
1075 fl_sct_init(x * 2 + (y & 01), y, (s_char *)sct);
1076 total = elev[sct->sct_x][y];
1077 if (total < LANDMIN) {
1078 sct->sct_type = SCT_WATER;
1079 } else if (total < HILLMIN)
1080 sct->sct_type = SCT_RURAL;
1081 else if (total < PLATMIN)
1082 sct->sct_type = SCT_MOUNT;
1083 else if (total < HIGHMIN)
1084 sct->sct_type = SCT_RURAL;
1086 sct->sct_type = SCT_MOUNT;
1087 sct->sct_elev = total;
1088 sct->sct_newtype = sct->sct_type;
1094 for (c = 0; c < nc; ++c) {
1095 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_type = SCT_AIRPT;
1096 sects[capy[c]][capx[c] / 2 + capy[c] % 2].sct_newtype = SCT_AIRPT;
1100 /****************************************************************************
1101 WRITE ALL THIS STUFF TO THE FILE
1102 ****************************************************************************/
1108 /* if ((n = write(the_file, sects, sizeof(sects))) < 0) { */
1109 if ((n = write(the_file, sectsbuf, YSIZE * XSIZE * sizeof(struct sctstr))) < 0) {
1110 perror(empfile[EF_SECTOR].file);
1113 if (n != (int)(YSIZE * XSIZE * sizeof(struct sctstr))) {
1114 printf("%s:partial write\n", empfile[EF_SECTOR].file);
1121 /****************************************************************************
1122 PRINT A PICTURE OF THE MAP TO YOUR SCREEN
1123 ****************************************************************************/
1129 translate_continents();
1131 for (i = 0; i < WORLD_Y; ++i) {
1135 for (j = i % 2; j < WORLD_X; j += 2) {
1136 if (own[j][i] == -1)
1139 printf("%c ", map_symbol(j, i));
1145 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");
1148 /* Reorder the continents from top left to bottom right */
1150 translate_continents(void)
1152 int i, j, n = 0, k, gotit, c;
1153 int *trans, *trans_cont, *oldcapx, *oldcapy;
1155 trans = (int *)calloc(nc, sizeof(int));
1156 trans_cont = (int *)calloc(nc, sizeof(int));
1157 oldcapx = (int *)calloc(nc, sizeof(int));
1158 oldcapy = (int *)calloc(nc, sizeof(int));
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) {
1164 for (k = 0; k < n; ++k) {
1165 if (trans[k] == own[j][i])
1170 printf("fairland: BUG in translate continents! mail stevens@math.utoronto.ca\n");
1173 trans[n] = own[j][i];
1174 trans_cont[own[j][i]] = n;
1180 for (i = 0; i < WORLD_Y; ++i) {
1181 for (j = i % 2; j < WORLD_X; j += 2) {
1182 if (own[j][i] > -1 && own[j][i] < nc) {
1183 own[j][i] = trans_cont[own[j][i]];
1187 for (c = 0; c < nc; ++c) {
1188 oldcapx[c] = capx[c];
1189 oldcapy[c] = capy[c];
1191 for (c = 0; c < nc; ++c) {
1192 capx[c] = oldcapx[trans[c]];
1193 capy[c] = oldcapy[trans[c]];
1198 map_symbol(int x, int y)
1202 for (c = 0; c < nc; ++c)
1203 if ((x == capx[c] && y == capy[c])
1204 || (x == new_x(capx[c] + 2) && y == capy[c]))
1206 if ((elev[x][y] >= HILLMIN && elev[x][y] < PLATMIN)
1207 || elev[x][y] >= HIGHMIN)
1209 return own[x][y] >= nc ? '%' : iscap ? '#' : numletter[own[x][y] % 62];
1212 /***************************************************************************
1213 WRITE A SCRIPT FOR PLACING CAPITALS
1214 ****************************************************************************/
1216 write_newcap_script(void)
1219 FILE *script = fopen(outfile, "w");
1222 printf("fairland: error, unable to write to %s.\n", outfile);
1226 for (c = 0; c < nc; ++c) {
1227 fprintf(script, "add %d %d %d n i\n", c + 1, c + 1, c + 1);
1229 fprintf(script, "des %d,%d -\n", capx[c], capy[c]);
1230 fprintf(script, "newcap %d %d,%d\n", c + 1, capx[c], capy[c]);
1232 fprintf(script, "add %d visitor visitor v i\n", c + 1);
1235 qprint("\n\nA script for adding all the countries can be found in \"%s\".\n",
1241 qprint(const char * const fmt, ...)
1247 vfprintf(stdout, fmt, ap);
1253 fl_sct_init(coord x, coord y, s_char *ptr)
1255 struct sctstr *sp = (struct sctstr *)ptr;
1257 sp->ef_type = EF_SECTOR;
1264 sp->sct_defense = 0;