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