home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
Club Amiga de Montreal - CAM
/
CAM_CD_1.iso
/
files
/
577a.lha
/
TownMaze_v1.1
/
src.lzh
/
usage.c
< prev
Wrap
C/C++ Source or Header
|
1991-08-04
|
2KB
|
47 lines
/*
** usage.c Copyright 1991 Kent Paul Dolan,
** Mountain View, CA, USA 94039-0755
**
** Written to satisfy an inquiry on USENet's rec.games.programmer newsgroup.
** May be freely used or modified in any non-commercial work. Copyrighted
** only to prevent patenting by someone else.
*/
#include <stdio.h>
#include "townmaze.h"
#include "townproto.h"
#ifdef __STDC__
void usage()
#else
int usage()
#endif
{
/*
** Sorry about the format here; beats breaking the lines in unnatural places.
*/
fprintf(stderr,"%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s%s",
"Usage: townmaze [-h #] [-w #] [-g #] [-l #] [-c #] [-u #] [-s #] [-r #]\n",
"Where: -h = height of maze in characters; minimum is 11, must be odd;\n",
" -w = width of maze in characters; minimum is 11, must be odd;\n",
" -g = gates in maze; how many streets start at city wall,\n",
" maximum is 2 * (height - 6)/7 + 2 (width - 6)/7;\n",
" lots of gates get rid of outer prominade;\n",
" -l = leave # gates openable; rest are made back into walls at\n",
" end of maze design processing, range is 0 to g;\n",
" -c = courts in maze; how many streets start inside the city;\n",
" maximum is (((height - 5)/6)*((width - 5)/6));\n",
" courts make more complex mazes at the expense of density;\n",
" -u = unused cells in maze; adds interesting shapes; maximum of\n",
" (((height-1)/14)*((width-1)/14)) is allowed, to preserve\n",
" connectivity of streets by leaving three cells between\n",
" unused cells so that streets can get past them;\n",
" -s = straightness of streets, range 0 to 998; straighter streets\n",
" make for more buildings, denser maze.\n",
" -r = force this random number routine seed to get the same maze\n",
" as the last time this seed was used.\n",
"There must be at least one gate or court; Copyright 1991,\n",
"Spaces between flags and values are mandatory!! Kent Paul Dolan.\n");
return;
}