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