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