Home | History | Annotate | Line # | Download | only in wump
wump.c revision 1.3
      1  1.3  cgd /*	$NetBSD: wump.c,v 1.3 1995/04/22 08:19:51 cgd Exp $	*/
      2  1.3  cgd 
      3  1.1  cgd /*
      4  1.3  cgd  * Copyright (c) 1989, 1993
      5  1.3  cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  * All rights reserved.
      7  1.1  cgd  *
      8  1.1  cgd  * This code is derived from software contributed to Berkeley by
      9  1.1  cgd  * Dave Taylor, of Intuitive Systems.
     10  1.1  cgd  *
     11  1.1  cgd  * Redistribution and use in source and binary forms, with or without
     12  1.1  cgd  * modification, are permitted provided that the following conditions
     13  1.1  cgd  * are met:
     14  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     15  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     16  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     17  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     18  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     19  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     20  1.1  cgd  *    must display the following acknowledgement:
     21  1.1  cgd  *	This product includes software developed by the University of
     22  1.1  cgd  *	California, Berkeley and its contributors.
     23  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     24  1.1  cgd  *    may be used to endorse or promote products derived from this software
     25  1.1  cgd  *    without specific prior written permission.
     26  1.1  cgd  *
     27  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     28  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     29  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     30  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     31  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     32  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     33  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     34  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     35  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     36  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     37  1.1  cgd  * SUCH DAMAGE.
     38  1.1  cgd  */
     39  1.1  cgd 
     40  1.1  cgd #ifndef lint
     41  1.3  cgd static char copyright[] =
     42  1.3  cgd "@(#) Copyright (c) 1989, 1993\n\
     43  1.3  cgd 	The Regents of the University of California.  All rights reserved.\n";
     44  1.1  cgd #endif /* not lint */
     45  1.1  cgd 
     46  1.1  cgd #ifndef lint
     47  1.3  cgd #if 0
     48  1.3  cgd static char sccsid[] = "@(#)wump.c	8.1 (Berkeley) 5/31/93";
     49  1.3  cgd #else
     50  1.3  cgd static char rcsid[] = "$NetBSD: wump.c,v 1.3 1995/04/22 08:19:51 cgd Exp $";
     51  1.3  cgd #endif
     52  1.1  cgd #endif /* not lint */
     53  1.1  cgd 
     54  1.1  cgd /*
     55  1.1  cgd  * A very new version of the age old favorite Hunt-The-Wumpus game that has
     56  1.1  cgd  * been a part of the BSD distribution of Unix for longer than us old folk
     57  1.1  cgd  * would care to remember.
     58  1.1  cgd  */
     59  1.1  cgd 
     60  1.1  cgd #include <sys/types.h>
     61  1.1  cgd #include <sys/file.h>
     62  1.1  cgd #include <stdio.h>
     63  1.1  cgd #include "pathnames.h"
     64  1.1  cgd 
     65  1.1  cgd /* some defines to spec out what our wumpus cave should look like */
     66  1.1  cgd 
     67  1.1  cgd #define	MAX_ARROW_SHOT_DISTANCE	6		/* +1 for '0' stopper */
     68  1.1  cgd #define	MAX_LINKS_IN_ROOM	25		/* a complex cave */
     69  1.1  cgd 
     70  1.1  cgd #define	MAX_ROOMS_IN_CAVE	250
     71  1.1  cgd #define	ROOMS_IN_CAVE		20
     72  1.1  cgd #define	MIN_ROOMS_IN_CAVE	10
     73  1.1  cgd 
     74  1.1  cgd #define	LINKS_IN_ROOM		3
     75  1.1  cgd #define	NUMBER_OF_ARROWS	5
     76  1.1  cgd #define	PIT_COUNT		3
     77  1.1  cgd #define	BAT_COUNT		3
     78  1.1  cgd 
     79  1.1  cgd #define	EASY			1		/* levels of play */
     80  1.1  cgd #define	HARD			2
     81  1.1  cgd 
     82  1.1  cgd /* some macro definitions for cleaner output */
     83  1.1  cgd 
     84  1.1  cgd #define	plural(n)	(n == 1 ? "" : "s")
     85  1.1  cgd 
     86  1.1  cgd /* simple cave data structure; +1 so we can index from '1' not '0' */
     87  1.1  cgd struct room_record {
     88  1.1  cgd 	int tunnel[MAX_LINKS_IN_ROOM];
     89  1.1  cgd 	int has_a_pit, has_a_bat;
     90  1.1  cgd } cave[MAX_ROOMS_IN_CAVE+1];
     91  1.1  cgd 
     92  1.1  cgd /*
     93  1.1  cgd  * global variables so we can keep track of where the player is, how
     94  1.1  cgd  * many arrows they still have, where el wumpo is, and so on...
     95  1.1  cgd  */
     96  1.1  cgd int player_loc = -1;			/* player location */
     97  1.1  cgd int wumpus_loc = -1;			/* The Bad Guy location */
     98  1.1  cgd int level = EASY;			/* level of play */
     99  1.1  cgd int arrows_left;			/* arrows unshot */
    100  1.1  cgd 
    101  1.1  cgd #ifdef DEBUG
    102  1.1  cgd int debug = 0;
    103  1.1  cgd #endif
    104  1.1  cgd 
    105  1.1  cgd int pit_num = PIT_COUNT;		/* # pits in cave */
    106  1.1  cgd int bat_num = BAT_COUNT;		/* # bats */
    107  1.1  cgd int room_num = ROOMS_IN_CAVE;		/* # rooms in cave */
    108  1.1  cgd int link_num = LINKS_IN_ROOM;		/* links per room  */
    109  1.1  cgd int arrow_num = NUMBER_OF_ARROWS;	/* arrow inventory */
    110  1.1  cgd 
    111  1.1  cgd char answer[20];			/* user input */
    112  1.1  cgd 
    113  1.1  cgd main(argc, argv)
    114  1.1  cgd 	int argc;
    115  1.1  cgd 	char **argv;
    116  1.1  cgd {
    117  1.1  cgd 	extern char *optarg;
    118  1.1  cgd 	int c;
    119  1.1  cgd 
    120  1.1  cgd #ifdef DEBUG
    121  1.1  cgd 	while ((c = getopt(argc, argv, "a:b:hp:r:t:d")) != EOF)
    122  1.1  cgd #else
    123  1.1  cgd 	while ((c = getopt(argc, argv, "a:b:hp:r:t:")) != EOF)
    124  1.1  cgd #endif
    125  1.1  cgd 		switch (c) {
    126  1.1  cgd 		case 'a':
    127  1.1  cgd 			arrow_num = atoi(optarg);
    128  1.1  cgd 			break;
    129  1.1  cgd 		case 'b':
    130  1.1  cgd 			bat_num = atoi(optarg);
    131  1.1  cgd 			break;
    132  1.1  cgd #ifdef DEBUG
    133  1.1  cgd 		case 'd':
    134  1.1  cgd 			debug = 1;
    135  1.1  cgd 			break;
    136  1.1  cgd #endif
    137  1.1  cgd 		case 'h':
    138  1.1  cgd 			level = HARD;
    139  1.1  cgd 			break;
    140  1.1  cgd 		case 'p':
    141  1.1  cgd 			pit_num = atoi(optarg);
    142  1.1  cgd 			break;
    143  1.1  cgd 		case 'r':
    144  1.1  cgd 			room_num = atoi(optarg);
    145  1.1  cgd 			if (room_num < MIN_ROOMS_IN_CAVE) {
    146  1.1  cgd 				(void)fprintf(stderr,
    147  1.1  cgd 	"No self-respecting wumpus would live in such a small cave!\n");
    148  1.1  cgd 				exit(1);
    149  1.1  cgd 			}
    150  1.1  cgd 			if (room_num > MAX_ROOMS_IN_CAVE) {
    151  1.1  cgd 				(void)fprintf(stderr,
    152  1.1  cgd 	"Even wumpii can't furnish caves that large!\n");
    153  1.1  cgd 				exit(1);
    154  1.1  cgd 			}
    155  1.1  cgd 			break;
    156  1.1  cgd 		case 't':
    157  1.1  cgd 			link_num = atoi(optarg);
    158  1.1  cgd 			if (link_num < 2) {
    159  1.1  cgd 				(void)fprintf(stderr,
    160  1.1  cgd 	"Wumpii like extra doors in their caves!\n");
    161  1.1  cgd 				exit(1);
    162  1.1  cgd 			}
    163  1.1  cgd 			break;
    164  1.1  cgd 		case '?':
    165  1.1  cgd 		default:
    166  1.1  cgd 			usage();
    167  1.1  cgd 	}
    168  1.1  cgd 
    169  1.1  cgd 	if (link_num > MAX_LINKS_IN_ROOM ||
    170  1.1  cgd 	    link_num > room_num - (room_num / 4)) {
    171  1.1  cgd 		(void)fprintf(stderr,
    172  1.1  cgd "Too many tunnels!  The cave collapsed!\n(Fortunately, the wumpus escaped!)\n");
    173  1.1  cgd 		exit(1);
    174  1.1  cgd 	}
    175  1.1  cgd 
    176  1.1  cgd 	if (level == HARD) {
    177  1.1  cgd 		bat_num += ((random() % (room_num / 2)) + 1);
    178  1.1  cgd 		pit_num += ((random() % (room_num / 2)) + 1);
    179  1.1  cgd 	}
    180  1.1  cgd 
    181  1.1  cgd 	if (bat_num > room_num / 2) {
    182  1.1  cgd 		(void)fprintf(stderr,
    183  1.1  cgd "The wumpus refused to enter the cave, claiming it was too crowded!\n");
    184  1.1  cgd 		exit(1);
    185  1.1  cgd 	}
    186  1.1  cgd 
    187  1.1  cgd 	if (pit_num > room_num / 2) {
    188  1.1  cgd 		(void)fprintf(stderr,
    189  1.1  cgd "The wumpus refused to enter the cave, claiming it was too dangerous!\n");
    190  1.1  cgd 		exit(1);
    191  1.1  cgd 	}
    192  1.1  cgd 
    193  1.1  cgd 	instructions();
    194  1.1  cgd 	cave_init();
    195  1.1  cgd 
    196  1.1  cgd 	/* and we're OFF!  da dum, da dum, da dum, da dum... */
    197  1.1  cgd 	(void)printf(
    198  1.1  cgd "\nYou're in a cave with %d rooms and %d tunnels leading from each room.\n\
    199  1.1  cgd There are %d bat%s and %d pit%s scattered throughout the cave, and your\n\
    200  1.1  cgd quiver holds %d custom super anti-evil Wumpus arrows.  Good luck.\n",
    201  1.1  cgd 	    room_num, link_num, bat_num, plural(bat_num), pit_num,
    202  1.1  cgd 	    plural(pit_num), arrow_num);
    203  1.1  cgd 
    204  1.1  cgd 	for (;;) {
    205  1.1  cgd 		initialize_things_in_cave();
    206  1.1  cgd 		arrows_left = arrow_num;
    207  1.1  cgd 		do {
    208  1.1  cgd 			display_room_stats();
    209  1.1  cgd 			(void)printf("Move or shoot? (m-s) ");
    210  1.1  cgd 			(void)fflush(stdout);
    211  1.1  cgd 			if (!fgets(answer, sizeof(answer), stdin))
    212  1.1  cgd 				break;
    213  1.1  cgd 		} while (!take_action());
    214  1.1  cgd 
    215  1.1  cgd 		if (!getans("\nCare to play another game? (y-n) "))
    216  1.1  cgd 			exit(0);
    217  1.1  cgd 		if (getans("In the same cave? (y-n) "))
    218  1.1  cgd 			clear_things_in_cave();
    219  1.1  cgd 		else
    220  1.1  cgd 			cave_init();
    221  1.1  cgd 	}
    222  1.1  cgd 	/* NOTREACHED */
    223  1.1  cgd }
    224  1.1  cgd 
    225  1.1  cgd display_room_stats()
    226  1.1  cgd {
    227  1.1  cgd 	register int i;
    228  1.1  cgd 
    229  1.1  cgd 	/*
    230  1.1  cgd 	 * Routine will explain what's going on with the current room, as well
    231  1.1  cgd 	 * as describe whether there are pits, bats, & wumpii nearby.  It's
    232  1.1  cgd 	 * all pretty mindless, really.
    233  1.1  cgd 	 */
    234  1.1  cgd 	(void)printf(
    235  1.1  cgd "\nYou are in room %d of the cave, and have %d arrow%s left.\n",
    236  1.1  cgd 	    player_loc, arrows_left, plural(arrows_left));
    237  1.1  cgd 
    238  1.1  cgd 	if (bats_nearby())
    239  1.1  cgd 		(void)printf("*rustle* *rustle* (must be bats nearby)\n");
    240  1.1  cgd 	if (pit_nearby())
    241  1.1  cgd 		(void)printf("*whoosh* (I feel a draft from some pits).\n");
    242  1.1  cgd 	if (wump_nearby())
    243  1.1  cgd 		(void)printf("*sniff* (I can smell the evil Wumpus nearby!)\n");
    244  1.1  cgd 
    245  1.1  cgd 	(void)printf("There are tunnels to rooms %d, ",
    246  1.1  cgd 	   cave[player_loc].tunnel[0]);
    247  1.1  cgd 
    248  1.1  cgd 	for (i = 1; i < link_num - 1; i++)
    249  1.1  cgd 		if (cave[player_loc].tunnel[i] <= room_num)
    250  1.1  cgd 			(void)printf("%d, ", cave[player_loc].tunnel[i]);
    251  1.1  cgd 	(void)printf("and %d.\n", cave[player_loc].tunnel[link_num - 1]);
    252  1.1  cgd }
    253  1.1  cgd 
    254  1.1  cgd take_action()
    255  1.1  cgd {
    256  1.1  cgd 	/*
    257  1.1  cgd 	 * Do the action specified by the player, either 'm'ove, 's'hoot
    258  1.1  cgd 	 * or something exceptionally bizarre and strange!  Returns 1
    259  1.1  cgd 	 * iff the player died during this turn, otherwise returns 0.
    260  1.1  cgd 	 */
    261  1.1  cgd 	switch (*answer) {
    262  1.1  cgd 		case 'M':
    263  1.1  cgd 		case 'm':			/* move */
    264  1.1  cgd 			return(move_to(answer + 1));
    265  1.1  cgd 		case 'S':
    266  1.1  cgd 		case 's':			/* shoot */
    267  1.1  cgd 			return(shoot(answer + 1));
    268  1.1  cgd 		case 'Q':
    269  1.1  cgd 		case 'q':
    270  1.1  cgd 		case 'x':
    271  1.1  cgd 			exit(0);
    272  1.1  cgd 		case '\n':
    273  1.1  cgd 			return(0);
    274  1.1  cgd 		}
    275  1.1  cgd 	if (random() % 15 == 1)
    276  1.1  cgd 		(void)printf("Que pasa?\n");
    277  1.1  cgd 	else
    278  1.1  cgd 		(void)printf("I don't understand!\n");
    279  1.1  cgd 	return(0);
    280  1.1  cgd }
    281  1.1  cgd 
    282  1.1  cgd move_to(room_number)
    283  1.1  cgd 	char *room_number;
    284  1.1  cgd {
    285  1.1  cgd 	int i, just_moved_by_bats, next_room, tunnel_available;
    286  1.1  cgd 
    287  1.1  cgd 	/*
    288  1.1  cgd 	 * This is responsible for moving the player into another room in the
    289  1.1  cgd 	 * cave as per their directions.  If room_number is a null string,
    290  1.1  cgd 	 * then we'll prompt the user for the next room to go into.   Once
    291  1.1  cgd 	 * we've moved into the room, we'll check for things like bats, pits,
    292  1.1  cgd 	 * and so on.  This routine returns 1 if something occurs that kills
    293  1.1  cgd 	 * the player and 0 otherwise...
    294  1.1  cgd 	 */
    295  1.1  cgd 	tunnel_available = just_moved_by_bats = 0;
    296  1.1  cgd 	next_room = atoi(room_number);
    297  1.1  cgd 
    298  1.1  cgd 	/* crap for magic tunnels */
    299  1.1  cgd 	if (next_room == room_num + 1 &&
    300  1.1  cgd 	    cave[player_loc].tunnel[link_num-1] != next_room)
    301  1.1  cgd 		++next_room;
    302  1.1  cgd 
    303  1.1  cgd 	while (next_room < 1 || next_room > room_num + 1) {
    304  1.1  cgd 		if (next_room < 0 && next_room != -1)
    305  1.1  cgd (void)printf("Sorry, but we're constrained to a semi-Euclidean cave!\n");
    306  1.1  cgd 		if (next_room > room_num + 1)
    307  1.1  cgd (void)printf("What?  The cave surely isn't quite that big!\n");
    308  1.1  cgd 		if (next_room == room_num + 1 &&
    309  1.1  cgd 		    cave[player_loc].tunnel[link_num-1] != next_room) {
    310  1.1  cgd 			(void)printf("What?  The cave isn't that big!\n");
    311  1.1  cgd 			++next_room;
    312  1.1  cgd 		}
    313  1.1  cgd 		(void)printf("To which room do you wish to move? ");
    314  1.1  cgd 		(void)fflush(stdout);
    315  1.1  cgd 		if (!fgets(answer, sizeof(answer), stdin))
    316  1.1  cgd 			return(1);
    317  1.1  cgd 		next_room = atoi(answer);
    318  1.1  cgd 	}
    319  1.1  cgd 
    320  1.1  cgd 	/* now let's see if we can move to that room or not */
    321  1.1  cgd 	tunnel_available = 0;
    322  1.1  cgd 	for (i = 0; i < link_num; i++)
    323  1.1  cgd 		if (cave[player_loc].tunnel[i] == next_room)
    324  1.1  cgd 			tunnel_available = 1;
    325  1.1  cgd 
    326  1.1  cgd 	if (!tunnel_available) {
    327  1.1  cgd 		(void)printf("*Oof!*  (You hit the wall)\n");
    328  1.1  cgd 		if (random() % 6 == 1) {
    329  1.1  cgd (void)printf("Your colorful comments awaken the wumpus!\n");
    330  1.1  cgd 			move_wump();
    331  1.1  cgd 			if (wumpus_loc == player_loc) {
    332  1.1  cgd 				wump_kill();
    333  1.1  cgd 				return(1);
    334  1.1  cgd 			}
    335  1.1  cgd 		}
    336  1.1  cgd 		return(0);
    337  1.1  cgd 	}
    338  1.1  cgd 
    339  1.1  cgd 	/* now let's move into that room and check it out for dangers */
    340  1.1  cgd 	if (next_room == room_num + 1)
    341  1.1  cgd 		jump(next_room = (random() % room_num) + 1);
    342  1.1  cgd 
    343  1.1  cgd 	player_loc = next_room;
    344  1.1  cgd 	for (;;) {
    345  1.1  cgd 		if (next_room == wumpus_loc) {		/* uh oh... */
    346  1.1  cgd 			wump_kill();
    347  1.1  cgd 			return(1);
    348  1.1  cgd 		}
    349  1.1  cgd 		if (cave[next_room].has_a_pit)
    350  1.1  cgd 			if (random() % 12 < 2) {
    351  1.1  cgd 				pit_survive();
    352  1.1  cgd 				return(0);
    353  1.1  cgd 			} else {
    354  1.1  cgd 				pit_kill();
    355  1.1  cgd 				return(1);
    356  1.1  cgd 			}
    357  1.1  cgd 
    358  1.1  cgd 		if (cave[next_room].has_a_bat) {
    359  1.1  cgd 			(void)printf(
    360  1.1  cgd "*flap*  *flap*  *flap*  (humongous bats pick you up and move you%s!)\n",
    361  1.1  cgd 			    just_moved_by_bats ? " again": "");
    362  1.1  cgd 			next_room = player_loc = (random() % room_num) + 1;
    363  1.1  cgd 			just_moved_by_bats = 1;
    364  1.1  cgd 		}
    365  1.1  cgd 
    366  1.1  cgd 		else
    367  1.1  cgd 			break;
    368  1.1  cgd 	}
    369  1.1  cgd 	return(0);
    370  1.1  cgd }
    371  1.1  cgd 
    372  1.1  cgd shoot(room_list)
    373  1.1  cgd 	char *room_list;
    374  1.1  cgd {
    375  1.1  cgd 	int chance, next, roomcnt;
    376  1.1  cgd 	int j, arrow_location, link, ok;
    377  1.1  cgd 	char *p, *strtok();
    378  1.1  cgd 
    379  1.1  cgd 	/*
    380  1.1  cgd 	 * Implement shooting arrows.  Arrows are shot by the player indicating
    381  1.1  cgd 	 * a space-separated list of rooms that the arrow should pass through;
    382  1.1  cgd 	 * if any of the rooms they specify are not accessible via tunnel from
    383  1.1  cgd 	 * the room the arrow is in, it will instead fly randomly into another
    384  1.1  cgd 	 * room.  If the player hits the wumpus, this routine will indicate
    385  1.1  cgd 	 * such.  If it misses, this routine will *move* the wumpus one room.
    386  1.1  cgd 	 * If it's the last arrow, the player then dies...  Returns 1 if the
    387  1.1  cgd 	 * player has won or died, 0 if nothing has happened.
    388  1.1  cgd 	 */
    389  1.1  cgd 	arrow_location = player_loc;
    390  1.1  cgd 	for (roomcnt = 1;; ++roomcnt, room_list = NULL) {
    391  1.1  cgd 		if (!(p = strtok(room_list, " \t\n")))
    392  1.1  cgd 			if (roomcnt == 1) {
    393  1.1  cgd 				(void)printf(
    394  1.1  cgd 			"The arrow falls to the ground at your feet!\n");
    395  1.1  cgd 				return(0);
    396  1.1  cgd 			} else
    397  1.1  cgd 				break;
    398  1.1  cgd 		if (roomcnt > 5) {
    399  1.1  cgd 			(void)printf(
    400  1.1  cgd "The arrow wavers in its flight and and can go no further!\n");
    401  1.1  cgd 			break;
    402  1.1  cgd 		}
    403  1.1  cgd 		next = atoi(p);
    404  1.1  cgd 		for (j = 0, ok = 0; j < link_num; j++)
    405  1.1  cgd 			if (cave[arrow_location].tunnel[j] == next)
    406  1.1  cgd 				ok = 1;
    407  1.1  cgd 
    408  1.1  cgd 		if (ok) {
    409  1.1  cgd 			if (next > room_num) {
    410  1.1  cgd 				(void)printf(
    411  1.1  cgd "A faint gleam tells you the arrow has gone through a magic tunnel!\n");
    412  1.1  cgd 				arrow_location = (random() % room_num) + 1;
    413  1.1  cgd 			} else
    414  1.1  cgd 				arrow_location = next;
    415  1.1  cgd 		} else {
    416  1.1  cgd 			link = (random() % link_num);
    417  1.1  cgd 			if (link == player_loc)
    418  1.1  cgd 				(void)printf(
    419  1.1  cgd "*thunk*  The arrow can't find a way from %d to %d and flys back into\n\
    420  1.1  cgd your room!\n",
    421  1.1  cgd 				    arrow_location, next);
    422  1.1  cgd 			else if (cave[arrow_location].tunnel[link] > room_num)
    423  1.1  cgd 				(void)printf(
    424  1.1  cgd "*thunk*  The arrow flys randomly into a magic tunnel, thence into\n\
    425  1.1  cgd room %d!\n",
    426  1.1  cgd 				    cave[arrow_location].tunnel[link]);
    427  1.1  cgd 			else
    428  1.1  cgd 				(void)printf(
    429  1.1  cgd "*thunk*  The arrow can't find a way from %d to %d and flys randomly\n\
    430  1.1  cgd into room %d!\n",
    431  1.1  cgd 				    arrow_location, next,
    432  1.1  cgd 				    cave[arrow_location].tunnel[link]);
    433  1.1  cgd 			arrow_location = cave[arrow_location].tunnel[link];
    434  1.1  cgd 			break;
    435  1.1  cgd 		}
    436  1.1  cgd 		chance = random() % 10;
    437  1.1  cgd 		if (roomcnt == 3 && chance < 2) {
    438  1.1  cgd 			(void)printf(
    439  1.1  cgd "Your bowstring breaks!  *twaaaaaang*\n\
    440  1.1  cgd The arrow is weakly shot and can go no further!\n");
    441  1.1  cgd 			break;
    442  1.1  cgd 		} else if (roomcnt == 4 && chance < 6) {
    443  1.1  cgd 			(void)printf(
    444  1.1  cgd "The arrow wavers in its flight and and can go no further!\n");
    445  1.1  cgd 			break;
    446  1.1  cgd 		}
    447  1.1  cgd 	}
    448  1.1  cgd 
    449  1.1  cgd 	/*
    450  1.1  cgd 	 * now we've gotten into the new room let us see if El Wumpo is
    451  1.1  cgd 	 * in the same room ... if so we've a HIT and the player WON!
    452  1.1  cgd 	 */
    453  1.1  cgd 	if (arrow_location == wumpus_loc) {
    454  1.1  cgd 		kill_wump();
    455  1.1  cgd 		return(1);
    456  1.1  cgd 	}
    457  1.1  cgd 
    458  1.1  cgd 	if (arrow_location == player_loc) {
    459  1.1  cgd 		shoot_self();
    460  1.1  cgd 		return(1);
    461  1.1  cgd 	}
    462  1.1  cgd 
    463  1.1  cgd 	if (!--arrows_left) {
    464  1.1  cgd 		no_arrows();
    465  1.1  cgd 		return(1);
    466  1.1  cgd 	}
    467  1.1  cgd 
    468  1.1  cgd 	{
    469  1.1  cgd 		/* each time you shoot, it's more likely the wumpus moves */
    470  1.1  cgd 		static int lastchance = 2;
    471  1.1  cgd 
    472  1.1  cgd 		if (random() % level == EASY ? 12 : 9 < (lastchance += 2)) {
    473  1.1  cgd 			move_wump();
    474  1.1  cgd 			if (wumpus_loc == player_loc)
    475  1.1  cgd 				wump_kill();
    476  1.1  cgd 			lastchance = random() % 3;
    477  1.1  cgd 
    478  1.1  cgd 		}
    479  1.1  cgd 	}
    480  1.1  cgd 	return(0);
    481  1.1  cgd }
    482  1.1  cgd 
    483  1.1  cgd cave_init()
    484  1.1  cgd {
    485  1.1  cgd 	register int i, j, k, link;
    486  1.1  cgd 	int delta, int_compare();
    487  1.1  cgd 	time_t time();
    488  1.1  cgd 
    489  1.1  cgd 	/*
    490  1.1  cgd 	 * This does most of the interesting work in this program actually!
    491  1.1  cgd 	 * In this routine we'll initialize the Wumpus cave to have all rooms
    492  1.1  cgd 	 * linking to all others by stepping through our data structure once,
    493  1.1  cgd 	 * recording all forward links and backwards links too.  The parallel
    494  1.1  cgd 	 * "linkcount" data structure ensures that no room ends up with more
    495  1.1  cgd 	 * than three links, regardless of the quality of the random number
    496  1.1  cgd 	 * generator that we're using.
    497  1.1  cgd 	 */
    498  1.1  cgd 	srandom((int)time((time_t *)0));
    499  1.1  cgd 
    500  1.1  cgd 	/* initialize the cave first off. */
    501  1.1  cgd 	for (i = 1; i <= room_num; ++i)
    502  1.1  cgd 		for (j = 0; j < link_num ; ++j)
    503  1.1  cgd 			cave[i].tunnel[j] = -1;
    504  1.1  cgd 
    505  1.1  cgd 	/* choose a random 'hop' delta for our guaranteed link */
    506  1.1  cgd 	while (!(delta = random() % room_num));
    507  1.1  cgd 
    508  1.1  cgd 	for (i = 1; i <= room_num; ++i) {
    509  1.1  cgd 		link = ((i + delta) % room_num) + 1;	/* connection */
    510  1.1  cgd 		cave[i].tunnel[0] = link;		/* forw link */
    511  1.1  cgd 		cave[link].tunnel[1] = i;		/* back link */
    512  1.1  cgd 	}
    513  1.1  cgd 	/* now fill in the rest of the cave with random connections */
    514  1.1  cgd 	for (i = 1; i <= room_num; i++)
    515  1.1  cgd 		for (j = 2; j < link_num ; j++) {
    516  1.1  cgd 			if (cave[i].tunnel[j] != -1)
    517  1.1  cgd 				continue;
    518  1.1  cgd try_again:		link = (random() % room_num) + 1;
    519  1.1  cgd 			/* skip duplicates */
    520  1.1  cgd 			for (k = 0; k < j; k++)
    521  1.1  cgd 				if (cave[i].tunnel[k] == link)
    522  1.1  cgd 					goto try_again;
    523  1.1  cgd 			cave[i].tunnel[j] = link;
    524  1.1  cgd 			if (random() % 2 == 1)
    525  1.1  cgd 				continue;
    526  1.1  cgd 			for (k = 0; k < link_num; ++k) {
    527  1.1  cgd 				/* if duplicate, skip it */
    528  1.1  cgd 				if (cave[link].tunnel[k] == i)
    529  1.1  cgd 					k = link_num;
    530  1.1  cgd 
    531  1.1  cgd 				/* if open link, use it, force exit */
    532  1.1  cgd 				if (cave[link].tunnel[k] == -1) {
    533  1.1  cgd 					cave[link].tunnel[k] = i;
    534  1.1  cgd 					k = link_num;
    535  1.1  cgd 				}
    536  1.1  cgd 			}
    537  1.1  cgd 		}
    538  1.1  cgd 	/*
    539  1.1  cgd 	 * now that we're done, sort the tunnels in each of the rooms to
    540  1.1  cgd 	 * make it easier on the intrepid adventurer.
    541  1.1  cgd 	 */
    542  1.1  cgd 	for (i = 1; i <= room_num; ++i)
    543  1.1  cgd 		qsort(cave[i].tunnel, (u_int)link_num,
    544  1.1  cgd 		    sizeof(cave[i].tunnel[0]), int_compare);
    545  1.1  cgd 
    546  1.1  cgd #ifdef DEBUG
    547  1.1  cgd 	if (debug)
    548  1.1  cgd 		for (i = 1; i <= room_num; ++i) {
    549  1.1  cgd 			(void)printf("<room %d  has tunnels to ", i);
    550  1.1  cgd 			for (j = 0; j < link_num; ++j)
    551  1.1  cgd 				(void)printf("%d ", cave[i].tunnel[j]);
    552  1.1  cgd 			(void)printf(">\n");
    553  1.1  cgd 		}
    554  1.1  cgd #endif
    555  1.1  cgd }
    556  1.1  cgd 
    557  1.1  cgd clear_things_in_cave()
    558  1.1  cgd {
    559  1.1  cgd 	register int i;
    560  1.1  cgd 
    561  1.1  cgd 	/*
    562  1.1  cgd 	 * remove bats and pits from the current cave in preparation for us
    563  1.1  cgd 	 * adding new ones via the initialize_things_in_cave() routines.
    564  1.1  cgd 	 */
    565  1.1  cgd 	for (i = 1; i <= room_num; ++i)
    566  1.1  cgd 		cave[i].has_a_bat = cave[i].has_a_pit = 0;
    567  1.1  cgd }
    568  1.1  cgd 
    569  1.1  cgd initialize_things_in_cave()
    570  1.1  cgd {
    571  1.1  cgd 	register int i, loc;
    572  1.1  cgd 
    573  1.1  cgd 	/* place some bats, pits, the wumpus, and the player. */
    574  1.1  cgd 	for (i = 0; i < bat_num; ++i) {
    575  1.1  cgd 		do {
    576  1.1  cgd 			loc = (random() % room_num) + 1;
    577  1.1  cgd 		} while (cave[loc].has_a_bat);
    578  1.1  cgd 		cave[loc].has_a_bat = 1;
    579  1.1  cgd #ifdef DEBUG
    580  1.1  cgd 		if (debug)
    581  1.1  cgd 			(void)printf("<bat in room %d>\n", loc);
    582  1.1  cgd #endif
    583  1.1  cgd 	}
    584  1.1  cgd 
    585  1.1  cgd 	for (i = 0; i < pit_num; ++i) {
    586  1.1  cgd 		do {
    587  1.1  cgd 			loc = (random() % room_num) + 1;
    588  1.1  cgd 		} while (cave[loc].has_a_pit && cave[loc].has_a_bat);
    589  1.1  cgd 		cave[loc].has_a_pit = 1;
    590  1.1  cgd #ifdef DEBUG
    591  1.1  cgd 		if (debug)
    592  1.1  cgd 			(void)printf("<pit in room %d>\n", loc);
    593  1.1  cgd #endif
    594  1.1  cgd 	}
    595  1.1  cgd 
    596  1.1  cgd 	wumpus_loc = (random() % room_num) + 1;
    597  1.1  cgd #ifdef DEBUG
    598  1.1  cgd 	if (debug)
    599  1.1  cgd 		(void)printf("<wumpus in room %d>\n", loc);
    600  1.1  cgd #endif
    601  1.1  cgd 
    602  1.1  cgd 	do {
    603  1.1  cgd 		player_loc = (random() % room_num) + 1;
    604  1.1  cgd 	} while (player_loc == wumpus_loc || (level == HARD ?
    605  1.1  cgd 	    (link_num / room_num < 0.4 ? wump_nearby() : 0) : 0));
    606  1.1  cgd }
    607  1.1  cgd 
    608  1.1  cgd getans(prompt)
    609  1.1  cgd 	char *prompt;
    610  1.1  cgd {
    611  1.1  cgd 	char buf[20];
    612  1.1  cgd 
    613  1.1  cgd 	/*
    614  1.1  cgd 	 * simple routine to ask the yes/no question specified until the user
    615  1.1  cgd 	 * answers yes or no, then return 1 if they said 'yes' and 0 if they
    616  1.1  cgd 	 * answered 'no'.
    617  1.1  cgd 	 */
    618  1.1  cgd 	for (;;) {
    619  1.1  cgd 		(void)printf("%s", prompt);
    620  1.1  cgd 		(void)fflush(stdout);
    621  1.1  cgd 		if (!fgets(buf, sizeof(buf), stdin))
    622  1.1  cgd 			return(0);
    623  1.1  cgd 		if (*buf == 'N' || *buf == 'n')
    624  1.1  cgd 			return(0);
    625  1.1  cgd 		if (*buf == 'Y' || *buf == 'y')
    626  1.1  cgd 			return(1);
    627  1.1  cgd 		(void)printf(
    628  1.1  cgd "I don't understand your answer; please enter 'y' or 'n'!\n");
    629  1.1  cgd 	}
    630  1.1  cgd 	/* NOTREACHED */
    631  1.1  cgd }
    632  1.1  cgd 
    633  1.1  cgd bats_nearby()
    634  1.1  cgd {
    635  1.1  cgd 	register int i;
    636  1.1  cgd 
    637  1.1  cgd 	/* check for bats in the immediate vicinity */
    638  1.1  cgd 	for (i = 0; i < link_num; ++i)
    639  1.1  cgd 		if (cave[cave[player_loc].tunnel[i]].has_a_bat)
    640  1.1  cgd 			return(1);
    641  1.1  cgd 	return(0);
    642  1.1  cgd }
    643  1.1  cgd 
    644  1.1  cgd pit_nearby()
    645  1.1  cgd {
    646  1.1  cgd 	register int i;
    647  1.1  cgd 
    648  1.1  cgd 	/* check for pits in the immediate vicinity */
    649  1.1  cgd 	for (i = 0; i < link_num; ++i)
    650  1.1  cgd 		if (cave[cave[player_loc].tunnel[i]].has_a_pit)
    651  1.1  cgd 			return(1);
    652  1.1  cgd 	return(0);
    653  1.1  cgd }
    654  1.1  cgd 
    655  1.1  cgd wump_nearby()
    656  1.1  cgd {
    657  1.1  cgd 	register int i, j;
    658  1.1  cgd 
    659  1.1  cgd 	/* check for a wumpus within TWO caves of where we are */
    660  1.1  cgd 	for (i = 0; i < link_num; ++i) {
    661  1.1  cgd 		if (cave[player_loc].tunnel[i] == wumpus_loc)
    662  1.1  cgd 			return(1);
    663  1.1  cgd 		for (j = 0; j < link_num; ++j)
    664  1.1  cgd 			if (cave[cave[player_loc].tunnel[i]].tunnel[j] ==
    665  1.1  cgd 			    wumpus_loc)
    666  1.1  cgd 				return(1);
    667  1.1  cgd 	}
    668  1.1  cgd 	return(0);
    669  1.1  cgd }
    670  1.1  cgd 
    671  1.1  cgd move_wump()
    672  1.1  cgd {
    673  1.1  cgd 	wumpus_loc = cave[wumpus_loc].tunnel[random() % link_num];
    674  1.1  cgd }
    675  1.1  cgd 
    676  1.1  cgd int_compare(a, b)
    677  1.1  cgd 	int *a, *b;
    678  1.1  cgd {
    679  1.1  cgd 	return(*a < *b ? -1 : 1);
    680  1.1  cgd }
    681  1.1  cgd 
    682  1.1  cgd instructions()
    683  1.1  cgd {
    684  1.1  cgd 	char buf[120], *p, *getenv();
    685  1.1  cgd 
    686  1.1  cgd 	/*
    687  1.1  cgd 	 * read the instructions file, if needed, and show the user how to
    688  1.1  cgd 	 * play this game!
    689  1.1  cgd 	 */
    690  1.1  cgd 	if (!getans("Instructions? (y-n) "))
    691  1.1  cgd 		return;
    692  1.1  cgd 
    693  1.1  cgd 	if (access(_PATH_WUMPINFO, R_OK)) {
    694  1.1  cgd 		(void)printf(
    695  1.1  cgd "Sorry, but the instruction file seems to have disappeared in a\n\
    696  1.1  cgd puff of greasy black smoke! (poof)\n");
    697  1.1  cgd 		return;
    698  1.1  cgd 	}
    699  1.1  cgd 
    700  1.1  cgd 	if (!(p = getenv("PAGER")) ||
    701  1.1  cgd 	    strlen(p) > sizeof(buf) + strlen(_PATH_WUMPINFO) + 5)
    702  1.1  cgd 		p = _PATH_PAGER;
    703  1.1  cgd 
    704  1.1  cgd 	(void)sprintf(buf, "%s %s", p, _PATH_WUMPINFO);
    705  1.1  cgd 	(void)system(buf);
    706  1.1  cgd }
    707  1.1  cgd 
    708  1.1  cgd usage()
    709  1.1  cgd {
    710  1.1  cgd 	(void)fprintf(stderr,
    711  1.1  cgd "usage: wump [-h] [-a arrows] [-b bats] [-p pits] [-r rooms] [-t tunnels]\n");
    712  1.1  cgd 	exit(1);
    713  1.1  cgd }
    714  1.1  cgd 
    715  1.1  cgd /* messages */
    716  1.1  cgd 
    717  1.1  cgd wump_kill()
    718  1.1  cgd {
    719  1.1  cgd 	(void)printf(
    720  1.1  cgd "*ROAR* *chomp* *snurfle* *chomp*!\n\
    721  1.1  cgd Much to the delight of the Wumpus, you walked right into his mouth,\n\
    722  1.1  cgd making you one of the easiest dinners he's ever had!  For you, however,\n\
    723  1.1  cgd it's a rather unpleasant death.  The only good thing is that it's been\n\
    724  1.1  cgd so long since the evil Wumpus cleaned his teeth that you immediately\n\
    725  1.1  cgd passed out from the stench!\n");
    726  1.1  cgd }
    727  1.1  cgd 
    728  1.1  cgd kill_wump()
    729  1.1  cgd {
    730  1.1  cgd 	(void)printf(
    731  1.1  cgd "*thwock!* *groan* *crash*\n\n\
    732  1.1  cgd A horrible roar fills the cave, and you realize, with a smile, that you\n\
    733  1.1  cgd have slain the evil Wumpus and won the game!  You don't want to tarry for\n\
    734  1.1  cgd long, however, because not only is the Wumpus famous, but the stench of\n\
    735  1.1  cgd dead Wumpus is also quite well known, a stench plenty enough to slay the\n\
    736  1.1  cgd mightiest adventurer at a single whiff!!\n");
    737  1.1  cgd }
    738  1.1  cgd 
    739  1.1  cgd no_arrows()
    740  1.1  cgd {
    741  1.1  cgd 	(void)printf(
    742  1.1  cgd "\nYou turn and look at your quiver, and realize with a sinking feeling\n\
    743  1.1  cgd that you've just shot your last arrow (figuratively, too).  Sensing this\n\
    744  1.1  cgd with its psychic powers, the evil Wumpus rampagees through the cave, finds\n\
    745  1.1  cgd you, and with a mighty *ROAR* eats you alive!\n");
    746  1.1  cgd }
    747  1.1  cgd 
    748  1.1  cgd shoot_self()
    749  1.1  cgd {
    750  1.1  cgd 	(void)printf(
    751  1.1  cgd "\n*Thwack!*  A sudden piercing feeling informs you that the ricochet\n\
    752  1.1  cgd of your wild arrow has resulted in it wedging in your side, causing\n\
    753  1.1  cgd extreme agony.  The evil Wumpus, with its psychic powers, realizes this\n\
    754  1.1  cgd and immediately rushes to your side, not to help, alas, but to EAT YOU!\n\
    755  1.1  cgd (*CHOMP*)\n");
    756  1.1  cgd }
    757  1.1  cgd 
    758  1.1  cgd jump(where)
    759  1.1  cgd 	int where;
    760  1.1  cgd {
    761  1.1  cgd 	(void)printf(
    762  1.1  cgd "\nWith a jaunty step you enter the magic tunnel.  As you do, you\n\
    763  1.1  cgd notice that the walls are shimmering and glowing.  Suddenly you feel\n\
    764  1.1  cgd a very curious, warm sensation and find yourself in room %d!!\n", where);
    765  1.1  cgd }
    766  1.1  cgd 
    767  1.1  cgd pit_kill()
    768  1.1  cgd {
    769  1.1  cgd 	(void)printf(
    770  1.1  cgd "*AAAUUUUGGGGGHHHHHhhhhhhhhhh...*\n\
    771  1.1  cgd The whistling sound and updraft as you walked into this room of the\n\
    772  1.1  cgd cave apparently wasn't enough to clue you in to the presence of the\n\
    773  1.1  cgd bottomless pit.  You have a lot of time to reflect on this error as\n\
    774  1.1  cgd you fall many miles to the core of the earth.  Look on the bright side;\n\
    775  1.1  cgd you can at least find out if Jules Verne was right...\n");
    776  1.1  cgd }
    777  1.1  cgd 
    778  1.1  cgd pit_survive()
    779  1.1  cgd {
    780  1.1  cgd 	(void)printf(
    781  1.1  cgd "Without conscious thought you grab for the side of the cave and manage\n\
    782  1.1  cgd to grasp onto a rocky outcrop.  Beneath your feet stretches the limitless\n\
    783  1.1  cgd depths of a bottomless pit!  Rock crumbles beneath your feet!\n");
    784  1.1  cgd }
    785