* This routine deals with buying property, setting all the
add_list(player
, &(play
[player
].own_list
), cur_p
->loc
);
* This routine adds an item to the list.
add_list(plr
, head
, op_sqr
)
op
= calloc(1, sizeof (OWN
));
op
->sqr
= &board
[op_sqr
];
for (tp
= *head
; tp
&& value(tp
->sqr
) < val
; tp
= tp
->next
)
if (val
== value(tp
->sqr
)) {
* This routine deletes property from the list.
del_list(plr
, head
, op_sqr
)
switch (board
[op_sqr
].type
) {
board
[op_sqr
].desc
->mon_desc
->num_own
--;
for (op
= *head
; op
; op
= op
->next
)
if (op
->sqr
== &board
[op_sqr
])
last_op
->next
= op
->next
;
* This routine calculates the value for sorting of the
return 8 + (PROP
*)(sqp
->desc
) - prop
;
* This routine accepts bids for the current peice
reg
int i
, num_in
, cur_max
;
printf("\nSo it goes up for auction. Type your bid after your name\n");
for (i
= 0; i
< num_play
; i
++)
while (num_in
> 1 || (cur_max
== 0 && num_in
> 0)) {
sprintf(buf
, "%s: ", name_list
[i
]);
else if (cur_bid
<= cur_max
) {
printf("You must bid higher than %d to stay in\n", cur_max
);
printf("(bid of 0 drops you out)\n");
} while (cur_bid
!= 0 && cur_bid
<= cur_max
);
cur_max
= (cur_bid
? cur_bid
: cur_max
);
printf("It goes to %s (%d) for $%d\n",play
[i
].name
,i
+1,cur_max
);
buy(i
, &board
[cur_p
->loc
]);
play
[i
].money
-= cur_max
;
printf("Nobody seems to want it, so we'll leave it for later\n");
* This routine calculates the value of the property
for (op
= plp
->own_list
; op
; op
= op
->next
) {
if (op
->sqr
->type
== PRPTY
&& op
->sqr
->desc
->monop
)
worth
+= op
->sqr
->desc
->mon_desc
->h_cost
* 50 *