Home | History | Annotate | Line # | Download | only in monop
monop.c revision 1.6
      1  1.6    simonb /*	$NetBSD: monop.c,v 1.6 1999/08/21 10:40:03 simonb 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.4  christos #include <sys/cdefs.h>
     37  1.1       cgd #ifndef lint
     38  1.4  christos __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
     39  1.4  christos 	The Regents of the University of California.  All rights reserved.\n");
     40  1.1       cgd #endif /* not lint */
     41  1.1       cgd 
     42  1.1       cgd #ifndef lint
     43  1.3       cgd #if 0
     44  1.3       cgd static char sccsid[] = "@(#)monop.c	8.1 (Berkeley) 5/31/93";
     45  1.3       cgd #else
     46  1.6    simonb __RCSID("$NetBSD: monop.c,v 1.6 1999/08/21 10:40:03 simonb Exp $");
     47  1.3       cgd #endif
     48  1.1       cgd #endif /* not lint */
     49  1.1       cgd 
     50  1.4  christos #include <stdio.h>
     51  1.4  christos #include <signal.h>
     52  1.4  christos #include <stdlib.h>
     53  1.4  christos #include <unistd.h>
     54  1.4  christos #include "monop.def"
     55  1.4  christos 
     56  1.4  christos int main __P((int, char *[]));
     57  1.4  christos static void getplayers __P((void));
     58  1.4  christos static void init_players __P((void));
     59  1.4  christos static void init_monops __P((void));
     60  1.4  christos static void do_quit __P((int));
     61  1.1       cgd 
     62  1.1       cgd /*
     63  1.1       cgd  *	This program implements a monopoly game
     64  1.1       cgd  */
     65  1.4  christos int
     66  1.1       cgd main(ac, av)
     67  1.6    simonb 	int ac;
     68  1.6    simonb 	char *av[];
     69  1.6    simonb {
     70  1.1       cgd 	srand(getpid());
     71  1.1       cgd 	if (ac > 1) {
     72  1.1       cgd 		if (!rest_f(av[1]))
     73  1.1       cgd 			restore();
     74  1.1       cgd 	}
     75  1.1       cgd 	else {
     76  1.1       cgd 		getplayers();
     77  1.1       cgd 		init_players();
     78  1.1       cgd 		init_monops();
     79  1.1       cgd 	}
     80  1.1       cgd 	num_luck = sizeof lucky_mes / sizeof (char *);
     81  1.1       cgd 	init_decks();
     82  1.5   hubertf 	signal(SIGINT, do_quit);
     83  1.1       cgd 	for (;;) {
     84  1.1       cgd 		printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1,
     85  1.1       cgd 			cur_p->money, board[cur_p->loc].name);
     86  1.1       cgd 		printturn();
     87  1.1       cgd 		force_morg();
     88  1.1       cgd 		execute(getinp("-- Command: ", comlist));
     89  1.1       cgd 	}
     90  1.1       cgd }
     91  1.4  christos 
     92  1.4  christos /*ARGSUSED*/
     93  1.4  christos static void
     94  1.4  christos do_quit(n)
     95  1.4  christos 	int n;
     96  1.4  christos {
     97  1.4  christos 	quit();
     98  1.4  christos }
     99  1.6    simonb 
    100  1.1       cgd /*
    101  1.1       cgd  *	This routine gets the names of the players
    102  1.1       cgd  */
    103  1.4  christos static void
    104  1.4  christos getplayers()
    105  1.4  christos {
    106  1.6    simonb 	char *sp;
    107  1.6    simonb 	int i, j;
    108  1.6    simonb 	char buf[257];
    109  1.1       cgd 
    110  1.1       cgd blew_it:
    111  1.1       cgd 	for (;;) {
    112  1.1       cgd 		if ((num_play=get_int("How many players? ")) <= 0 ||
    113  1.1       cgd 		    num_play > MAX_PL)
    114  1.1       cgd 			printf("Sorry. Number must range from 1 to 9\n");
    115  1.1       cgd 		else
    116  1.1       cgd 			break;
    117  1.1       cgd 	}
    118  1.1       cgd 	cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY));
    119  1.1       cgd 	for (i = 0; i < num_play; i++) {
    120  1.1       cgd over:
    121  1.1       cgd 		printf("Player %d's name: ", i + 1);
    122  1.1       cgd 		for (sp = buf; (*sp=getchar()) != '\n'; sp++)
    123  1.1       cgd 			continue;
    124  1.1       cgd 		if (sp == buf)
    125  1.1       cgd 			goto over;
    126  1.1       cgd 		*sp++ = '\0';
    127  1.1       cgd 		strcpy(name_list[i]=play[i].name=(char *)calloc(1,sp-buf),buf);
    128  1.1       cgd 		play[i].money = 1500;
    129  1.1       cgd 	}
    130  1.1       cgd 	name_list[i++] = "done";
    131  1.1       cgd 	name_list[i] = 0;
    132  1.1       cgd 	for (i = 0; i < num_play; i++)
    133  1.1       cgd 		for (j = i + 1; j < num_play; j++)
    134  1.1       cgd 			if (strcasecmp(name_list[i], name_list[j]) == 0) {
    135  1.1       cgd 				if (i != num_play - 1)
    136  1.6    simonb 					printf("Hey!!! Some of those are "
    137  1.6    simonb 					    "IDENTICAL!!  Let's try that "
    138  1.6    simonb 					    "again....\n");
    139  1.1       cgd 				else
    140  1.6    simonb 					printf("\"done\" is a reserved word.  "
    141  1.6    simonb 					    "Please try again\n");
    142  1.1       cgd 				for (i = 0; i < num_play; i++)
    143  1.4  christos 					free(play[i].name);
    144  1.4  christos 				free(play);
    145  1.1       cgd 				goto blew_it;
    146  1.1       cgd 			}
    147  1.1       cgd }
    148  1.6    simonb 
    149  1.1       cgd /*
    150  1.1       cgd  *	This routine figures out who goes first
    151  1.1       cgd  */
    152  1.4  christos static void
    153  1.4  christos init_players()
    154  1.4  christos {
    155  1.6    simonb 	int i, rl, cur_max;
    156  1.6    simonb 	bool over = 0;
    157  1.6    simonb 	int max_pl = 0;
    158  1.1       cgd 
    159  1.1       cgd again:
    160  1.1       cgd 	putchar('\n');
    161  1.1       cgd 	for (cur_max = i = 0; i < num_play; i++) {
    162  1.1       cgd 		printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
    163  1.1       cgd 		if (rl > cur_max) {
    164  1.1       cgd 			over = FALSE;
    165  1.1       cgd 			cur_max = rl;
    166  1.1       cgd 			max_pl = i;
    167  1.1       cgd 		}
    168  1.1       cgd 		else if (rl == cur_max)
    169  1.1       cgd 			over++;
    170  1.1       cgd 	}
    171  1.1       cgd 	if (over) {
    172  1.1       cgd 		printf("%d people rolled the same thing, so we'll try again\n",
    173  1.1       cgd 		    over + 1);
    174  1.1       cgd 		goto again;
    175  1.1       cgd 	}
    176  1.1       cgd 	player = max_pl;
    177  1.1       cgd 	cur_p = &play[max_pl];
    178  1.1       cgd 	printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
    179  1.1       cgd }
    180  1.6    simonb 
    181  1.1       cgd /*
    182  1.1       cgd  *	This routine initalizes the monopoly structures.
    183  1.1       cgd  */
    184  1.4  christos static void
    185  1.4  christos init_monops()
    186  1.4  christos {
    187  1.6    simonb 	MON *mp;
    188  1.6    simonb 	int i;
    189  1.1       cgd 
    190  1.1       cgd 	for (mp = mon; mp < &mon[N_MON]; mp++) {
    191  1.1       cgd 		mp->name = mp->not_m;
    192  1.1       cgd 		for (i = 0; i < mp->num_in; i++)
    193  1.1       cgd 			mp->sq[i] = &board[mp->sqnums[i]];
    194  1.1       cgd 	}
    195  1.1       cgd }
    196