summaryrefslogtreecommitdiffstats
path: root/backgammon/teachgammon/tutor.h
blob: d0544bf42da420c4fd1189921faf893abeafe00d (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
/*	$NetBSD: tutor.h,v 1.7 2003/08/07 09:36:59 agc Exp $	*/

/*
 * Copyright (c) 1980, 1993
 *	The Regents of the University of California.  All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in the
 *    documentation and/or other materials provided with the distribution.
 * 3. Neither the name of the University nor the names of its contributors
 *    may be used to endorse or promote products derived from this software
 *    without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 *
 *	@(#)tutor.h	8.1 (Berkeley) 5/31/93
 */

struct situatn {
	int	brd[26];
	int	roll1;
	int	roll2;
	int	mp[4];
	int	mg[4];
	int	new1;
	int	new2;
	const char	*const (*com[8]);
};


extern	const char	*const doubl[];
extern	const char	*const endgame[];
extern	const char	*const finis[];
extern	const char	*const hello[];
extern	const char	*const hits[];
extern	const char	*const intro1[];
extern	const char	*const intro2[];
extern	const char	*const lastch[];
extern	const char	*const list[];
extern	int	 maxmoves;
extern	const char	*const moves[];
extern	const char	*const opts;
extern	const char	*const prog[];
extern	const char	*const prompt;
extern	const char	*const removepiece[];
extern	const char	*const stragy[];
extern	const struct situatn	test[];


int	brdeq __P((const int *, const int *));
void	clrest __P((void));
void	leave __P((void)) __attribute__((__noreturn__));
void	tutor __P((void)) __attribute__((__noreturn__));