[unix-history] / usr / src / games / monop / houses.c

/*
 * Copyright (c) 1980 Regents of the University of California.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms are permitted
 * provided that the above copyright notice and this paragraph are
 * duplicated in all such forms and that any documentation,
 * advertising materials, and other materials related to such
 * distribution and use acknowledge that the software was developed
 * by the University of California, Berkeley.  The name of the
 * University may not be used to endorse or promote products derived
 * from this software without specific prior written permission.
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
 */

#ifndef lint
static char sccsid[] = "@(#)houses.c	5.4 (Berkeley) %G%";
#endif /* not lint */

# include	"monop.ext"

static char	*names[N_MON+2],
		cur_prop[80];

static MON	*monops[N_MON];

/*
 *	These routines deal with buying and selling houses
 */
buy_houses() {

	reg int num_mon;
	reg MON	*mp;
	reg OWN	*op;
	bool	good,got_morg;
	int	i,p;

over:
	num_mon = 0;
	good = TRUE;
	got_morg = FALSE;
	for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next)
		continue;
	while (op)
		if (op->sqr->desc->monop) {
			mp = op->sqr->desc->mon_desc;
			names[num_mon] = (monops[num_mon]=mp)->name;
			num_mon++;
			got_morg = good = FALSE;
			for (i = 0; i < mp->num_in; i++) {
				if (op->sqr->desc->morg)
					got_morg++;
				if (op->sqr->desc->houses != 5)
					good++;
				op = op->next;
			}
			if (!good || got_morg)
				--num_mon;
		}
		else
			op = op->next;
	if (num_mon == 0) {
		if (got_morg)
			printf("You can't build on mortgaged monopolies.\n");
		else if (!good)
			printf("You can't build any more.\n");
		else
			printf("But you don't have any monopolies!!\n");
		return;
	}
	if (num_mon == 1)
		buy_h(monops[0]);
	else {
		names[num_mon++] = "done";
		names[num_mon--] = 0;
		if ((p=getinp("Which property do you wish to buy houses for? ", names)) == num_mon)
			return;
		buy_h(monops[p]);
		goto over;
	}
}

buy_h(mnp)
MON	*mnp; {

	reg int	i;
	reg MON	*mp;
	reg int	price;
	shrt	input[3],temp[3];
	int	tot;
	PROP	*pp;

	mp = mnp;
	price = mp->h_cost * 50;
blew_it:
	list_cur(mp);
	printf("Houses will cost $%d\n", price);
	printf("How many houses do you wish to buy for\n");
	for (i = 0; i < mp->num_in; i++) {
		pp = mp->sq[i]->desc;
over:
		if (pp->houses == 5) {
			printf("%s (H):\n", mp->sq[i]->name);
			input[i] = 0;
			temp[i] = 5;
			continue;
		}
		(void)sprintf(cur_prop, "%s (%d): ",
			mp->sq[i]->name, pp->houses);
		input[i] = get_int(cur_prop);
		temp[i] = input[i] + pp->houses;
		if (temp[i] > 5) {
			printf("That's too many.  The most you can buy is %d\n",
				5 - pp->houses);
				goto over;
			}
	}
	if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
	    abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
err:		printf("That makes the spread too wide.  Try again\n");
		goto blew_it;
	}
	else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
		goto err;
	for (tot = i = 0; i < mp->num_in; i++)
		tot += input[i];
	if (tot) {
		printf("You asked for %d houses for $%d\n", tot, tot * price);
		if (getyn("Is that ok? ", yn) == 0) {
			cur_p->money -= tot * price;
			for (tot = i = 0; i < mp->num_in; i++)
				mp->sq[i]->desc->houses = temp[i];
		}
	}
}

/*
 *	This routine sells houses.
 */
