1994-09-04 04:03:31 +00:00
|
|
|
|
/*
|
|
|
|
|
* 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. All advertising materials mentioning features or use of this software
|
|
|
|
|
* must display the following acknowledgement:
|
|
|
|
|
* This product includes software developed by the University of
|
|
|
|
|
* California, Berkeley and its contributors.
|
|
|
|
|
* 4. 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.
|
|
|
|
|
*/
|
|
|
|
|
|
|
|
|
|
#ifndef lint
|
1999-11-30 03:50:02 +00:00
|
|
|
|
#if 0
|
1994-09-04 04:03:31 +00:00
|
|
|
|
static char sccsid[] = "@(#)ttext2.c 8.1 (Berkeley) 5/31/93";
|
1999-11-30 03:50:02 +00:00
|
|
|
|
#endif
|
|
|
|
|
static const char rcsid[] =
|
|
|
|
|
"$FreeBSD$";
|
1994-09-04 04:03:31 +00:00
|
|
|
|
#endif /* not lint */
|
|
|
|
|
|
|
|
|
|
#include "back.h"
|
|
|
|
|
|
2001-09-03 14:19:46 +00:00
|
|
|
|
extern const char *const list[];
|
|
|
|
|
char *prompt, *opts;
|
1994-09-04 04:03:31 +00:00
|
|
|
|
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const doubl[] = {
|
1994-09-04 04:03:31 +00:00
|
|
|
|
"\nDoubling:",
|
|
|
|
|
"\n If a player thinks he is in a good position, he may double the",
|
|
|
|
|
"value of the game. However, his opponent may not accept the pro-",
|
|
|
|
|
"posal and forfeit the game before the price gets too high. A",
|
|
|
|
|
"player must double before he rolls, and once his double has been",
|
|
|
|
|
"accepted, he cannot double again, until his opponent has doubled.",
|
|
|
|
|
"Thus, unless the game swings back and forth in advantage between",
|
|
|
|
|
"the two players a great deal, the value of the game should be",
|
|
|
|
|
"low. At any rate, the value of the game will never go above 64,",
|
|
|
|
|
"or six doubles. However, if a player wins a backgammon at 64",
|
|
|
|
|
"points, he wins 192 points!",
|
|
|
|
|
"",
|
|
|
|
|
0};
|
|
|
|
|
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const stragy[] = {
|
1994-09-04 04:03:31 +00:00
|
|
|
|
"\nStrategy:",
|
|
|
|
|
"\n Some general hints when playing: Try not to leave men open",
|
|
|
|
|
"unless absolutely necessary. Also, it is good to make as many",
|
|
|
|
|
"points as possible. Often, two men from different positions can",
|
|
|
|
|
"be brought together to form a new point. Although walls (six",
|
|
|
|
|
"points in a row) are difficult to form, many points nestled close-",
|
|
|
|
|
"ly together produce a formidable barrier. Also, while it is good",
|
|
|
|
|
"to move back men forward, doing so lessens the opportunity for you",
|
|
|
|
|
"to hit men. Finally, remember that once the two player's have",
|
|
|
|
|
"passed each other on the board, there is no chance of either team",
|
|
|
|
|
"being hit, so the game reduces to a race off the board. Addi-",
|
|
|
|
|
"tional hints on strategy are presented in the practice game.",
|
|
|
|
|
"",
|
|
|
|
|
0};
|
|
|
|
|
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const prog[] = {
|
1994-09-04 04:03:31 +00:00
|
|
|
|
"\nThe Program and How It Works:",
|
|
|
|
|
"\n A general rule of thumb is when you don't know what to do,",
|
|
|
|
|
"type a question mark, and you should get some help. When it is",
|
|
|
|
|
"your turn, only your color will be printed out, with nothing",
|
|
|
|
|
"after it. You may double by typing a 'd', but if you type a",
|
|
|
|
|
"space or newline, you will get your roll. (Remember, you must",
|
|
|
|
|
"double before you roll.) Also, typing a 'r' will reprint the",
|
|
|
|
|
"board, and a 'q' will quit the game. The program will type",
|
|
|
|
|
"'Move:' when it wants your move, and you may indicate each die's",
|
|
|
|
|
"move with <s>-<f>, where <s> is the starting position and <f> is",
|
|
|
|
|
"the finishing position, or <s>/<r> where <r> is the roll made.",
|
|
|
|
|
"<s>-<f1>-<f2> is short for <s>-<f1>,<f1>-<f2> and <s>/<r1><r2> is",
|
|
|
|
|
"short for <s>/<r1>,<s>/<r2>. Moves may be separated by a comma",
|
|
|
|
|
"or a space.",
|
|
|
|
|
"",
|
|
|
|
|
"\n While typing, any input which does not make sense will not be",
|
|
|
|
|
"echoed, and a bell will sound instead. Also, backspacing and",
|
|
|
|
|
"killing lines will echo differently than normal. You may examine",
|
|
|
|
|
"the board by typing a 'r' if you have made a partial move, or be-",
|
|
|
|
|
"fore you type a newline, to see what the board looks like. You",
|
|
|
|
|
"must end your move with a newline. If you cannot double, your",
|
|
|
|
|
"roll will always be printed, and you will not be given the oppor-",
|
|
|
|
|
"tunity to double. Home and bar are represented by the appropri-",
|
|
|
|
|
"ate number, 0 or 25 as the case may be, or by the letters 'h' or",
|
|
|
|
|
"'b' as appropriate. You may also type 'r' or 'q' when the program",
|
|
|
|
|
"types 'Move:', which has the same effect as above. Finally, you",
|
|
|
|
|
"will get to decide if you want to play red or white (or both if you",
|
|
|
|
|
"want to play a friend) at the beginning of the session, and you",
|
|
|
|
|
"will not get to change your mind later, since the computer keeps",
|
|
|
|
|
"score.",
|
|
|
|
|
"",
|
|
|
|
|
0};
|
|
|
|
|
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const lastch[] = {
|
1994-09-04 04:03:31 +00:00
|
|
|
|
"\nTutorial (Practice Game):",
|
|
|
|
|
"\n This tutorial, for simplicity's sake, will let you play one",
|
|
|
|
|
"predetermined game. All the rolls have been pre-arranged, and",
|
|
|
|
|
"only one response will let you advance to the next move.",
|
|
|
|
|
"Although a given roll will may have several legal moves, the tu-",
|
|
|
|
|
"torial will only accept one (not including the same moves in a",
|
|
|
|
|
"different order), claiming that that move is 'best.' Obviously,",
|
|
|
|
|
"a subjective statement. At any rate, be patient with it and have",
|
|
|
|
|
"fun learning about backgammon. Also, to speed things up a lit-",
|
|
|
|
|
"tle, doubling will not take place in the tutorial, so you will",
|
|
|
|
|
"never get that opportunity, and quitting only leaves the tutori-",
|
|
|
|
|
"al, not the game. You will still be able to play backgammon",
|
|
|
|
|
"after quitting.",
|
|
|
|
|
"\n This is your last chance to look over the rules before the tu-",
|
|
|
|
|
"torial starts.",
|
|
|
|
|
"",
|
|
|
|
|
0};
|
|
|
|
|
|
1999-04-19 03:59:02 +00:00
|
|
|
|
int
|
1994-09-04 04:03:31 +00:00
|
|
|
|
text (txt)
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const *txt;
|
1994-09-04 04:03:31 +00:00
|
|
|
|
|
|
|
|
|
{
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *const *begin;
|
|
|
|
|
const char *a;
|
1994-09-04 04:03:31 +00:00
|
|
|
|
char b;
|
1999-04-19 03:59:02 +00:00
|
|
|
|
const char *c;
|
1994-09-04 04:03:31 +00:00
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
fixtty (noech);
|
|
|
|
|
begin = txt;
|
|
|
|
|
while (*txt) {
|
|
|
|
|
a = *(txt++);
|
|
|
|
|
if (*a != '\0') {
|
|
|
|
|
c = a;
|
|
|
|
|
for (i = 0; *(c++) != '\0'; i--);
|
|
|
|
|
writel (a);
|
|
|
|
|
writec ('\n');
|
|
|
|
|
} else {
|
|
|
|
|
fixtty (raw);
|
|
|
|
|
writel (prompt);
|
|
|
|
|
for (;;) {
|
|
|
|
|
if ((b = readc()) == '?') {
|
|
|
|
|
if (tflag) {
|
|
|
|
|
if (begscr) {
|
|
|
|
|
curmove (18,0);
|
|
|
|
|
clend();
|
|
|
|
|
} else
|
|
|
|
|
clear();
|
|
|
|
|
} else
|
|
|
|
|
writec ('\n');
|
|
|
|
|
text (list);
|
|
|
|
|
writel (prompt);
|
|
|
|
|
continue;
|
|
|
|
|
}
|
|
|
|
|
i = 0;
|
|
|
|
|
if (b == '\n')
|
|
|
|
|
break;
|
|
|
|
|
while (i < 11) {
|
|
|
|
|
if (b == opts[i])
|
|
|
|
|
break;
|
|
|
|
|
i++;
|
|
|
|
|
}
|
|
|
|
|
if (i == 11)
|
|
|
|
|
writec ('\007');
|
|
|
|
|
else
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
if (tflag) {
|
|
|
|
|
if (begscr) {
|
|
|
|
|
curmove (18,0);
|
|
|
|
|
clend();
|
|
|
|
|
} else
|
|
|
|
|
clear();
|
|
|
|
|
} else
|
|
|
|
|
writec ('\n');
|
|
|
|
|
if (i)
|
|
|
|
|
return(i);
|
|
|
|
|
fixtty (noech);
|
|
|
|
|
if (tflag)
|
|
|
|
|
curmove (curr,0);
|
|
|
|
|
begin = txt;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
fixtty (raw);
|
|
|
|
|
return (0);
|
|
|
|
|
}
|