tutor.c revision 1.7 1 1.7 jmc /* $NetBSD: tutor.c,v 1.7 2005/07/01 01:12:39 jmc 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.7 jmc __RCSID("$NetBSD: tutor.c,v 1.7 2005/07/01 01:12:39 jmc 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.4 lukem void
48 1.7 jmc tutor(void)
49 1.4 lukem {
50 1.4 lukem int i, j;
51 1.1 cgd
52 1.1 cgd i = 0;
53 1.1 cgd begscr = 18;
54 1.1 cgd cturn = -1;
55 1.1 cgd home = 0;
56 1.1 cgd bar = 25;
57 1.1 cgd inptr = &in[0];
58 1.1 cgd inopp = &in[1];
59 1.1 cgd offptr = &off[0];
60 1.1 cgd offopp = &off[1];
61 1.1 cgd Colorptr = &color[0];
62 1.1 cgd colorptr = &color[2];
63 1.1 cgd colen = 5;
64 1.1 cgd wrboard();
65 1.1 cgd
66 1.4 lukem while (1) {
67 1.4 lukem if (!brdeq(test[i].brd, board)) {
68 1.1 cgd if (tflag && curr == 23)
69 1.4 lukem curmove(18, 0);
70 1.4 lukem writel(better);
71 1.1 cgd nexturn();
72 1.4 lukem movback(mvlim);
73 1.4 lukem if (tflag) {
74 1.1 cgd refresh();
75 1.4 lukem clrest();
76 1.1 cgd }
77 1.4 lukem if ((!tflag) || curr == 19) {
78 1.1 cgd proll();
79 1.4 lukem writec('\t');
80 1.4 lukem } else
81 1.4 lukem 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.4 lukem curmove(18, 0);
89 1.4 lukem text(*test[i].com);
90 1.4 lukem if (!tflag)
91 1.4 lukem 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.4 lukem 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.4 lukem 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.4 lukem 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.4 lukem void
133 1.7 jmc clrest(void)
134 1.4 lukem {
135 1.4 lukem int r, c, j;
136 1.1 cgd
137 1.1 cgd r = curr;
138 1.1 cgd c = curc;
139 1.4 lukem for (j = r + 1; j < 24; j++) {
140 1.4 lukem curmove(j, 0);
141 1.1 cgd cline();
142 1.1 cgd }
143 1.4 lukem curmove(r, c);
144 1.1 cgd }
145 1.1 cgd
146 1.4 lukem int
147 1.7 jmc brdeq(const int *b1, const int *b2)
148 1.1 cgd {
149 1.5 hubertf const int *e;
150 1.1 cgd
151 1.4 lukem e = b1 + 26;
152 1.1 cgd while (b1 < e)
153 1.1 cgd if (*b1++ != *b2++)
154 1.4 lukem return (0);
155 1.4 lukem return (1);
156 1.1 cgd }
157