Home | History | Annotate | Line # | Download | only in monop
cards.c revision 1.3
      1  1.3  cgd /*	$NetBSD: cards.c,v 1.3 1995/03/23 08:34:35 cgd Exp $	*/
      2  1.3  cgd 
      3  1.1  cgd /*
      4  1.3  cgd  * Copyright (c) 1980, 1993
      5  1.3  cgd  *	The Regents of the University of California.  All rights reserved.
      6  1.1  cgd  *
      7  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      8  1.1  cgd  * modification, are permitted provided that the following conditions
      9  1.1  cgd  * are met:
     10  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     12  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     13  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     14  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     15  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     16  1.1  cgd  *    must display the following acknowledgement:
     17  1.1  cgd  *	This product includes software developed by the University of
     18  1.1  cgd  *	California, Berkeley and its contributors.
     19  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     20  1.1  cgd  *    may be used to endorse or promote products derived from this software
     21  1.1  cgd  *    without specific prior written permission.
     22  1.1  cgd  *
     23  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  1.1  cgd  * SUCH DAMAGE.
     34  1.1  cgd  */
     35  1.1  cgd 
     36  1.1  cgd #ifndef lint
     37  1.3  cgd #if 0
     38  1.3  cgd static char sccsid[] = "@(#)cards.c	8.1 (Berkeley) 5/31/93";
     39  1.3  cgd #else
     40  1.3  cgd static char rcsid[] = "$NetBSD: cards.c,v 1.3 1995/03/23 08:34:35 cgd Exp $";
     41  1.3  cgd #endif
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.1  cgd # include	"monop.ext"
     45  1.1  cgd # include	"pathnames.h"
     46  1.1  cgd 
     47  1.1  cgd /*
     48  1.1  cgd  *	These routine deal with the card decks
     49  1.1  cgd  */
     50  1.1  cgd 
     51  1.1  cgd # define	GOJF	'F'	/* char for get-out-of-jail-free cards	*/
     52  1.1  cgd 
     53  1.1  cgd # ifndef DEV
     54  1.1  cgd static char	*cardfile	= _PATH_CARDS;
     55  1.1  cgd # else
     56  1.1  cgd static char	*cardfile	= "cards.pck";
     57  1.1  cgd # endif
     58  1.1  cgd 
     59  1.1  cgd static FILE	*deckf;
     60  1.1  cgd 
     61  1.1  cgd /*
     62  1.1  cgd  *	This routine initializes the decks from the data file,
     63  1.1  cgd  * which it opens.
     64  1.1  cgd  */
     65  1.1  cgd init_decks() {
     66  1.1  cgd 
     67  1.1  cgd 	if ((deckf=fopen(cardfile, "r")) == NULL) {
     68  1.1  cgd file_err:
     69  1.1  cgd 		perror(cardfile);
     70  1.1  cgd 		exit(1);
     71  1.1  cgd 	}
     72  1.1  cgd 	if (fread(deck, sizeof (DECK), 2, deckf) != 2)
     73  1.1  cgd 		goto file_err;
     74  1.1  cgd 	set_up(&CC_D);
     75  1.1  cgd 	set_up(&CH_D);
     76  1.1  cgd }
     77  1.1  cgd /*
     78  1.1  cgd  *	This routine sets up the offset pointers for the given deck.
     79  1.1  cgd  */
     80  1.1  cgd set_up(dp)
     81  1.1  cgd DECK	*dp; {
     82  1.1  cgd 
     83  1.1  cgd 	reg int	r1, r2;
     84  1.1  cgd 	int	i;
     85  1.1  cgd 
     86  1.1  cgd 	dp->offsets = (long *) calloc(sizeof (long), dp->num_cards);
     87  1.1  cgd 	if (fread(dp->offsets, sizeof(long), dp->num_cards, deckf) != dp->num_cards) {
     88  1.1  cgd 		perror(cardfile);
     89  1.1  cgd 		exit(1);
     90  1.1  cgd 	}
     91  1.1  cgd 	dp->last_card = 0;
     92  1.1  cgd 	dp->gojf_used = FALSE;
     93  1.1  cgd 	for (i = 0; i < dp->num_cards; i++) {
     94  1.1  cgd 		reg long	temp;
     95  1.1  cgd 
     96  1.1  cgd 		r1 = roll(1, dp->num_cards) - 1;
     97  1.1  cgd 		r2 = roll(1, dp->num_cards) - 1;
     98  1.1  cgd 		temp = dp->offsets[r2];
     99  1.1  cgd 		dp->offsets[r2] = dp->offsets[r1];
    100  1.1  cgd 		dp->offsets[r1] = temp;
    101  1.1  cgd 	}
    102  1.1  cgd }
    103  1.1  cgd /*
    104  1.1  cgd  *	This routine draws a card from the given deck
    105  1.1  cgd  */
    106  1.1  cgd get_card(dp)
    107  1.1  cgd DECK	*dp; {
    108  1.1  cgd 
    109  1.1  cgd 	reg char	type_maj, type_min;
    110  1.1  cgd 	reg int		num;
    111  1.1  cgd 	int		i, per_h, per_H, num_h, num_H;
    112  1.1  cgd 	OWN		*op;
    113  1.1  cgd 
    114  1.1  cgd 	do {
    115  1.1  cgd 		fseek(deckf, dp->offsets[dp->last_card], 0);
    116  1.1  cgd 		dp->last_card = ++(dp->last_card) % dp->num_cards;
    117  1.1  cgd 		type_maj = getc(deckf);
    118  1.1  cgd 	} while (dp->gojf_used && type_maj == GOJF);
    119  1.1  cgd 	type_min = getc(deckf);
    120  1.1  cgd 	num = getw(deckf);
    121  1.1  cgd 	printmes();
    122  1.1  cgd 	switch (type_maj) {
    123  1.1  cgd 	  case '+':		/* get money		*/
    124  1.1  cgd 		if (type_min == 'A') {
    125  1.1  cgd 			for (i = 0; i < num_play; i++)
    126  1.1  cgd 				if (i != player)
    127  1.1  cgd 					play[i].money -= num;
    128  1.1  cgd 			num = num * (num_play - 1);
    129  1.1  cgd 		}
    130  1.1  cgd 		cur_p->money += num;
    131  1.1  cgd 		break;
    132  1.1  cgd 	  case '-':		/* lose money		*/
    133  1.1  cgd 		if (type_min == 'A') {
    134  1.1  cgd 			for (i = 0; i < num_play; i++)
    135  1.1  cgd 				if (i != player)
    136  1.1  cgd 					play[i].money += num;
    137  1.1  cgd 			num = num * (num_play - 1);
    138  1.1  cgd 		}
    139  1.1  cgd 		cur_p->money -= num;
    140  1.1  cgd 		break;
    141  1.1  cgd 	  case 'M':		/* move somewhere	*/
    142  1.1  cgd 		switch (type_min) {
    143  1.1  cgd 		  case 'F':		/* move forward	*/
    144  1.1  cgd 			num -= cur_p->loc;
    145  1.1  cgd 			if (num < 0)
    146  1.1  cgd 				num += 40;
    147  1.1  cgd 			break;
    148  1.1  cgd 		  case 'J':		/* move to jail	*/
    149  1.1  cgd 			goto_jail();
    150  1.1  cgd 			return;
    151  1.1  cgd 		  case 'R':		/* move to railroad	*/
    152  1.1  cgd 			spec = TRUE;
    153  1.1  cgd 			num = (int)((cur_p->loc + 5)/10)*10 + 5 - cur_p->loc;
    154  1.1  cgd 			break;
    155  1.1  cgd 		  case 'U':		/* move to utility	*/
    156  1.1  cgd 			spec = TRUE;
    157  1.1  cgd 			if (cur_p->loc >= 12 && cur_p->loc < 28)
    158  1.1  cgd 				num = 28 - cur_p->loc;
    159  1.1  cgd 			else {
    160  1.1  cgd 				num = 12 - cur_p->loc;
    161  1.1  cgd 				if (num < 0)
    162  1.1  cgd 					num += 40;
    163  1.1  cgd 			}
    164  1.1  cgd 			break;
    165  1.1  cgd 		  case 'B':
    166  1.1  cgd 			num = -num;
    167  1.1  cgd 			break;
    168  1.1  cgd 		}
    169  1.1  cgd 		move(num);
    170  1.1  cgd 		break;
    171  1.1  cgd 	  case 'T':			/* tax			*/
    172  1.1  cgd 		if (dp == &CC_D) {
    173  1.1  cgd 			per_h = 40;
    174  1.1  cgd 			per_H = 115;
    175  1.1  cgd 		}
    176  1.1  cgd 		else {
    177  1.1  cgd 			per_h = 25;
    178  1.1  cgd 			per_H = 100;
    179  1.1  cgd 		}
    180  1.1  cgd 		num_h = num_H = 0;
    181  1.1  cgd 		for (op = cur_p->own_list; op; op = op->next)
    182  1.1  cgd 			if (op->sqr->type == PRPTY)
    183  1.1  cgd 				if (op->sqr->desc->houses == 5)
    184  1.1  cgd 					++num_H;
    185  1.1  cgd 				else
    186  1.1  cgd 					num_h += op->sqr->desc->houses;
    187  1.1  cgd 		num = per_h * num_h + per_H * num_H;
    188  1.1  cgd 		printf("You had %d Houses and %d Hotels, so that cost you $%d\n", num_h, num_H, num);
    189  1.1  cgd 		if (num == 0)
    190  1.1  cgd 			lucky("");
    191  1.1  cgd 		else
    192  1.1  cgd 			cur_p->money -= num;
    193  1.1  cgd 		break;
    194  1.1  cgd 	  case GOJF:		/* get-out-of-jail-free card	*/
    195  1.1  cgd 		cur_p->num_gojf++;
    196  1.1  cgd 		dp->gojf_used = TRUE;
    197  1.1  cgd 		break;
    198  1.1  cgd 	}
    199  1.1  cgd 	spec = FALSE;
    200  1.1  cgd }
    201  1.1  cgd /*
    202  1.1  cgd  *	This routine prints out the message on the card
    203  1.1  cgd  */
    204  1.1  cgd printmes() {
    205  1.1  cgd 
    206  1.1  cgd 	reg char	c;
    207  1.1  cgd 
    208  1.1  cgd 	printline();
    209  1.1  cgd 	fflush(stdout);
    210  1.1  cgd 	while ((c = getc(deckf)) != '\0')
    211  1.1  cgd 		putchar(c);
    212  1.1  cgd 	printline();
    213  1.1  cgd 	fflush(stdout);
    214  1.1  cgd }
    215