]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - monop/monop.h
Two corrections from George Robbins (confirmed by `The lore of the train'
[bsdgames-darwin.git] / monop / monop.h
1 /*
2 * Copyright (c) 1980 Regents of the University of California.
3 * All rights reserved.
4 *
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
7 * are met:
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
13 * 3. All advertising materials mentioning features or use of this software
14 * must display the following acknowledgement:
15 * This product includes software developed by the University of
16 * California, Berkeley and its contributors.
17 * 4. Neither the name of the University nor the names of its contributors
18 * may be used to endorse or promote products derived from this software
19 * without specific prior written permission.
20 *
21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 * SUCH DAMAGE.
32 *
33 * from: @(#)monop.h 5.5 (Berkeley) 6/1/90
34 * $Id: monop.h,v 1.2 1993/08/01 18:53:46 mycroft Exp $
35 */
36
37 # include <stdio.h>
38
39 # define reg register
40 # define shrt char
41 # define bool char
42 # define unsgn unsigned
43
44 # define TRUE (1)
45 # define FALSE (0)
46
47 # define N_MON 8 /* number of monopolies */
48 # define N_PROP 22 /* number of normal property squares */
49 # define N_RR 4 /* number of railroads */
50 # define N_UTIL 2 /* number of utilities */
51 # define N_SQRS 40 /* number of squares on board */
52 # define MAX_PL 9 /* maximum number of players */
53 # define MAX_PRP (N_PROP+N_RR+N_UTIL) /* max # ownable property */
54
55 /* square type numbers */
56 # define PRPTY 0 /* normal property */
57 # define RR 1 /* railroad */
58 # define UTIL 2 /* water works - electric co */
59 # define SAFE 3 /* safe spot */
60 # define CC 4 /* community chest */
61 # define CHANCE 5 /* chance (surprise!!!) */
62 # define INC_TAX 6 /* Income tax */
63 # define GOTO_J 7 /* Go To Jail! */
64 # define LUX_TAX 8 /* Luxury tax */
65 # define IN_JAIL 9 /* In jail */
66
67 # define JAIL 40 /* JAIL square number */
68
69 # define lucky(str) printf("%s%s\n",str,lucky_mes[roll(1,num_luck)-1])
70 # define printline() printf("------------------------------\n")
71 # define sqnum(sqp) (sqp - board)
72 # define swap(A1,A2) if ((A1) != (A2)) { \
73 (A1) ^= (A2); \
74 (A2) ^= (A1); \
75 (A1) ^= (A2); \
76 }
77
78 struct sqr_st { /* structure for square */
79 char *name; /* place name */
80 shrt owner; /* owner number */
81 shrt type; /* place type */
82 struct prp_st *desc; /* description struct */
83 int cost; /* cost */
84 };
85
86 typedef struct sqr_st SQUARE;
87
88 struct mon_st { /* monopoly description structure */
89 char *name; /* monop. name (color) */
90 shrt owner; /* owner of monopoly */
91 shrt num_in; /* # in monopoly */
92 shrt num_own; /* # owned (-1: not poss. monop)*/
93 shrt h_cost; /* price of houses */
94 char *not_m; /* name if not monopoly */
95 char *mon_n; /* name if a monopoly */
96 char sqnums[3]; /* Square numbers (used to init)*/
97 SQUARE *sq[3]; /* list of squares in monop */
98 };
99
100 typedef struct mon_st MON;
101
102 /*
103 * This struct describes a property. For railroads and utilities, only
104 * the "morg" member is used.
105 */
106 struct prp_st { /* property description structure */
107 bool morg; /* set if mortgaged */
108 bool monop; /* set if monopoly */
109 shrt square; /* square description */
110 shrt houses; /* number of houses */
111 MON *mon_desc; /* name of color */
112 int rent[6]; /* rents */
113 };
114
115 struct own_st { /* element in list owned things */
116 SQUARE *sqr; /* pointer to square */
117 struct own_st *next; /* next in list */
118 };
119
120 typedef struct own_st OWN;
121
122 struct plr_st { /* player description structure */
123 char *name; /* owner name */
124 shrt num_gojf; /* # of get-out-of-jail-free's */
125 shrt num_rr; /* # of railroads owned */
126 shrt num_util; /* # of water works/elec. co. */
127 shrt loc; /* location on board */
128 shrt in_jail; /* count of turns in jail */
129 int money; /* amount of money */
130 OWN *own_list; /* start of propery list */
131 };
132
133 typedef struct plr_st PLAY;
134 typedef struct prp_st PROP;
135 typedef struct prp_st RR_S;
136 typedef struct prp_st UTIL_S;
137
138 int cc(), chance(), lux_tax(), goto_jail(), inc_tax();