trade.c revision 1.4 1 1.4 christos /* $NetBSD: trade.c,v 1.4 1997/10/12 17:45:27 christos Exp $ */
2 1.3 cgd
3 1.1 cgd /*
4 1.3 cgd * Copyright (c) 1980, 1993
5 1.3 cgd * The Regents of the University of California. All rights reserved.
6 1.1 cgd *
7 1.1 cgd * Redistribution and use in source and binary forms, with or without
8 1.1 cgd * modification, are permitted provided that the following conditions
9 1.1 cgd * are met:
10 1.1 cgd * 1. Redistributions of source code must retain the above copyright
11 1.1 cgd * notice, this list of conditions and the following disclaimer.
12 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 cgd * notice, this list of conditions and the following disclaimer in the
14 1.1 cgd * documentation and/or other materials provided with the distribution.
15 1.1 cgd * 3. All advertising materials mentioning features or use of this software
16 1.1 cgd * must display the following acknowledgement:
17 1.1 cgd * This product includes software developed by the University of
18 1.1 cgd * California, Berkeley and its contributors.
19 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
20 1.1 cgd * may be used to endorse or promote products derived from this software
21 1.1 cgd * without specific prior written permission.
22 1.1 cgd *
23 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 cgd * SUCH DAMAGE.
34 1.1 cgd */
35 1.1 cgd
36 1.4 christos #include <sys/cdefs.h>
37 1.1 cgd #ifndef lint
38 1.3 cgd #if 0
39 1.3 cgd static char sccsid[] = "@(#)trade.c 8.1 (Berkeley) 5/31/93";
40 1.3 cgd #else
41 1.4 christos __RCSID("$NetBSD: trade.c,v 1.4 1997/10/12 17:45:27 christos Exp $");
42 1.3 cgd #endif
43 1.1 cgd #endif /* not lint */
44 1.1 cgd
45 1.4 christos #include "monop.ext"
46 1.1 cgd
47 1.1 cgd struct trd_st { /* how much to give to other player */
48 1.1 cgd int trader; /* trader number */
49 1.1 cgd int cash; /* amount of cash */
50 1.1 cgd int gojf; /* # get-out-of-jail-free cards */
51 1.1 cgd OWN *prop_list; /* property list */
52 1.1 cgd };
53 1.1 cgd
54 1.1 cgd typedef struct trd_st TRADE;
55 1.1 cgd
56 1.4 christos static char *plist[MAX_PRP+2];
57 1.1 cgd
58 1.1 cgd static int used[MAX_PRP];
59 1.1 cgd
60 1.1 cgd static TRADE trades[2];
61 1.1 cgd
62 1.4 christos static void get_list __P((int, int ));
63 1.4 christos static int set_list __P((OWN *));
64 1.4 christos static void summate __P((void));
65 1.4 christos static void do_trade __P((void));
66 1.4 christos static void move_em __P((TRADE *, TRADE *));
67 1.4 christos
68 1.4 christos void
69 1.4 christos trade()
70 1.4 christos {
71 1.1 cgd
72 1.4 christos int tradee, i;
73 1.1 cgd
74 1.1 cgd trading = TRUE;
75 1.1 cgd for (i = 0; i < 2; i++) {
76 1.1 cgd trades[i].cash = 0;
77 1.1 cgd trades[i].gojf = FALSE;
78 1.1 cgd trades[i].prop_list = NULL;
79 1.1 cgd }
80 1.1 cgd over:
81 1.1 cgd if (num_play == 1) {
82 1.1 cgd printf("There ain't no-one around to trade WITH!!\n");
83 1.1 cgd return;
84 1.1 cgd }
85 1.1 cgd if (num_play > 2) {
86 1.1 cgd tradee = getinp("Which player do you wish to trade with? ",
87 1.1 cgd name_list);
88 1.1 cgd if (tradee == num_play)
89 1.1 cgd return;
90 1.1 cgd if (tradee == player) {
91 1.1 cgd printf("You can't trade with yourself!\n");
92 1.1 cgd goto over;
93 1.1 cgd }
94 1.1 cgd }
95 1.1 cgd else
96 1.1 cgd tradee = 1 - player;
97 1.1 cgd get_list(0, player);
98 1.1 cgd get_list(1, tradee);
99 1.1 cgd if (getyn("Do you wish a summary? ") == 0)
100 1.1 cgd summate();
101 1.1 cgd if (getyn("Is the trade ok? ") == 0)
102 1.1 cgd do_trade();
103 1.1 cgd }
104 1.1 cgd /*
105 1.1 cgd * This routine gets the list of things to be trader for the
106 1.1 cgd * player, and puts in the structure given.
107 1.1 cgd */
108 1.4 christos static void
109 1.1 cgd get_list(struct_no, play_no)
110 1.4 christos int struct_no, play_no;
111 1.4 christos {
112 1.1 cgd
113 1.4 christos int sn, pn;
114 1.4 christos PLAY *pp;
115 1.1 cgd int numin, prop, num_prp;
116 1.1 cgd OWN *op;
117 1.1 cgd TRADE *tp;
118 1.1 cgd
119 1.1 cgd for (numin = 0; numin < MAX_PRP; numin++)
120 1.1 cgd used[numin] = FALSE;
121 1.1 cgd sn = struct_no, pn = play_no;
122 1.1 cgd pp = &play[pn];
123 1.1 cgd tp = &trades[sn];
124 1.1 cgd tp->trader = pn;
125 1.1 cgd printf("player %s (%d):\n", pp->name, pn+1);
126 1.1 cgd if (pp->own_list) {
127 1.1 cgd numin = set_list(pp->own_list);
128 1.1 cgd for (num_prp = numin; num_prp; ) {
129 1.1 cgd prop = getinp("Which property do you wish to trade? ",
130 1.4 christos plist);
131 1.1 cgd if (prop == numin)
132 1.1 cgd break;
133 1.1 cgd else if (used[prop])
134 1.1 cgd printf("You've already allocated that.\n");
135 1.1 cgd else {
136 1.1 cgd num_prp--;
137 1.1 cgd used[prop] = TRUE;
138 1.1 cgd for (op = pp->own_list; prop--; op = op->next)
139 1.1 cgd continue;
140 1.1 cgd add_list(pn, &(tp->prop_list), sqnum(op->sqr));
141 1.1 cgd }
142 1.1 cgd }
143 1.1 cgd }
144 1.1 cgd if (pp->money > 0) {
145 1.1 cgd printf("You have $%d. ", pp->money);
146 1.1 cgd tp->cash = get_int("How much are you trading? ");
147 1.1 cgd }
148 1.1 cgd if (pp->num_gojf > 0) {
149 1.1 cgd once_more:
150 1.1 cgd printf("You have %d get-out-of-jail-free cards. ",pp->num_gojf);
151 1.1 cgd tp->gojf = get_int("How many are you trading? ");
152 1.1 cgd if (tp->gojf > pp->num_gojf) {
153 1.1 cgd printf("You don't have that many. Try again.\n");
154 1.1 cgd goto once_more;
155 1.1 cgd }
156 1.1 cgd }
157 1.1 cgd }
158 1.1 cgd /*
159 1.1 cgd * This routine sets up the list of tradable property.
160 1.1 cgd */
161 1.4 christos static int
162 1.1 cgd set_list(the_list)
163 1.4 christos OWN *the_list;
164 1.4 christos {
165 1.1 cgd
166 1.4 christos int i;
167 1.4 christos OWN *op;
168 1.1 cgd
169 1.1 cgd i = 0;
170 1.1 cgd for (op = the_list; op; op = op->next)
171 1.1 cgd if (!used[i])
172 1.4 christos plist[i++] = op->sqr->name;
173 1.4 christos plist[i++] = "done";
174 1.4 christos plist[i--] = 0;
175 1.1 cgd return i;
176 1.1 cgd }
177 1.1 cgd /*
178 1.1 cgd * This routine summates the trade.
179 1.1 cgd */
180 1.4 christos static void
181 1.4 christos summate()
182 1.4 christos {
183 1.4 christos
184 1.4 christos bool some;
185 1.4 christos int i;
186 1.4 christos TRADE *tp;
187 1.1 cgd OWN *op;
188 1.1 cgd
189 1.1 cgd for (i = 0; i < 2; i++) {
190 1.1 cgd tp = &trades[i];
191 1.1 cgd some = FALSE;
192 1.1 cgd printf("Player %s (%d) gives:\n", play[tp->trader].name,
193 1.1 cgd tp->trader+1);
194 1.1 cgd if (tp->cash > 0)
195 1.1 cgd printf("\t$%d\n", tp->cash), some++;
196 1.1 cgd if (tp->gojf > 0)
197 1.1 cgd printf("\t%d get-out-of-jail-free card(s)\n", tp->gojf),
198 1.1 cgd some++;
199 1.1 cgd if (tp->prop_list) {
200 1.1 cgd for (op = tp->prop_list; op; op = op->next)
201 1.1 cgd putchar('\t'), printsq(sqnum(op->sqr), TRUE);
202 1.1 cgd some++;
203 1.1 cgd }
204 1.1 cgd if (!some)
205 1.1 cgd printf("\t-- Nothing --\n");
206 1.1 cgd }
207 1.1 cgd }
208 1.1 cgd /*
209 1.1 cgd * This routine actually executes the trade.
210 1.1 cgd */
211 1.4 christos static void
212 1.4 christos do_trade()
213 1.4 christos {
214 1.1 cgd
215 1.1 cgd move_em(&trades[0], &trades[1]);
216 1.1 cgd move_em(&trades[1], &trades[0]);
217 1.1 cgd }
218 1.1 cgd /*
219 1.1 cgd * This routine does a switch from one player to another
220 1.1 cgd */
221 1.4 christos static void
222 1.1 cgd move_em(from, to)
223 1.4 christos TRADE *from, *to;
224 1.4 christos {
225 1.1 cgd
226 1.4 christos PLAY *pl_fr, *pl_to;
227 1.4 christos OWN *op;
228 1.1 cgd
229 1.1 cgd pl_fr = &play[from->trader];
230 1.1 cgd pl_to = &play[to->trader];
231 1.1 cgd
232 1.1 cgd pl_fr->money -= from->cash;
233 1.1 cgd pl_to->money += from->cash;
234 1.1 cgd pl_fr->num_gojf -= from->gojf;
235 1.1 cgd pl_to->num_gojf += from->gojf;
236 1.1 cgd for (op = from->prop_list; op; op = op->next) {
237 1.1 cgd add_list(to->trader, &(pl_to->own_list), sqnum(op->sqr));
238 1.1 cgd op->sqr->owner = to->trader;
239 1.1 cgd del_list(from->trader, &(pl_fr->own_list), sqnum(op->sqr));
240 1.1 cgd }
241 1.1 cgd set_ownlist(to->trader);
242 1.1 cgd }
243 1.1 cgd /*
244 1.1 cgd * This routine lets a player resign
245 1.1 cgd */
246 1.4 christos void
247 1.4 christos resign()
248 1.4 christos {
249 1.1 cgd
250 1.4 christos int i, new_own;
251 1.4 christos OWN *op;
252 1.1 cgd SQUARE *sqp;
253 1.1 cgd
254 1.1 cgd if (cur_p->money <= 0) {
255 1.1 cgd switch (board[cur_p->loc].type) {
256 1.1 cgd case UTIL:
257 1.1 cgd case RR:
258 1.1 cgd case PRPTY:
259 1.1 cgd new_own = board[cur_p->loc].owner;
260 1.1 cgd break;
261 1.1 cgd default: /* Chance, taxes, etc */
262 1.1 cgd new_own = num_play;
263 1.1 cgd break;
264 1.1 cgd }
265 1.1 cgd if (new_own == num_play)
266 1.1 cgd printf("You would resign to the bank\n");
267 1.1 cgd else
268 1.1 cgd printf("You would resign to %s\n", name_list[new_own]);
269 1.1 cgd }
270 1.1 cgd else if (num_play == 1) {
271 1.1 cgd new_own = num_play;
272 1.1 cgd printf("You would resign to the bank\n");
273 1.1 cgd }
274 1.1 cgd else {
275 1.1 cgd name_list[num_play] = "bank";
276 1.1 cgd do {
277 1.1 cgd new_own = getinp("Who do you wish to resign to? ",
278 1.1 cgd name_list);
279 1.1 cgd if (new_own == player)
280 1.1 cgd printf("You can't resign to yourself!!\n");
281 1.1 cgd } while (new_own == player);
282 1.1 cgd name_list[num_play] = "done";
283 1.1 cgd }
284 1.4 christos if (getyn("Do you really want to resign? ") != 0)
285 1.1 cgd return;
286 1.1 cgd if (num_play == 1) {
287 1.1 cgd printf("Then NOBODY wins (not even YOU!)\n");
288 1.1 cgd exit(0);
289 1.1 cgd }
290 1.1 cgd if (new_own < num_play) { /* resign to player */
291 1.1 cgd printf("resigning to player\n");
292 1.1 cgd trades[0].trader = new_own;
293 1.1 cgd trades[0].cash = trades[0].gojf = 0;
294 1.1 cgd trades[0].prop_list = NULL;
295 1.1 cgd trades[1].trader = player;
296 1.1 cgd trades[1].cash = cur_p->money > 0 ? cur_p->money : 0;
297 1.1 cgd trades[1].gojf = cur_p->num_gojf;
298 1.1 cgd trades[1].prop_list = cur_p->own_list;
299 1.1 cgd do_trade();
300 1.1 cgd }
301 1.1 cgd else { /* resign to bank */
302 1.1 cgd printf("resigning to bank\n");
303 1.1 cgd for (op = cur_p->own_list; op; op = op->next) {
304 1.1 cgd sqp = op->sqr;
305 1.1 cgd sqp->owner = -1;
306 1.1 cgd sqp->desc->morg = FALSE;
307 1.1 cgd if (sqp->type == PRPTY) {
308 1.1 cgd isnot_monop(sqp->desc->mon_desc);
309 1.1 cgd sqp->desc->houses = 0;
310 1.1 cgd }
311 1.1 cgd }
312 1.1 cgd if (cur_p->num_gojf)
313 1.1 cgd ret_card(cur_p);
314 1.1 cgd }
315 1.1 cgd for (i = player; i < num_play; i++) {
316 1.1 cgd name_list[i] = name_list[i+1];
317 1.1 cgd if (i + 1 < num_play)
318 1.4 christos play[i] = play[i+1];
319 1.1 cgd }
320 1.1 cgd name_list[num_play--] = 0;
321 1.1 cgd for (i = 0; i < N_SQRS; i++)
322 1.1 cgd if (board[i].owner > player)
323 1.1 cgd --board[i].owner;
324 1.1 cgd player = --player < 0 ? num_play - 1 : player;
325 1.1 cgd next_play();
326 1.1 cgd if (num_play < 2) {
327 1.1 cgd printf("\nThen %s WINS!!!!!\n", play[0].name);
328 1.1 cgd printhold(0);
329 1.1 cgd printf("That's a grand worth of $%d.\n",
330 1.1 cgd play[0].money+prop_worth(&play[0]));
331 1.1 cgd exit(0);
332 1.1 cgd }
333 1.1 cgd }
334