1 /* $OpenBSD: one.c,v 1.7 2015/11/30 08:19:25 tb Exp $ */
2
3 /*
4 * Copyright (c) 1980, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name of the University nor the names of its contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 */
31
32 #include "back.h"
33
34 int
makmove(int i)35 makmove(int i)
36 {
37 int n, d;
38 int max;
39
40 d = d0;
41 n = abs(g[i] - p[i]);
42 max = (*offptr < 0 ? 7 : last());
43 if (board[p[i]] * cturn <= 0)
44 return(checkd(d) + 2);
45 if (g[i] != home && board[g[i]] * cturn < -1)
46 return(checkd(d) + 3);
47 if (i || D0 == D1) {
48 if (n == max ? D1 < n : D1 != n)
49 return(checkd(d) + 1);
50 } else {
51 if (n == max ? D0 < n && D1 < n : D0 != n && D1 != n)
52 return(checkd(d) + 1);
53 if (n == max ? D0 < n : D0 != n)
54 swap;
55 }
56 if (g[i] == home && *offptr < 0)
57 return(checkd(d) + 4);
58 h[i] = 0;
59 board[p[i]] -= cturn;
60 if (g[i] != home) {
61 if (board[g[i]] == -cturn) {
62 board[home] -= cturn;
63 board[g[i]] = 0;
64 h[i] = 1;
65 if (abs(bar - g[i]) < 7) {
66 (*inopp)--;
67 if (*offopp >= 0)
68 *offopp -= 15;
69 }
70 }
71 board[g[i]] += cturn;
72 if (abs(home - g[i]) < 7 && abs(home - p[i]) > 6) {
73 (*inptr)++;
74 if (*inptr + *offptr == 0)
75 *offptr += 15;
76 }
77 } else {
78 (*offptr)++;
79 (*inptr)--;
80 }
81 return(0);
82 }
83
84 void
moverr(int i)85 moverr(int i)
86 {
87 int j;
88
89 mvprintw(20, 0, "Error: ");
90 for (j = 0; j <= i; j++) {
91 printw("%d-%d", p[j], g[j]);
92 if (j < i)
93 addch(',');
94 }
95 addstr("... ");
96 movback(i);
97 }
98
99 int
checkd(int d)100 checkd(int d)
101 {
102 if (d0 != d)
103 swap;
104 return(0);
105 }
106
107 int
last(void)108 last(void)
109 {
110 int i;
111
112 for (i = home - 6 * cturn; i != home; i += cturn)
113 if (board[i] * cturn > 0)
114 return(abs(home - i));
115 return(-1);
116 }
117
118 void
movback(int i)119 movback(int i)
120 {
121 int j;
122
123 for (j = i - 1; j >= 0; j--)
124 backone(j);
125 }
126
127 void
backone(int i)128 backone(int i)
129 {
130 board[p[i]] += cturn;
131 if (g[i] != home) {
132 board[g[i]] -= cturn;
133 if (abs(g[i] - home) < 7 && abs(p[i] - home) > 6) {
134 (*inptr)--;
135 if (*inptr + *offptr < 15 && *offptr >= 0)
136 *offptr -= 15;
137 }
138 } else {
139 (*offptr)--;
140 (*inptr)++;
141 }
142 if (h[i]) {
143 board[home] += cturn;
144 board[g[i]] = -cturn;
145 if (abs(bar - g[i]) < 7) {
146 (*inopp)++;
147 if (*inopp + *offopp == 0)
148 *offopp += 15;
149 }
150 }
151 }
152