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