monop/monop.c

   1 /*      $NetBSD: monop.c,v 1.3 1995/03/23 08:34:52 cgd 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 #ifndef lint
  37 static char copyright[] =
  38 "@(#) 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 static char rcsid[] = "$NetBSD: monop.c,v 1.3 1995/03/23 08:34:52 cgd Exp $";
  47 #endif
  48 #endif /* not lint */
  49
  50 # include       "monop.def"
  51
  52 /*
  53  *      This program implements a monopoly game
  54  */
  55 main(ac, av)
  56 reg int         ac;
  57 reg char        *av[]; {
  58
  59
  60         srand(getpid());
  61         if (ac > 1) {
  62                 if (!rest_f(av[1]))
  63                         restore();
  64         }
  65         else {
  66                 getplayers();
  67                 init_players();
  68                 init_monops();
  69         }
  70         num_luck = sizeof lucky_mes / sizeof (char *);
  71         init_decks();
  72         signal(2, quit);
  73         for (;;) {
  74                 printf("\n%s (%d) (cash $%d) on %s\n", cur_p->name, player + 1,
  75                         cur_p->money, board[cur_p->loc].name);
  76                 printturn();
  77                 force_morg();
  78                 execute(getinp("-- Command: ", comlist));
  79         }
  80 }
  81 /*
  82  *      This routine gets the names of the players
  83  */
  84 getplayers() {
  85
  86         reg char        *sp;
  87         reg int         i, j;
  88         char            buf[257];
  89
  90 blew_it:
  91         for (;;) {
  92                 if ((num_play=get_int("How many players? ")) <= 0 ||
  93                     num_play > MAX_PL)
  94                         printf("Sorry. Number must range from 1 to 9\n");
  95                 else
  96                         break;
  97         }
  98         cur_p = play = (PLAY *) calloc(num_play, sizeof (PLAY));
  99         for (i = 0; i < num_play; i++) {
 100 over:
 101                 printf("Player %d's name: ", i + 1);
 102                 for (sp = buf; (*sp=getchar()) != '\n'; sp++)
 103                         continue;
 104                 if (sp == buf)
 105                         goto over;
 106                 *sp++ = '\0';
 107                 strcpy(name_list[i]=play[i].name=(char *)calloc(1,sp-buf),buf);
 108                 play[i].money = 1500;
 109         }
 110         name_list[i++] = "done";
 111         name_list[i] = 0;
 112         for (i = 0; i < num_play; i++)
 113                 for (j = i + 1; j < num_play; j++)
 114                         if (strcasecmp(name_list[i], name_list[j]) == 0) {
 115                                 if (i != num_play - 1)
 116                                         printf("Hey!!! Some of those are IDENTICAL!!  Let's try that again....\n");
 117                                 else
 118                                         printf("\"done\" is a reserved word.  Please try again\n");
 119                                 for (i = 0; i < num_play; i++)
 120                                         cfree(play[i].name);
 121                                 cfree(play);
 122                                 goto blew_it;
 123                         }
 124 }
 125 /*
 126  *      This routine figures out who goes first
 127  */
 128 init_players() {
 129
 130         reg int i, rl, cur_max;
 131         bool    over;
 132         int     max_pl;
 133
 134 again:
 135         putchar('\n');
 136         for (cur_max = i = 0; i < num_play; i++) {
 137                 printf("%s (%d) rolls %d\n", play[i].name, i+1, rl=roll(2, 6));
 138                 if (rl > cur_max) {
 139                         over = FALSE;
 140                         cur_max = rl;
 141                         max_pl = i;
 142                 }
 143                 else if (rl == cur_max)
 144                         over++;
 145         }
 146         if (over) {
 147                 printf("%d people rolled the same thing, so we'll try again\n",
 148                     over + 1);
 149                 goto again;
 150         }
 151         player = max_pl;
 152         cur_p = &play[max_pl];
 153         printf("%s (%d) goes first\n", cur_p->name, max_pl + 1);
 154 }
 155 /*
 156  *      This routine initalizes the monopoly structures.
 157  */
 158 init_monops() {
 159
 160         reg MON *mp;
 161         reg int i;
 162
 163         for (mp = mon; mp < &mon[N_MON]; mp++) {
 164                 mp->name = mp->not_m;
 165                 for (i = 0; i < mp->num_in; i++)
 166                         mp->sq[i] = &board[mp->sqnums[i]];
 167         }
 168 }