Home | History | Annotate | Line # | Download | only in teachgammon
tutor.c revision 1.9.12.1
      1  1.9.12.1       tls /*	$NetBSD: tutor.c,v 1.9.12.1 2012/11/20 02:58:45 tls 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.6       agc  * 3. Neither the name of the University nor the names of its contributors
     16       1.1       cgd  *    may be used to endorse or promote products derived from this software
     17       1.1       cgd  *    without specific prior written permission.
     18       1.1       cgd  *
     19       1.1       cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     20       1.1       cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     21       1.1       cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     22       1.1       cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     23       1.1       cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     24       1.1       cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     25       1.1       cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     26       1.1       cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     27       1.1       cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     28       1.1       cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     29       1.1       cgd  * SUCH DAMAGE.
     30       1.1       cgd  */
     31       1.1       cgd 
     32       1.4     lukem #include <sys/cdefs.h>
     33       1.1       cgd #ifndef lint
     34       1.3       cgd #if 0
     35       1.3       cgd static char sccsid[] = "@(#)tutor.c	8.1 (Berkeley) 5/31/93";
     36       1.3       cgd #else
     37  1.9.12.1       tls __RCSID("$NetBSD: tutor.c,v 1.9.12.1 2012/11/20 02:58:45 tls Exp $");
     38       1.3       cgd #endif
     39       1.4     lukem #endif				/* not lint */
     40       1.1       cgd 
     41       1.1       cgd #include "back.h"
     42       1.1       cgd #include "tutor.h"
     43       1.1       cgd 
     44       1.7       jmc static const char better[] =
     45       1.7       jmc 	"That is a legal move, but there is a better one.\n";
     46       1.1       cgd 
     47       1.8  dholland static int brdeq(const int *, const int *);
     48       1.8  dholland static void clrest(void);
     49       1.8  dholland 
     50       1.4     lukem void
     51  1.9.12.1       tls tutor(struct move *mm)
     52       1.4     lukem {
     53       1.4     lukem 	int     i, j;
     54       1.1       cgd 
     55       1.1       cgd 	i = 0;
     56       1.1       cgd 	begscr = 18;
     57       1.1       cgd 	cturn = -1;
     58       1.1       cgd 	home = 0;
     59       1.1       cgd 	bar = 25;
     60       1.1       cgd 	inptr = &in[0];
     61       1.1       cgd 	inopp = &in[1];
     62       1.1       cgd 	offptr = &off[0];
     63       1.1       cgd 	offopp = &off[1];
     64       1.1       cgd 	Colorptr = &color[0];
     65       1.1       cgd 	colorptr = &color[2];
     66       1.1       cgd 	colen = 5;
     67       1.1       cgd 	wrboard();
     68       1.1       cgd 
     69       1.4     lukem 	while (1) {
     70       1.4     lukem 		if (!brdeq(test[i].brd, board)) {
     71       1.1       cgd 			if (tflag && curr == 23)
     72       1.4     lukem 				curmove(18, 0);
     73       1.4     lukem 			writel(better);
     74       1.1       cgd 			nexturn();
     75  1.9.12.1       tls 			movback(mm, mm->mvlim);
     76       1.4     lukem 			if (tflag) {
     77       1.1       cgd 				refresh();
     78       1.4     lukem 				clrest();
     79       1.1       cgd 			}
     80       1.4     lukem 			if ((!tflag) || curr == 19) {
     81  1.9.12.1       tls 				proll(mm);
     82       1.4     lukem 				writec('\t');
     83       1.4     lukem 			} else
     84       1.4     lukem 				curmove(curr > 19 ? curr - 2 : curr + 4, 25);
     85  1.9.12.1       tls 			getmove(mm);
     86       1.1       cgd 			if (cturn == 0)
     87       1.1       cgd 				leave();
     88       1.1       cgd 			continue;
     89       1.1       cgd 		}
     90       1.1       cgd 		if (tflag)
     91       1.4     lukem 			curmove(18, 0);
     92       1.9       mrg 		wrtext(*test[i].com);
     93       1.4     lukem 		if (!tflag)
     94       1.4     lukem 			writec('\n');
     95       1.1       cgd 		if (i == maxmoves)
     96       1.1       cgd 			break;
     97  1.9.12.1       tls 		mm->D0 = test[i].roll1;
     98  1.9.12.1       tls 		mm->D1 = test[i].roll2;
     99  1.9.12.1       tls 		mm->d0 = 0;
    100  1.9.12.1       tls 		mm->mvlim = 0;
    101       1.4     lukem 		for (j = 0; j < 4; j++) {
    102       1.1       cgd 			if (test[i].mp[j] == test[i].mg[j])
    103       1.1       cgd 				break;
    104  1.9.12.1       tls 			mm->p[j] = test[i].mp[j];
    105  1.9.12.1       tls 			mm->g[j] = test[i].mg[j];
    106  1.9.12.1       tls 			mm->mvlim++;
    107       1.1       cgd 		}
    108  1.9.12.1       tls 		if (mm->mvlim)
    109  1.9.12.1       tls 			for (j = 0; j < mm->mvlim; j++)
    110  1.9.12.1       tls 				if (makmove(mm, j))
    111       1.4     lukem 					writel("AARGH!!!\n");
    112       1.1       cgd 		if (tflag)
    113       1.1       cgd 			refresh();
    114       1.1       cgd 		nexturn();
    115  1.9.12.1       tls 		mm->D0 = test[i].new1;
    116  1.9.12.1       tls 		mm->D1 = test[i].new2;
    117  1.9.12.1       tls 		mm->d0 = 0;
    118       1.1       cgd 		i++;
    119  1.9.12.1       tls 		mm->mvlim = movallow(mm);
    120  1.9.12.1       tls 		if (mm->mvlim) {
    121       1.1       cgd 			if (tflag)
    122       1.1       cgd 				clrest();
    123  1.9.12.1       tls 			proll(mm);
    124       1.1       cgd 			writec('\t');
    125  1.9.12.1       tls 			getmove(mm);
    126       1.1       cgd 			if (tflag)
    127       1.1       cgd 				refresh();
    128       1.1       cgd 			if (cturn == 0)
    129       1.1       cgd 				leave();
    130       1.1       cgd 		}
    131       1.1       cgd 	}
    132       1.1       cgd 	leave();
    133       1.1       cgd }
    134       1.1       cgd 
    135       1.8  dholland static void
    136       1.7       jmc clrest(void)
    137       1.4     lukem {
    138       1.4     lukem 	int     r, c, j;
    139       1.1       cgd 
    140       1.1       cgd 	r = curr;
    141       1.1       cgd 	c = curc;
    142       1.4     lukem 	for (j = r + 1; j < 24; j++) {
    143       1.4     lukem 		curmove(j, 0);
    144       1.1       cgd 		cline();
    145       1.1       cgd 	}
    146       1.4     lukem 	curmove(r, c);
    147       1.1       cgd }
    148       1.1       cgd 
    149       1.8  dholland static int
    150       1.7       jmc brdeq(const int *b1, const int *b2)
    151       1.1       cgd {
    152       1.5   hubertf 	const int    *e;
    153       1.1       cgd 
    154       1.4     lukem 	e = b1 + 26;
    155       1.1       cgd 	while (b1 < e)
    156       1.1       cgd 		if (*b1++ != *b2++)
    157       1.4     lukem 			return (0);
    158       1.4     lukem 	return (1);
    159       1.1       cgd }
    160