Home | History | Annotate | Line # | Download | only in teachgammon
tutor.c revision 1.3
      1  1.3  cgd /*	$NetBSD: tutor.c,v 1.3 1995/03/21 15:06:27 cgd 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.1  cgd #ifndef lint
     37  1.3  cgd #if 0
     38  1.3  cgd static char sccsid[] = "@(#)tutor.c	8.1 (Berkeley) 5/31/93";
     39  1.3  cgd #else
     40  1.3  cgd static char rcsid[] = "$NetBSD: tutor.c,v 1.3 1995/03/21 15:06:27 cgd Exp $";
     41  1.3  cgd #endif
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.1  cgd #include "back.h"
     45  1.1  cgd #include "tutor.h"
     46  1.1  cgd 
     47  1.1  cgd extern int	maxmoves;
     48  1.1  cgd extern char	*finis[];
     49  1.1  cgd 
     50  1.1  cgd extern struct situatn	test[];
     51  1.1  cgd 
     52  1.1  cgd static char	better[] = "That is a legal move, but there is a better one.\n";
     53  1.1  cgd 
     54  1.1  cgd tutor ()  {
     55  1.1  cgd 	register int	i, j;
     56  1.1  cgd 
     57  1.1  cgd 	i = 0;
     58  1.1  cgd 	begscr = 18;
     59  1.1  cgd 	cturn = -1;
     60  1.1  cgd 	home = 0;
     61  1.1  cgd 	bar = 25;
     62  1.1  cgd 	inptr = &in[0];
     63  1.1  cgd 	inopp = &in[1];
     64  1.1  cgd 	offptr = &off[0];
     65  1.1  cgd 	offopp = &off[1];
     66  1.1  cgd 	Colorptr = &color[0];
     67  1.1  cgd 	colorptr = &color[2];
     68  1.1  cgd 	colen = 5;
     69  1.1  cgd 	wrboard();
     70  1.1  cgd 
     71  1.1  cgd 	while (1)  {
     72  1.1  cgd 		if (! brdeq(test[i].brd,board))  {
     73  1.1  cgd 			if (tflag && curr == 23)
     74  1.1  cgd 				curmove (18,0);
     75  1.1  cgd 			writel (better);
     76  1.1  cgd 			nexturn();
     77  1.1  cgd 			movback (mvlim);
     78  1.1  cgd 			if (tflag)  {
     79  1.1  cgd 				refresh();
     80  1.1  cgd 				clrest ();
     81  1.1  cgd 			}
     82  1.1  cgd 			if ((! tflag) || curr == 19)  {
     83  1.1  cgd 				proll();
     84  1.1  cgd 				writec ('\t');
     85  1.1  cgd 			}
     86  1.1  cgd 			else
     87  1.1  cgd 				curmove (curr > 19? curr-2: curr+4,25);
     88  1.1  cgd 			getmove();
     89  1.1  cgd 			if (cturn == 0)
     90  1.1  cgd 				leave();
     91  1.1  cgd 			continue;
     92  1.1  cgd 		}
     93  1.1  cgd 		if (tflag)
     94  1.1  cgd 			curmove (18,0);
     95  1.1  cgd 		text (*test[i].com);
     96  1.1  cgd 		if (! tflag)
     97  1.1  cgd 			writec ('\n');
     98  1.1  cgd 		if (i == maxmoves)
     99  1.1  cgd 			break;
    100  1.1  cgd 		D0 = test[i].roll1;
    101  1.1  cgd 		D1 = test[i].roll2;
    102  1.1  cgd 		d0 = 0;
    103  1.1  cgd 		mvlim = 0;
    104  1.1  cgd 		for (j = 0; j < 4; j++)  {
    105  1.1  cgd 			if (test[i].mp[j] == test[i].mg[j])
    106  1.1  cgd 				break;
    107  1.1  cgd 			p[j] = test[i].mp[j];
    108  1.1  cgd 			g[j] = test[i].mg[j];
    109  1.1  cgd 			mvlim++;
    110  1.1  cgd 		}
    111  1.1  cgd 		if (mvlim)
    112  1.1  cgd 			for (j = 0; j < mvlim; j++)
    113  1.1  cgd 				if (makmove(j))
    114  1.1  cgd 					writel ("AARGH!!!\n");
    115  1.1  cgd 		if (tflag)
    116  1.1  cgd 			refresh();
    117  1.1  cgd 		nexturn();
    118  1.1  cgd 		D0 = test[i].new1;
    119  1.1  cgd 		D1 = test[i].new2;
    120  1.1  cgd 		d0 = 0;
    121  1.1  cgd 		i++;
    122  1.1  cgd 		mvlim = movallow();
    123  1.1  cgd 		if (mvlim)  {
    124  1.1  cgd 			if (tflag)
    125  1.1  cgd 				clrest();
    126  1.1  cgd 			proll();
    127  1.1  cgd 			writec('\t');
    128  1.1  cgd 			getmove();
    129  1.1  cgd 			if (tflag)
    130  1.1  cgd 				refresh();
    131  1.1  cgd 			if (cturn == 0)
    132  1.1  cgd 				leave();
    133  1.1  cgd 		}
    134  1.1  cgd 	}
    135  1.1  cgd 	leave();
    136  1.1  cgd }
    137  1.1  cgd 
    138  1.1  cgd clrest ()  {
    139  1.1  cgd 	register int	r, c, j;
    140  1.1  cgd 
    141  1.1  cgd 	r = curr;
    142  1.1  cgd 	c = curc;
    143  1.1  cgd 	for (j = r+1; j < 24; j++)  {
    144  1.1  cgd 		curmove (j,0);
    145  1.1  cgd 		cline();
    146  1.1  cgd 	}
    147  1.1  cgd 	curmove (r,c);
    148  1.1  cgd }
    149  1.1  cgd 
    150  1.1  cgd brdeq (b1,b2)
    151  1.1  cgd register int  *b1, *b2;
    152  1.1  cgd 
    153  1.1  cgd {
    154  1.1  cgd 	register int  *e;
    155  1.1  cgd 
    156  1.1  cgd 	e = b1+26;
    157  1.1  cgd 	while (b1 < e)
    158  1.1  cgd 		if (*b1++ != *b2++)
    159  1.1  cgd 			return(0);
    160  1.1  cgd 	return(1);
    161  1.1  cgd }
    162