1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
|
/* $OpenBSD: jail.c,v 1.5 2009/10/27 23:59:26 deraadt Exp $ */
/* $NetBSD: jail.c,v 1.3 1995/03/23 08:34:44 cgd Exp $ */
/*
* Copyright (c) 1980, 1993
* The Regents of the University of California. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 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. 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
* SUCH DAMAGE.
*/
#include "monop.ext"
/*
* This routine uses a get-out-of-jail-free card to get the
* player out of jail.
*/
void
card()
{
if (cur_p->loc != JAIL) {
printf("But you're not IN Jail\n");
return;
}
if (cur_p->num_gojf == 0) {
printf("But you don't HAVE a get out of jail free card\n");
return;
}
ret_card(cur_p);
cur_p->loc = 10; /* just visiting */
cur_p->in_jail = 0;
}
/*
* This routine deals with paying your way out of jail.
*/
void
pay()
{
if (cur_p->loc != JAIL) {
printf("But you're not IN Jail\n");
return;
}
cur_p->loc = 10;
cur_p->money -= 50;
cur_p->in_jail = 0;
printf("That cost you $50\n");
}
/*
* This routine deals with a move in jail
*/
int
move_jail(r1, r2)
int r1, r2;
{
if (r1 != r2) {
printf("Sorry, that doesn't get you out\n");
if (++(cur_p->in_jail) == 3) {
printf("It's your third turn and you didn't roll doubles. You have to pay $50\n");
cur_p->money -= 50;
moveit:
cur_p->loc = 10;
cur_p->in_jail = 0;
move(r1+r2);
r1 = r2 - 1; /* kludge: stop new roll w/doub */
return TRUE;
}
return FALSE;
} else {
printf("Double roll gets you out.\n");
goto moveit;
}
}
void
printturn()
{
if (cur_p->loc != JAIL)
return;
printf("(This is your ");
switch (cur_p->in_jail) {
case 0:
printf("1st");
break;
case 1:
printf("2nd");
break;
case 2:
printf("3rd (and final)");
break;
}
printf(" turn in JAIL)\n");
}
|
