monop/monop.c

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