1 /* @(#)tutor.c 8.1 (Berkeley) 5/31/93 */
2 /* $NetBSD: tutor.c,v 1.11 2012/10/13 19:19:39 dholland Exp $ */
5 * Copyright (c) 1980, 1993
6 * The Regents of the University of California. All rights reserved.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. Neither the name of the University nor the names of its contributors
17 * may be used to endorse or promote products derived from this software
18 * without specific prior written permission.
20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 static const char better[] =
37 "That is a legal move, but there is a better one.\n";
39 static int brdeq(const int *, const int *);
40 static void clrest(void);
43 tutor(struct move *mm)
62 if (!brdeq(test[i].brd, board)) {
63 if (tflag && curr == 23)
67 movback(mm, mm->mvlim);
72 if ((!tflag) || curr == 19) {
76 curmove(curr > 19 ? curr - 2 : curr + 4, 25);
89 mm->D0 = test[i].roll1;
90 mm->D1 = test[i].roll2;
93 for (j = 0; j < 4; j++) {
94 if (test[i].mp[j] == test[i].mg[j])
96 mm->p[j] = test[i].mp[j];
97 mm->g[j] = test[i].mg[j];
101 for (j = 0; j < mm->mvlim; j++)
103 writel("AARGH!!!\n");
107 mm->D0 = test[i].new1;
108 mm->D1 = test[i].new2;
111 mm->mvlim = movallow(mm);
134 for (j = r + 1; j < 24; j++) {
142 brdeq(const int *b1, const int *b2)