Home | History | Annotate | Line # | Download | only in common_source
allow.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: @(#)allow.c	5.4 (Berkeley) 6/1/90";*/
     36  1.2  mycroft static char rcsid[] = "$Id: allow.c,v 1.2 1993/08/01 18:56:46 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 movallow ()  {
     42  1.1      cgd 
     43  1.1      cgd 	register int	i, m, iold;
     44  1.1      cgd 	int		r;
     45  1.1      cgd 
     46  1.1      cgd 	if (d0)
     47  1.1      cgd 		swap;
     48  1.1      cgd 	m = (D0 == D1? 4: 2);
     49  1.1      cgd 	for (i = 0; i < 4; i++)
     50  1.1      cgd 		p[i] = bar;
     51  1.1      cgd 	i = iold = 0;
     52  1.1      cgd 	while (i < m)  {
     53  1.1      cgd 		if (*offptr == 15)
     54  1.1      cgd 			break;
     55  1.1      cgd 		h[i] = 0;
     56  1.1      cgd 		if (board[bar])  {
     57  1.1      cgd 			if (i == 1 || m == 4)
     58  1.1      cgd 				g[i] = bar+cturn*D1;
     59  1.1      cgd 			else
     60  1.1      cgd 				g[i] = bar+cturn*D0;
     61  1.1      cgd 			if (r = makmove(i))  {
     62  1.1      cgd 				if (d0 || m == 4)
     63  1.1      cgd 					break;
     64  1.1      cgd 				swap;
     65  1.1      cgd 				movback (i);
     66  1.1      cgd 				if (i > iold)
     67  1.1      cgd 					iold = i;
     68  1.1      cgd 				for (i = 0; i < 4; i++)
     69  1.1      cgd 					p[i] = bar;
     70  1.1      cgd 				i = 0;
     71  1.1      cgd 			} else
     72  1.1      cgd 				i++;
     73  1.1      cgd 			continue;
     74  1.1      cgd 		}
     75  1.1      cgd 		if ((p[i] += cturn) == home)  {
     76  1.1      cgd 			if (i > iold)
     77  1.1      cgd 				iold = i;
     78  1.1      cgd 			if (m == 2 && i)  {
     79  1.1      cgd 				movback(i);
     80  1.1      cgd 				p[i--] = bar;
     81  1.1      cgd 				if (p[i] != bar)
     82  1.1      cgd 					continue;
     83  1.1      cgd 				else
     84  1.1      cgd 					break;
     85  1.1      cgd 			}
     86  1.1      cgd 			if (d0 || m == 4)
     87  1.1      cgd 				break;
     88  1.1      cgd 			swap;
     89  1.1      cgd 			movback (i);
     90  1.1      cgd 			for (i = 0; i < 4; i++)
     91  1.1      cgd 				p[i] = bar;
     92  1.1      cgd 			i = 0;
     93  1.1      cgd 			continue;
     94  1.1      cgd 		}
     95  1.1      cgd 		if (i == 1 || m == 4)
     96  1.1      cgd 			g[i] = p[i]+cturn*D1;
     97  1.1      cgd 		else
     98  1.1      cgd 			g[i] = p[i]+cturn*D0;
     99  1.1      cgd 		if (g[i]*cturn > home)  {
    100  1.1      cgd 			if (*offptr >= 0)
    101  1.1      cgd 				g[i] = home;
    102  1.1      cgd 			else
    103  1.1      cgd 				continue;
    104  1.1      cgd 		}
    105  1.1      cgd 		if (board[p[i]]*cturn > 0 && (r = makmove(i)) == 0)
    106  1.1      cgd 			i++;
    107  1.1      cgd 	}
    108  1.1      cgd 	movback (i);
    109  1.1      cgd 	return (iold > i? iold: i);
    110  1.1      cgd }
    111