sell_houses() {

	reg int	num_mon;
	reg MON	*mp;
	reg OWN	*op;
	bool	good;
	int	p;

over:
	num_mon = 0;
	good = TRUE;
	for (op = cur_p->own_list; op; op = op->next)
		if (op->sqr->type == PRPTY && op->sqr->desc->monop) {
			mp = op->sqr->desc->mon_desc;
			names[num_mon] = (monops[num_mon]=mp)->name;
			num_mon++;
			good = 0;
			do
				if (!good && op->sqr->desc->houses != 0)
					good++;
			while (op->next && op->sqr->desc->mon_desc == mp
			    && (op=op->next));
			if (!good)
				--num_mon;
		}
	if (num_mon == 0) {
		printf("You don't have any houses to sell!!\n");
		return;
	}
	if (num_mon == 1)
		sell_h(monops[0]);
	else {
		names[num_mon++] = "done";
		names[num_mon--] = 0;
		if ((p=getinp("Which property do you wish to sell houses from? ", names)) == num_mon)
			return;
		sell_h(monops[p]);
		notify();
		goto over;
	}
}

sell_h(mnp)
MON	*mnp; {

	reg int	i;
	reg MON	*mp;
	reg int	price;
	shrt	input[3],temp[3];
	int	tot;
	PROP	*pp;

	mp = mnp;
	price = mp->h_cost * 25;
blew_it:
	printf("Houses will get you $%d apiece\n", price);
	list_cur(mp);
	printf("How many houses do you wish to sell from\n");
	for (i = 0; i < mp->num_in; i++) {
		pp = mp->sq[i]->desc;
over:
		if (pp->houses == 0) {
			printf("%s (0):\n", mp->sq[i]->name);
			input[i] = temp[i] = 0;
			continue;
		}
		if (pp->houses < 5)
			(void)sprintf(cur_prop,"%s (%d): ",
				mp->sq[i]->name,pp->houses);
		else
			(void)sprintf(cur_prop,"%s (H): ",mp->sq[i]->name);
		input[i] = get_int(cur_prop);
		temp[i] = pp->houses - input[i];
		if (temp[i] < 0) {
			printf("That's too many.  The most you can sell is %d\n", pp->houses);
				goto over;
			}
	}
	if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 ||
	    abs(temp[0] - temp[2]) > 1 || abs(temp[1] - temp[2]) > 1)) {
err:		printf("That makes the spread too wide.  Try again\n");
		goto blew_it;
	}
	else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
		goto err;
	for (tot = i = 0; i < mp->num_in; i++)
		tot += input[i];
	if (tot) {
		printf("You asked to sell %d houses for $%d\n",tot,tot * price);
		if (getyn("Is that ok? ", yn) == 0) {
			cur_p->money += tot * price;
			for (tot = i = 0; i < mp->num_in; i++)
				mp->sq[i]->desc->houses = temp[i];
		}
	}
}

