1 /* $NetBSD: monop.c,v 1.12 2001/09/18 18:15:49 wiz 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.12 2001/09/18 18:15:49 wiz 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 /* Revoke setgid privileges */ 71 setgid(getgid()); 72 73 srand(getpid()); 74 if (ac > 1) { 75 if (!rest_f(av[1])) 76 restore(); 77 } 78 else { 79 getplayers(); 80 init_players(); 81 init_monops(); 82 } 83 num_luck = sizeof lucky_mes / sizeof (char *); 84 init_decks(); 85 signal(SIGINT, do_quit); 86 for (;;) { 87 printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1, 88 cur_p->money, board[cur_p->loc].name); 89 printturn(); 90 force_morg(); 91 execute(getinp("-- Command: ", comlist)); 92 } 93 } 94 95 /*ARGSUSED*/ 96 static void 97 do_quit(n) 98 int n __attribute__((__unused__)); 99 { 100 quit(); 101 } 102 103 /* 104 * This routine gets the names of the players 105 */ 106 static void 107 getplayers() 108 { 109 char *sp; 110 int i, j; 111 char buf[257]; 112 113 blew_it: 114 for (;;) { 115 if ((num_play=get_int("How many players? ")) <= 0 || 116 num_play > MAX_PL) 117 printf("Sorry. Number must range from 1 to 9\n"); 118 else 119 break; 120 } 121 cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY)); 122 if (play == NULL) 123 err(1, NULL); 124 for (i = 0; i < num_play; i++) { 125 over: 126 printf("Player %d's name: ", i + 1); 127 for (sp = buf; (*sp=getchar()) != '\n'; sp++) 128 continue; 129 if (sp == buf) 130 goto over; 131 *sp++ = '\0'; 132 name_list[i] = play[i].name = (char *)calloc(1, sp - buf); 133 if (name_list[i] == NULL) 134 err(1, NULL); 135 strcpy(play[i].name, buf); 136 play[i].money = 1500; 137 } 138 name_list[i++] = "done"; 139 name_list[i] = 0; 140 for (i = 0; i < num_play; i++) 141 for (j = i + 1; j < num_play; j++) 142 if (strcasecmp(name_list[i], name_list[j]) == 0) { 143 if (i != num_play - 1) 144 printf("Hey!!! Some of those are " 145 "IDENTICAL!! Let's try that " 146 "again....\n"); 147 else 148 printf("\"done\" is a reserved word. " 149 "Please try again\n"); 150 for (i = 0; i < num_play; i++) 151 free(play[i].name); 152 free(play); 153 goto blew_it; 154 } 155 } 156 157 /* 158 * This routine figures out who goes first 159 */ 160 static void 161 init_players() 162 { 163 int i, rl, cur_max; 164 bool over = 0; 165 int max_pl = 0; 166 167 again: 168 putchar('\n'); 169 for (cur_max = i = 0; i < num_play; i++) { 170 printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6)); 171 if (rl > cur_max) { 172 over = FALSE; 173 cur_max = rl; 174 max_pl = i; 175 } 176 else if (rl == cur_max) 177 over++; 178 } 179 if (over) { 180 printf("%d people rolled the same thing, so we'll try again\n", 181 over + 1); 182 goto again; 183 } 184 player = max_pl; 185 cur_p = &play[max_pl]; 186 printf("%s (%d) goes first\n", cur_p->name, max_pl + 1); 187 } 188 189 /* 190 * This routine initializes the monopoly structures. 191 */ 192 static void 193 init_monops() 194 { 195 MON *mp; 196 int i; 197 198 for (mp = mon; mp < &mon[N_MON]; mp++) { 199 mp->name = mp->not_m; 200 for (i = 0; i < mp->num_in; i++) 201 mp->sq[i] = &board[mp->sqnums[i]]; 202 } 203 } 204