check.c revision 1.2 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.2 mycroft /*static char sccsid[] = "from: @(#)check.c 5.4 (Berkeley) 6/1/90";*/
36 1.2 mycroft static char rcsid[] = "$Id: check.c,v 1.2 1993/08/01 18:56:44 mycroft Exp $";
37 1.1 cgd #endif /* not lint */
38 1.1 cgd
39 1.1 cgd #include "back.h"
40 1.1 cgd
41 1.1 cgd getmove () {
42 1.1 cgd register int i, c;
43 1.1 cgd
44 1.1 cgd c = 0;
45 1.1 cgd for (;;) {
46 1.1 cgd i = checkmove(c);
47 1.1 cgd
48 1.1 cgd switch (i) {
49 1.1 cgd case -1:
50 1.1 cgd if (movokay(mvlim)) {
51 1.1 cgd if (tflag)
52 1.1 cgd curmove (20,0);
53 1.1 cgd else
54 1.1 cgd writec ('\n');
55 1.1 cgd for (i = 0; i < mvlim; i++)
56 1.1 cgd if (h[i])
57 1.1 cgd wrhit(g[i]);
58 1.1 cgd nexturn();
59 1.1 cgd if (*offopp == 15)
60 1.1 cgd cturn *= -2;
61 1.1 cgd if (tflag && pnum)
62 1.1 cgd bflag = pnum;
63 1.1 cgd return;
64 1.1 cgd }
65 1.1 cgd
66 1.1 cgd case -4:
67 1.1 cgd case 0:
68 1.1 cgd if (tflag)
69 1.1 cgd refresh();
70 1.1 cgd if (i != 0 && i != -4)
71 1.1 cgd break;
72 1.1 cgd if (tflag)
73 1.1 cgd curmove (20,0);
74 1.1 cgd else
75 1.1 cgd writec ('\n');
76 1.1 cgd writel (*Colorptr);
77 1.1 cgd if (i == -4)
78 1.1 cgd writel (" must make ");
79 1.1 cgd else
80 1.1 cgd writel (" can only make ");
81 1.1 cgd writec (mvlim+'0');
82 1.1 cgd writel (" move");
83 1.1 cgd if (mvlim > 1)
84 1.1 cgd writec ('s');
85 1.1 cgd writec ('.');
86 1.1 cgd writec ('\n');
87 1.1 cgd break;
88 1.1 cgd
89 1.1 cgd case -3:
90 1.1 cgd if (quit())
91 1.1 cgd return;
92 1.1 cgd }
93 1.1 cgd
94 1.1 cgd if (! tflag)
95 1.1 cgd proll ();
96 1.1 cgd else {
97 1.1 cgd curmove (cturn == -1? 18: 19,39);
98 1.1 cgd cline ();
99 1.1 cgd c = -1;
100 1.1 cgd }
101 1.1 cgd }
102 1.1 cgd }
103 1.1 cgd
104 1.1 cgd movokay (mv)
106 1.1 cgd register int mv;
107 1.1 cgd
108 1.1 cgd {
109 1.1 cgd register int i, m;
110 1.1 cgd
111 1.1 cgd if (d0)
112 1.1 cgd swap;
113 1.1 cgd
114 1.1 cgd for (i = 0; i < mv; i++) {
115 1.1 cgd
116 1.1 cgd if (p[i] == g[i]) {
117 1.1 cgd moverr (i);
118 1.1 cgd curmove (20,0);
119 1.1 cgd writel ("Attempt to move to same location.\n");
120 1.1 cgd return (0);
121 1.1 cgd }
122 1.1 cgd
123 1.1 cgd if (cturn*(g[i]-p[i]) < 0) {
124 1.1 cgd moverr (i);
125 1.1 cgd curmove (20,0);
126 1.1 cgd writel ("Backwards move.\n");
127 1.1 cgd return (0);
128 1.1 cgd }
129 1.1 cgd
130 1.1 cgd if (abs(board[bar]) && p[i] != bar) {
131 1.1 cgd moverr (i);
132 1.1 cgd curmove (20,0);
133 1.1 cgd writel ("Men still on bar.\n");
134 1.1 cgd return (0);
135 1.1 cgd }
136 1.1 cgd
137 1.1 cgd if ( (m = makmove(i)) ) {
138 1.1 cgd moverr (i);
139 1.1 cgd switch (m) {
140 1.1 cgd
141 1.1 cgd case 1:
142 1.1 cgd writel ("Move not rolled.\n");
143 1.1 cgd break;
144 1.1 cgd
145 1.1 cgd case 2:
146 1.1 cgd writel ("Bad starting position.\n");
147 1.1 cgd break;
148 1.1 cgd
149 1.1 cgd case 3:
150 1.1 cgd writel ("Destination occupied.\n");
151 1.1 cgd break;
152 1.1 cgd
153 1.1 cgd case 4:
154 1.1 cgd writel ("Can't remove men yet.\n");
155 1.1 cgd }
156 1.1 cgd return (0);
157 1.1 cgd }
158 1.1 cgd }
159 1.1 cgd return (1);
160 }
161