Home | History | Annotate | Line # | Download | only in monop
monop.c revision 1.6
      1 /*	$NetBSD: monop.c,v 1.6 1999/08/21 10:40:03 simonb Exp $	*/
      2 
      3 /*
      4  * Copyright (c) 1980, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  */
     35 
     36 #include <sys/cdefs.h>
     37 #ifndef lint
     38 __COPYRIGHT("@(#) Copyright (c) 1980, 1993\n\
     39 	The Regents of the University of California.  All rights reserved.\n");
     40 #endif /* not lint */
     41 
     42 #ifndef lint
     43 #if 0
     44 static char sccsid[] = "@(#)monop.c	8.1 (Berkeley) 5/31/93";
     45 #else
     46 __RCSID("$NetBSD: monop.c,v 1.6 1999/08/21 10:40:03 simonb Exp $");
     47 #endif
     48 #endif /* not lint */
     49 
     50 #include <stdio.h>
     51 #include <signal.h>
     52 #include <stdlib.h>
     53 #include <unistd.h>
     54 #include "monop.def"
     55 
     56 int main __P((int, char *[]));
     57 static void getplayers __P((void));
     58 static void init_players __P((void));
     59 static void init_monops __P((void));
     60 static void do_quit __P((int));
     61 
     62 /*
     63  *	This program implements a monopoly game
     64  */
     65 int
     66 main(ac, av)
     67 	int ac;
     68 	char *av[];
     69 {
     70 	srand(getpid());
     71 	if (ac > 1) {
     72 		if (!rest_f(av[1]))
     73 			restore();
     74 	}
     75 	else {
     76 		getplayers();
     77 		init_players();
     78 		init_monops();
     79 	}
     80 	num_luck = sizeof lucky_mes / sizeof (char *);
     81 	init_decks();
     82 	signal(SIGINT, do_quit);
     83 	for (;;) {
     84 		printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1,
     85 			cur_p->money, board[cur_p->loc].name);
     86 		printturn();
     87 		force_morg();
     88 		execute(getinp("-- Command: ", comlist));
     89 	}
     90 }
     91 
     92 /*ARGSUSED*/
     93 static void
     94 do_quit(n)
     95 	int n;
     96 {
     97 	quit();
     98 }
     99 
    100 /*
    101  *	This routine gets the names of the players
    102  */
    103 static void
    104 getplayers()
    105 {
    106 	char *sp;
    107 	int i, j;
    108 	char buf[257];
    109 
    110 blew_it:
    111 	for (;;) {
    112 		if ((num_play=get_int("How many players? ")) <= 0 ||
    113 		    num_play > MAX_PL)
    114 			printf("Sorry. Number must range from 1 to 9\n");
    115 		else
    116 			break;
    117 	}
    118 	cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY));
    119 	for (i = 0; i < num_play; i++) {
    120 over:
    121 		printf("Player %d's name: ", i + 1);
    122 		for (sp = buf; (*sp=getchar()) != '\n'; sp++)
    123 			continue;
    124 		if (sp == buf)
    125 			goto over;
    126 		*sp++ = '\0';
    127 		strcpy(name_list[i]=play[i].name=(char *)calloc(1,sp-buf),buf);
    128 		play[i].money = 1500;
    129 	}
    130 	name_list[i++] = "done";
    131 	name_list[i] = 0;
    132 	for (i = 0; i < num_play; i++)
    133 		for (j = i + 1; j < num_play; j++)
    134 			if (strcasecmp(name_list[i], name_list[j]) == 0) {
    135 				if (i != num_play - 1)
    136 					printf("Hey!!! Some of those are "
    137 					    "IDENTICAL!!  Let's try that "
    138 					    "again....\n");
    139 				else
    140 					printf("\"done\" is a reserved word.  "
    141 					    "Please try again\n");
    142 				for (i = 0; i < num_play; i++)
    143 					free(play[i].name);
    144 				free(play);
    145 				goto blew_it;
    146 			}
    147 }
    148 
    149 /*
    150  *	This routine figures out who goes first
    151  */
    152 static void
    153 init_players()
    154 {
    155 	int i, rl, cur_max;
    156 	bool over = 0;
    157 	int max_pl = 0;
    158 
    159 again:
    160 	putchar('\n');
    161 	for (cur_max = i = 0; i < num_play; i++) {
    162 		printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
    163 		if (rl > cur_max) {
    164 			over = FALSE;
    165 			cur_max = rl;
    166 			max_pl = i;
    167 		}
    168 		else if (rl == cur_max)
    169 			over++;
    170 	}
    171 	if (over) {
    172 		printf("%d people rolled the same thing, so we'll try again\n",
    173 		    over + 1);
    174 		goto again;
    175 	}
    176 	player = max_pl;
    177 	cur_p = &play[max_pl];
    178 	printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
    179 }
    180 
    181 /*
    182  *	This routine initalizes the monopoly structures.
    183  */
    184 static void
    185 init_monops()
    186 {
    187 	MON *mp;
    188 	int i;
    189 
    190 	for (mp = mon; mp < &mon[N_MON]; mp++) {
    191 		mp->name = mp->not_m;
    192 		for (i = 0; i < mp->num_in; i++)
    193 			mp->sq[i] = &board[mp->sqnums[i]];
    194 	}
    195 }
    196