* Copyright (c) 1980 Regents of the University of California.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
"@(#) Copyright (c) 1980 Regents of the University of California.\n\
static char sccsid
[] = "@(#)monop.c 5.7 (Berkeley) 6/1/90";
* This program implements a monopoly game
num_luck
= sizeof lucky_mes
/ sizeof (char *);
printf("\n%s (%d) (cash $%d) on %s\n", cur_p
->name
, player
+ 1,
cur_p
->money
, board
[cur_p
->loc
].name
);
execute(getinp("-- Command: ", comlist
));
* This routine gets the names of the players
if ((num_play
=get_int("How many players? ")) <= 0 ||
printf("Sorry. Number must range from 1 to 9\n");
cur_p
= play
= (PLAY
*) calloc(num_play
, sizeof (PLAY
));
for (i
= 0; i
< num_play
; i
++) {
printf("Player %d's name: ", i
+ 1);
for (sp
= buf
; (*sp
=getchar()) != '\n'; sp
++)
strcpy(name_list
[i
]=play
[i
].name
=(char *)calloc(1,sp
-buf
),buf
);
for (i
= 0; i
< num_play
; i
++)
for (j
= i
+ 1; j
< num_play
; j
++)
if (strcasecmp(name_list
[i
], name_list
[j
]) == 0) {
printf("Hey!!! Some of those are IDENTICAL!! Let's try that again....\n");
printf("\"done\" is a reserved word. Please try again\n");
for (i
= 0; i
< num_play
; i
++)
* This routine figures out who goes first
for (cur_max
= i
= 0; i
< num_play
; i
++) {
printf("%s (%d) rolls %d\n", play
[i
].name
, i
+1, rl
=roll(2, 6));
printf("%d people rolled the same thing, so we'll try again\n",
printf("%s (%d) goes first\n", cur_p
->name
, max_pl
+ 1);
* This routine initalizes the monopoly structures.
for (mp
= mon
; mp
< &mon
[N_MON
]; mp
++) {
for (i
= 0; i
< mp
->num_in
; i
++)
mp
->sq
[i
] = &board
[mp
->sqnums
[i
]];