list_cur(mp)
reg MON	*mp; {

	reg int		i;
	reg SQUARE	*sqp;

	for (i = 0; i < mp->num_in; i++) {
		sqp = mp->sq[i];
		if (sqp->desc->houses == 5)
			printf("%s (H) ", sqp->name);
		else
			printf("%s (%d) ", sqp->name, sqp->desc->houses);
	}
	putchar('\n');
}
Commit	Line	Data
e10e1c15	1	/*
d99e6414	2	* Copyright (c) 1980 Regents of the University of California.
e10e1c15 KB	3	* All rights reserved.
	4	*
	5	* Redistribution and use in source and binary forms are permitted
d99e6414 KB	6	* provided that the above copyright notice and this paragraph are
	7	* duplicated in all such forms and that any documentation,
	8	* advertising materials, and other materials related to such
	9	* distribution and use acknowledge that the software was developed
	10	* by the University of California, Berkeley. The name of the
	11	* University may not be used to endorse or promote products derived
	12	* from this software without specific prior written permission.
	13	* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
	14	* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
	15	* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
e10e1c15 KB	16	*/
e10e1c15 KB	17
8cc451b4	18	#ifndef lint
d99e6414	19	static char sccsid[] = "@(#)houses.c 5.4 (Berkeley) %G%";
e10e1c15	20	#endif /* not lint */
8cc451b4 KB	21
	22	# include "monop.ext"
	23
	24	static char *names[N_MON+2],
	25	cur_prop[80];
	26
	27	static MON *monops[N_MON];
	28
	29	/*
	30	* These routines deal with buying and selling houses
	31	*/
	32	buy_houses() {
	33
	34	reg int num_mon;
	35	reg MON *mp;
	36	reg OWN *op;
	37	bool good,got_morg;
	38	int i,p;
	39
	40	over:
	41	num_mon = 0;
	42	good = TRUE;
	43	got_morg = FALSE;
	44	for (op = cur_p->own_list; op && op->sqr->type != PRPTY; op = op->next)
	45	continue;
	46	while (op)
	47	if (op->sqr->desc->monop) {
	48	mp = op->sqr->desc->mon_desc;
	49	names[num_mon] = (monops[num_mon]=mp)->name;
	50	num_mon++;
	51	got_morg = good = FALSE;
	52	for (i = 0; i < mp->num_in; i++) {
	53	if (op->sqr->desc->morg)
	54	got_morg++;
	55	if (op->sqr->desc->houses != 5)
	56	good++;
	57	op = op->next;
	58	}
	59	if (!good \|\| got_morg)
	60	--num_mon;
	61	}
	62	else
	63	op = op->next;
	64	if (num_mon == 0) {
	65	if (got_morg)
	66	printf("You can't build on mortgaged monopolies.\n");
	67	else if (!good)
	68	printf("You can't build any more.\n");
	69	else
	70	printf("But you don't have any monopolies!!\n");
	71	return;
	72	}
	73	if (num_mon == 1)
	74	buy_h(monops[0]);
	75	else {
	76	names[num_mon++] = "done";
	77	names[num_mon--] = 0;
	78	if ((p=getinp("Which property do you wish to buy houses for? ", names)) == num_mon)
	79	return;
	80	buy_h(monops[p]);
	81	goto over;
	82	}
	83	}
	84
