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