Home | History | Annotate | Line # | Download | only in common_source
one.c revision 1.2 
      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 
     95 moverr (i)
     97 register int	i;
     98 
     99 {
    100 	register int	j;
    101 
    102 	if (tflag)
    103 		curmove (20,0);
    104 	else
    105 		writec ('\n');
    106 	writel ("Error:  ");
    107 	for (j = 0; j <= i; j++)  {
    108 		wrint (p[j]);
    109 		writec ('-');
    110 		wrint (g[j]);
    111 		if (j < i)
    112 			writec (',');
    113 	}
    114 	writel ("... ");
    115 	movback (i);
    116 }
    117 
    118 
    119 checkd (d)
    120 register int	d;
    121 
    122 {
    123 	if (d0 != d)
    124 		swap;
    125 	return (0);
    126 }
    127 
    128 last ()  {
    129 	register int	i;
    130 
    131 	for (i = home-6*cturn; i != home; i += cturn)
    132 		if (board[i]*cturn > 0)
    133 			return (abs(home-i));
    134 }
    135 
    136 movback (i)
    138 register int	i;
    139 
    140 {
    141 	register int	j;
    142 
    143 	for (j = i-1; j >= 0; j--)
    144 		backone(j);
    145 }
    146 
    147 backone (i)
    148 register int	i;
    149 
    150 {
    151 	board[p[i]] += cturn;
    152 	if (g[i] != home)  {
    153 		board[g[i]] -= cturn;
    154 		if (abs(g[i]-home) < 7 && abs(p[i]-home) > 6)  {
    155 			(*inptr)--;
    156 			if (*inptr+*offptr < 15 && *offptr >= 0)
    157 				*offptr -= 15;
    158 		}
    159 	} else  {
    160 		(*offptr)--;
    161 		(*inptr)++;
    162 	}
    163 	if (h[i])  {
    164 		board[home] += cturn;
    165 		board[g[i]] = -cturn;
    166 		if (abs(bar-g[i]) < 7)  {
    167 			(*inopp)++;
    168 			if (*inopp+*offopp == 0)
    169 				*offopp += 15;
    170 		}
    171 	}
    172 }
    173