85	buy_h(mnp)
86	MON *mnp; {
87
88	reg int i;
89	reg MON *mp;
90	reg int price;
91	shrt input[3],temp[3];
92	int tot;
93	PROP *pp;
94
95	mp = mnp;
96	price = mp->h_cost * 50;
97	blew_it:
98	list_cur(mp);
99	printf("Houses will cost $%d\n", price);
100	printf("How many houses do you wish to buy for\n");
101	for (i = 0; i < mp->num_in; i++) {
102	pp = mp->sq[i]->desc;
103	over:
104	if (pp->houses == 5) {
105	printf("%s (H):\n", mp->sq[i]->name);
106	input[i] = 0;
107	temp[i] = 5;
108	continue;
109	}
e1123b44 KB	110	(void)sprintf(cur_prop, "%s (%d): ",
e1123b44 KB	111	mp->sq[i]->name, pp->houses);
8cc451b4 KB	112	input[i] = get_int(cur_prop);
	113	temp[i] = input[i] + pp->houses;
	114	if (temp[i] > 5) {
	115	printf("That's too many. The most you can buy is %d\n",
	116	5 - pp->houses);
	117	goto over;
	118	}
	119	}
	120	if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 \|\|
	121	abs(temp[0] - temp[2]) > 1 \|\| abs(temp[1] - temp[2]) > 1)) {
	122	err: printf("That makes the spread too wide. Try again\n");
	123	goto blew_it;
	124	}
	125	else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
	126	goto err;
	127	for (tot = i = 0; i < mp->num_in; i++)
	128	tot += input[i];
	129	if (tot) {
	130	printf("You asked for %d houses for $%d\n", tot, tot * price);
	131	if (getyn("Is that ok? ", yn) == 0) {
	132	cur_p->money -= tot * price;
	133	for (tot = i = 0; i < mp->num_in; i++)
	134	mp->sq[i]->desc->houses = temp[i];
	135	}
	136	}
	137	}
	138
	139	/*
	140	* This routine sells houses.
	141	*/
	142	sell_houses() {
	143
	144	reg int num_mon;
	145	reg MON *mp;
	146	reg OWN *op;
	147	bool good;
	148	int p;
	149
	150	over:
	151	num_mon = 0;
	152	good = TRUE;
	153	for (op = cur_p->own_list; op; op = op->next)
	154	if (op->sqr->type == PRPTY && op->sqr->desc->monop) {
	155	mp = op->sqr->desc->mon_desc;
	156	names[num_mon] = (monops[num_mon]=mp)->name;
	157	num_mon++;
	158	good = 0;
	159	do
	160	if (!good && op->sqr->desc->houses != 0)
	161	good++;
	162	while (op->next && op->sqr->desc->mon_desc == mp
	163	&& (op=op->next));
	164	if (!good)
	165	--num_mon;
	166	}
	167	if (num_mon == 0) {
	168	printf("You don't have any houses to sell!!\n");
	169	return;
	170	}
	171	if (num_mon == 1)
	172	sell_h(monops[0]);
	173	else {
	174	names[num_mon++] = "done";
	175	names[num_mon--] = 0;
176	if ((p=getinp("Which property do you wish to sell houses from? ", names)) == num_mon)
177	return;
178	sell_h(monops[p]);
179	notify();
180	goto over;
181	}
182	}
183
184	sell_h(mnp)
185	MON *mnp; {
186
187	reg int i;
188	reg MON *mp;
189	reg int price;
190	shrt input[3],temp[3];
191	int tot;
192	PROP *pp;
193
194	mp = mnp;
195	price = mp->h_cost * 25;
196	blew_it:
197	printf("Houses will get you $%d apiece\n", price);
198	list_cur(mp);
199	printf("How many houses do you wish to sell from\n");
200	for (i = 0; i < mp->num_in; i++) {
201	pp = mp->sq[i]->desc;
202	over:
203	if (pp->houses == 0) {
204	printf("%s (0):\n", mp->sq[i]->name);
205	input[i] = temp[i] = 0;
206	continue;
207	}
208	if (pp->houses < 5)
e1123b44 KB	209	(void)sprintf(cur_prop,"%s (%d): ",
e1123b44 KB	210	mp->sq[i]->name,pp->houses);
8cc451b4	211	else
e1123b44	212	(void)sprintf(cur_prop,"%s (H): ",mp->sq[i]->name);
8cc451b4 KB	213	input[i] = get_int(cur_prop);
	214	temp[i] = pp->houses - input[i];
	215	if (temp[i] < 0) {
	216	printf("That's too many. The most you can sell is %d\n", pp->houses);
	217	goto over;
	218	}
	219	}
	220	if (mp->num_in == 3 && (abs(temp[0] - temp[1]) > 1 \|\|
	221	abs(temp[0] - temp[2]) > 1 \|\| abs(temp[1] - temp[2]) > 1)) {
	222	err: printf("That makes the spread too wide. Try again\n");
	223	goto blew_it;
	224	}
	225	else if (mp->num_in == 2 && abs(temp[0] - temp[1]) > 1)
	226	goto err;
	227	for (tot = i = 0; i < mp->num_in; i++)
	228	tot += input[i];
	229	if (tot) {
	230	printf("You asked to sell %d houses for $%d\n",tot,tot * price);
	231	if (getyn("Is that ok? ", yn) == 0) {
	232	cur_p->money += tot * price;
	233	for (tot = i = 0; i < mp->num_in; i++)
	234	mp->sq[i]->desc->houses = temp[i];
	235	}
	236	}
	237	}
	238
	239	list_cur(mp)
	240	reg MON *mp; {
	241
	242	reg int i;
	243	reg SQUARE *sqp;
	244
	245	for (i = 0; i < mp->num_in; i++) {
	246	sqp = mp->sq[i];
	247	if (sqp->desc->houses == 5)
	248	printf("%s (H) ", sqp->name);
	249	else
	250	printf("%s (%d) ", sqp->name, sqp->desc->houses);
	251	}
	252	putchar('\n');
	253	}