]> git.cameronkatri.com Git - bsdgames-darwin.git/blob - backgammon/common_source/one.c
Add RCS identifiers.
[bsdgames-darwin.git] / backgammon / common_source / one.c
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
34 #ifndef lint
35 /*static char sccsid[] = "from: @(#)one.c 5.4 (Berkeley) 6/1/90";*/
36 static char rcsid[] = "$Id: one.c,v 1.2 1993/08/01 18:56:39 mycroft Exp $";
37 #endif /* not lint */
38
39 #include "back.h"
40
41 makmove (i)
42 register int i;
43
44 {
45 register int n, d;
46 int max;
47
48 d = d0;
49 n = abs(g[i]-p[i]);
50 max = (*offptr < 0? 7: last());
51 if (board[p[i]]*cturn <= 0)
52 return (checkd(d)+2);
53 if (g[i] != home && board[g[i]]*cturn < -1)
54 return (checkd(d)+3);
55 if (i || D0 == D1) {
56 if (n == max? D1 < n: D1 != n)
57 return (checkd(d)+1);
58 } else {
59 if (n == max? D0 < n && D1 < n: D0 != n && D1 != n)
60 return (checkd(d)+1);
61 if (n == max? D0 < n: D0 != n) {
62 if (d0)
63 return (checkd(d)+1);
64 swap;
65 }
66 }
67 if (g[i] == home && *offptr < 0)
68 return (checkd(d)+4);
69 h[i] = 0;
70 board[p[i]] -= cturn;
71 if (g[i] != home) {
72 if (board[g[i]] == -cturn) {
73 board[home] -= cturn;
74 board[g[i]] = 0;
75 h[i] = 1;
76 if (abs(bar-g[i]) < 7) {
77 (*inopp)--;
78 if (*offopp >= 0)
79 *offopp -= 15;
80 }
81 }
82 board[g[i]] += cturn;
83 if (abs(home-g[i]) < 7 && abs(home-p[i]) > 6) {
84 (*inptr)++;
85 if (*inptr+*offptr == 0)
86 *offptr += 15;
87 }
88 } else {
89 (*offptr)++;
90 (*inptr)--;
91 }
92 return (0);
93 }
94 \f
95 moverr (i)
96 register int i;
97
98 {
99 register int j;
100
101 if (tflag)
102 curmove (20,0);
103 else
104 writec ('\n');
105 writel ("Error: ");
106 for (j = 0; j <= i; j++) {
107 wrint (p[j]);
108 writec ('-');
109 wrint (g[j]);
110 if (j < i)
111 writec (',');
112 }
113 writel ("... ");
114 movback (i);
115 }
116
117
118 checkd (d)
119 register int d;
120
121 {
122 if (d0 != d)
123 swap;
124 return (0);
125 }
126
127 last () {
128 register int i;
129
130 for (i = home-6*cturn; i != home; i += cturn)
131 if (board[i]*cturn > 0)
132 return (abs(home-i));
133 }
134 \f
135 movback (i)
136 register int i;
137
138 {
139 register int j;
140
141 for (j = i-1; j >= 0; j--)
142 backone(j);
143 }
144
145 backone (i)
146 register int i;
147
148 {
149 board[p[i]] += cturn;
150 if (g[i] != home) {
151 board[g[i]] -= cturn;
152 if (abs(g[i]-home) < 7 && abs(p[i]-home) > 6) {
153 (*inptr)--;
154 if (*inptr+*offptr < 15 && *offptr >= 0)
155 *offptr -= 15;
156 }
157 } else {
158 (*offptr)--;
159 (*inptr)++;
160 }
161 if (h[i]) {
162 board[home] += cturn;
163 board[g[i]] = -cturn;
164 if (abs(bar-g[i]) < 7) {
165 (*inopp)++;
166 if (*inopp+*offopp == 0)
167 *offopp += 15;
168 }
169 }
170 }