mirror of
https://github.com/vattam/BSDGames.git
synced 2025-12-20 19:04:49 +00:00
Initial revision
git-svn-id: file:///srv/svn/joey/bsdgames-trunk@5086 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
joey
574
mille/move.c
Normal file
574
mille/move.c
Normal file
@@ -0,0 +1,574 @@
|
||||
/* $NetBSD: move.c,v 1.7 1997/10/12 00:54:21 lukem Exp $ */
|
||||
|
||||
/*
|
||||
* Copyright (c) 1983, 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.
|
||||
*/
|
||||
|
||||
#include <sys/cdefs.h>
|
||||
#ifndef lint
|
||||
#if 0
|
||||
static char sccsid[] = "@(#)move.c 8.1 (Berkeley) 5/31/93";
|
||||
#else
|
||||
__RCSID("$NetBSD: move.c,v 1.7 1997/10/12 00:54:21 lukem Exp $");
|
||||
#endif
|
||||
#endif /* not lint */
|
||||
|
||||
#include <termios.h>
|
||||
|
||||
#include "mille.h"
|
||||
#ifndef unctrl
|
||||
#include "unctrl.h"
|
||||
#endif
|
||||
|
||||
# ifdef attron
|
||||
# include <term.h>
|
||||
# endif attron
|
||||
|
||||
/*
|
||||
* @(#)move.c 1.2 (Berkeley) 3/28/83
|
||||
*/
|
||||
|
||||
#undef CTRL
|
||||
#define CTRL(c) (c - 'A' + 1)
|
||||
|
||||
void
|
||||
domove()
|
||||
{
|
||||
PLAY *pp;
|
||||
int i, j;
|
||||
bool goodplay;
|
||||
|
||||
pp = &Player[Play];
|
||||
if (Play == PLAYER)
|
||||
getmove();
|
||||
else
|
||||
calcmove();
|
||||
Next = FALSE;
|
||||
goodplay = TRUE;
|
||||
switch (Movetype) {
|
||||
case M_DISCARD:
|
||||
if (haspicked(pp)) {
|
||||
if (pp->hand[Card_no] == C_INIT)
|
||||
if (Card_no == 6)
|
||||
Finished = TRUE;
|
||||
else
|
||||
error("no card there");
|
||||
else {
|
||||
if (is_safety(pp->hand[Card_no])) {
|
||||
error("discard a safety?");
|
||||
goodplay = FALSE;
|
||||
break;
|
||||
}
|
||||
Discard = pp->hand[Card_no];
|
||||
pp->hand[Card_no] = C_INIT;
|
||||
Next = TRUE;
|
||||
if (Play == PLAYER)
|
||||
account(Discard);
|
||||
}
|
||||
}
|
||||
else
|
||||
error("must pick first");
|
||||
break;
|
||||
case M_PLAY:
|
||||
goodplay = playcard(pp);
|
||||
break;
|
||||
case M_DRAW:
|
||||
Card_no = 0;
|
||||
if (Topcard <= Deck)
|
||||
error("no more cards");
|
||||
else if (haspicked(pp))
|
||||
error("already picked");
|
||||
else {
|
||||
pp->hand[0] = *--Topcard;
|
||||
#ifdef DEBUG
|
||||
if (Debug)
|
||||
fprintf(outf, "DOMOVE: Draw %s\n", C_name[*Topcard]);
|
||||
#endif
|
||||
acc:
|
||||
if (Play == COMP) {
|
||||
account(*Topcard);
|
||||
if (is_safety(*Topcard))
|
||||
pp->safety[*Topcard-S_CONV] = S_IN_HAND;
|
||||
}
|
||||
if (pp->hand[1] == C_INIT && Topcard > Deck) {
|
||||
Card_no = 1;
|
||||
pp->hand[1] = *--Topcard;
|
||||
#ifdef DEBUG
|
||||
if (Debug)
|
||||
fprintf(outf, "DOMOVE: Draw %s\n", C_name[*Topcard]);
|
||||
#endif
|
||||
goto acc;
|
||||
}
|
||||
pp->new_battle = FALSE;
|
||||
pp->new_speed = FALSE;
|
||||
}
|
||||
break;
|
||||
|
||||
case M_ORDER:
|
||||
break;
|
||||
}
|
||||
/*
|
||||
* move blank card to top by one of two methods. If the
|
||||
* computer's hand was sorted, the randomness for picking
|
||||
* between equally valued cards would be lost
|
||||
*/
|
||||
if (Order && Movetype != M_DRAW && goodplay && pp == &Player[PLAYER])
|
||||
sort(pp->hand);
|
||||
else
|
||||
for (i = 1; i < HAND_SZ; i++)
|
||||
if (pp->hand[i] == C_INIT) {
|
||||
for (j = 0; pp->hand[j] == C_INIT; j++)
|
||||
if (j >= HAND_SZ) {
|
||||
j = 0;
|
||||
break;
|
||||
}
|
||||
pp->hand[i] = pp->hand[j];
|
||||
pp->hand[j] = C_INIT;
|
||||
}
|
||||
if (Topcard <= Deck)
|
||||
check_go();
|
||||
if (Next)
|
||||
nextplay();
|
||||
}
|
||||
|
||||
/*
|
||||
* Check and see if either side can go. If they cannot,
|
||||
* the game is over
|
||||
*/
|
||||
void
|
||||
check_go()
|
||||
{
|
||||
CARD card;
|
||||
PLAY *pp, *op;
|
||||
int i;
|
||||
|
||||
for (pp = Player; pp < &Player[2]; pp++) {
|
||||
op = (pp == &Player[COMP] ? &Player[PLAYER] : &Player[COMP]);
|
||||
for (i = 0; i < HAND_SZ; i++) {
|
||||
card = pp->hand[i];
|
||||
if (is_safety(card) || canplay(pp, op, card)) {
|
||||
#ifdef DEBUG
|
||||
if (Debug) {
|
||||
fprintf(outf, "CHECK_GO: can play %s (%d), ", C_name[card], card);
|
||||
fprintf(outf, "is_safety(card) = %d, ", is_safety(card));
|
||||
fprintf(outf, "canplay(pp, op, card) = %d\n", canplay(pp, op, card));
|
||||
}
|
||||
#endif
|
||||
return;
|
||||
}
|
||||
#ifdef DEBUG
|
||||
else if (Debug)
|
||||
fprintf(outf, "CHECK_GO: cannot play %s\n",
|
||||
C_name[card]);
|
||||
#endif
|
||||
}
|
||||
}
|
||||
Finished = TRUE;
|
||||
}
|
||||
|
||||
int
|
||||
playcard(pp)
|
||||
PLAY *pp;
|
||||
{
|
||||
int v;
|
||||
CARD card;
|
||||
|
||||
/*
|
||||
* check and see if player has picked
|
||||
*/
|
||||
switch (pp->hand[Card_no]) {
|
||||
default:
|
||||
if (!haspicked(pp))
|
||||
mustpick:
|
||||
return error("must pick first");
|
||||
case C_GAS_SAFE: case C_SPARE_SAFE:
|
||||
case C_DRIVE_SAFE: case C_RIGHT_WAY:
|
||||
break;
|
||||
}
|
||||
|
||||
card = pp->hand[Card_no];
|
||||
#ifdef DEBUG
|
||||
if (Debug)
|
||||
fprintf(outf, "PLAYCARD: Card = %s\n", C_name[card]);
|
||||
#endif
|
||||
Next = FALSE;
|
||||
switch (card) {
|
||||
case C_200:
|
||||
if (pp->nummiles[C_200] == 2)
|
||||
return error("only two 200's per hand");
|
||||
case C_100: case C_75:
|
||||
if (pp->speed == C_LIMIT)
|
||||
return error("limit of 50");
|
||||
case C_50:
|
||||
if (pp->mileage + Value[card] > End)
|
||||
return error("puts you over %d", End);
|
||||
case C_25:
|
||||
if (!pp->can_go)
|
||||
return error("cannot move now");
|
||||
pp->nummiles[card]++;
|
||||
v = Value[card];
|
||||
pp->total += v;
|
||||
pp->hand_tot += v;
|
||||
if ((pp->mileage += v) == End)
|
||||
check_ext(FALSE);
|
||||
break;
|
||||
|
||||
case C_GAS: case C_SPARE: case C_REPAIRS:
|
||||
if (pp->battle != opposite(card))
|
||||
return error("can't play \"%s\"", C_name[card]);
|
||||
pp->battle = card;
|
||||
if (pp->safety[S_RIGHT_WAY] == S_PLAYED)
|
||||
pp->can_go = TRUE;
|
||||
break;
|
||||
|
||||
case C_GO:
|
||||
if (pp->battle != C_INIT && pp->battle != C_STOP
|
||||
&& !is_repair(pp->battle))
|
||||
return error("cannot play \"Go\" on a \"%s\"",
|
||||
C_name[pp->battle]);
|
||||
pp->battle = C_GO;
|
||||
pp->can_go = TRUE;
|
||||
break;
|
||||
|
||||
case C_END_LIMIT:
|
||||
if (pp->speed != C_LIMIT)
|
||||
return error("not limited");
|
||||
pp->speed = C_END_LIMIT;
|
||||
break;
|
||||
|
||||
case C_EMPTY: case C_FLAT: case C_CRASH:
|
||||
case C_STOP:
|
||||
pp = &Player[other(Play)];
|
||||
if (!pp->can_go)
|
||||
return error("opponent cannot go");
|
||||
else if (pp->safety[safety(card) - S_CONV] == S_PLAYED)
|
||||
protected:
|
||||
return error("opponent is protected");
|
||||
pp->battle = card;
|
||||
pp->new_battle = TRUE;
|
||||
pp->can_go = FALSE;
|
||||
pp = &Player[Play];
|
||||
break;
|
||||
|
||||
case C_LIMIT:
|
||||
pp = &Player[other(Play)];
|
||||
if (pp->speed == C_LIMIT)
|
||||
return error("opponent has limit");
|
||||
if (pp->safety[S_RIGHT_WAY] == S_PLAYED)
|
||||
goto protected;
|
||||
pp->speed = C_LIMIT;
|
||||
pp->new_speed = TRUE;
|
||||
pp = &Player[Play];
|
||||
break;
|
||||
|
||||
case C_GAS_SAFE: case C_SPARE_SAFE:
|
||||
case C_DRIVE_SAFE: case C_RIGHT_WAY:
|
||||
if (pp->battle == opposite(card)
|
||||
|| (card == C_RIGHT_WAY && pp->speed == C_LIMIT)) {
|
||||
if (!(card == C_RIGHT_WAY && !is_repair(pp->battle))) {
|
||||
pp->battle = C_GO;
|
||||
pp->can_go = TRUE;
|
||||
}
|
||||
if (card == C_RIGHT_WAY && pp->speed == C_LIMIT)
|
||||
pp->speed = C_INIT;
|
||||
if (pp->new_battle
|
||||
|| (pp->new_speed && card == C_RIGHT_WAY)) {
|
||||
pp->coups[card - S_CONV] = TRUE;
|
||||
pp->total += SC_COUP;
|
||||
pp->hand_tot += SC_COUP;
|
||||
pp->coupscore += SC_COUP;
|
||||
}
|
||||
}
|
||||
/*
|
||||
* if not coup, must pick first
|
||||
*/
|
||||
else if (pp->hand[0] == C_INIT && Topcard > Deck)
|
||||
goto mustpick;
|
||||
pp->safety[card - S_CONV] = S_PLAYED;
|
||||
pp->total += SC_SAFETY;
|
||||
pp->hand_tot += SC_SAFETY;
|
||||
if ((pp->safescore += SC_SAFETY) == NUM_SAFE * SC_SAFETY) {
|
||||
pp->total += SC_ALL_SAFE;
|
||||
pp->hand_tot += SC_ALL_SAFE;
|
||||
}
|
||||
if (card == C_RIGHT_WAY) {
|
||||
if (pp->speed == C_LIMIT)
|
||||
pp->speed = C_INIT;
|
||||
if (pp->battle == C_STOP || pp->battle == C_INIT) {
|
||||
pp->can_go = TRUE;
|
||||
pp->battle = C_INIT;
|
||||
}
|
||||
if (!pp->can_go && is_repair(pp->battle))
|
||||
pp->can_go = TRUE;
|
||||
}
|
||||
Next = -1;
|
||||
break;
|
||||
|
||||
case C_INIT:
|
||||
error("no card there");
|
||||
Next = -1;
|
||||
break;
|
||||
}
|
||||
if (pp == &Player[PLAYER])
|
||||
account(card);
|
||||
pp->hand[Card_no] = C_INIT;
|
||||
Next = (Next == (bool)-1 ? FALSE : TRUE);
|
||||
return TRUE;
|
||||
}
|
||||
|
||||
void
|
||||
getmove()
|
||||
{
|
||||
char c;
|
||||
#ifdef EXTRAP
|
||||
static bool last_ex = FALSE; /* set if last command was E */
|
||||
|
||||
if (last_ex) {
|
||||
undoex();
|
||||
prboard();
|
||||
last_ex = FALSE;
|
||||
}
|
||||
#endif
|
||||
for (;;) {
|
||||
prompt(MOVEPROMPT);
|
||||
leaveok(Board, FALSE);
|
||||
refresh();
|
||||
while ((c = readch()) == killchar() || c == erasechar())
|
||||
continue;
|
||||
if (islower(c))
|
||||
c = toupper(c);
|
||||
if (isprint(c) && !isspace(c)) {
|
||||
addch(c);
|
||||
refresh();
|
||||
}
|
||||
switch (c) {
|
||||
case 'P': /* Pick */
|
||||
Movetype = M_DRAW;
|
||||
goto ret;
|
||||
case 'U': /* Use Card */
|
||||
case 'D': /* Discard Card */
|
||||
if ((Card_no = getcard()) < 0)
|
||||
break;
|
||||
Movetype = (c == 'U' ? M_PLAY : M_DISCARD);
|
||||
goto ret;
|
||||
case 'O': /* Order */
|
||||
Order = !Order;
|
||||
if (Window == W_SMALL) {
|
||||
if (!Order)
|
||||
mvwaddstr(Score, 12, 21,
|
||||
"o: order hand");
|
||||
else
|
||||
mvwaddstr(Score, 12, 21,
|
||||
"o: stop ordering");
|
||||
wclrtoeol(Score);
|
||||
}
|
||||
Movetype = M_ORDER;
|
||||
goto ret;
|
||||
case 'Q': /* Quit */
|
||||
rub(0); /* Same as a rubout */
|
||||
break;
|
||||
case 'W': /* Window toggle */
|
||||
Window = nextwin(Window);
|
||||
newscore();
|
||||
prscore(TRUE);
|
||||
wrefresh(Score);
|
||||
break;
|
||||
case 'R': /* Redraw screen */
|
||||
case CTRL('L'):
|
||||
wrefresh(curscr);
|
||||
break;
|
||||
case 'S': /* Save game */
|
||||
On_exit = FALSE;
|
||||
save();
|
||||
break;
|
||||
case 'E': /* Extrapolate */
|
||||
#ifdef EXTRAP
|
||||
if (last_ex)
|
||||
break;
|
||||
Finished = TRUE;
|
||||
if (Window != W_FULL)
|
||||
newscore();
|
||||
prscore(FALSE);
|
||||
wrefresh(Score);
|
||||
last_ex = TRUE;
|
||||
Finished = FALSE;
|
||||
#else
|
||||
error("%c: command not implemented", c);
|
||||
#endif
|
||||
break;
|
||||
case '\r': /* Ignore RETURNs and */
|
||||
case '\n': /* Line Feeds */
|
||||
case ' ': /* Spaces */
|
||||
case '\0': /* and nulls */
|
||||
break;
|
||||
#ifdef DEBUG
|
||||
case 'Z': /* Debug code */
|
||||
if (!Debug && outf == NULL) {
|
||||
char buf[MAXPATHLEN];
|
||||
|
||||
prompt(FILEPROMPT);
|
||||
leaveok(Board, FALSE);
|
||||
refresh();
|
||||
sp = buf;
|
||||
while ((*sp = readch()) != '\n') {
|
||||
if (*sp == killchar())
|
||||
goto over;
|
||||
else if (*sp == erasechar()) {
|
||||
if (--sp < buf)
|
||||
sp = buf;
|
||||
else {
|
||||
addch('\b');
|
||||
if (*sp < ' ')
|
||||
addch('\b');
|
||||
clrtoeol();
|
||||
}
|
||||
}
|
||||
else
|
||||
addstr(unctrl(*sp++));
|
||||
refresh();
|
||||
}
|
||||
*sp = '\0';
|
||||
leaveok(Board, TRUE);
|
||||
if ((outf = fopen(buf, "w")) == NULL)
|
||||
warn("%s", buf);
|
||||
setbuf(outf, (char *)NULL);
|
||||
}
|
||||
Debug = !Debug;
|
||||
break;
|
||||
#endif
|
||||
default:
|
||||
error("unknown command: %s", unctrl(c));
|
||||
break;
|
||||
}
|
||||
}
|
||||
ret:
|
||||
leaveok(Board, TRUE);
|
||||
}
|
||||
|
||||
/*
|
||||
* return whether or not the player has picked
|
||||
*/
|
||||
int
|
||||
haspicked(pp)
|
||||
const PLAY *pp;
|
||||
{
|
||||
int card;
|
||||
|
||||
if (Topcard <= Deck)
|
||||
return TRUE;
|
||||
switch (pp->hand[Card_no]) {
|
||||
case C_GAS_SAFE: case C_SPARE_SAFE:
|
||||
case C_DRIVE_SAFE: case C_RIGHT_WAY:
|
||||
card = 1;
|
||||
break;
|
||||
default:
|
||||
card = 0;
|
||||
break;
|
||||
}
|
||||
return (pp->hand[card] != C_INIT);
|
||||
}
|
||||
|
||||
void
|
||||
account(card)
|
||||
CARD card;
|
||||
{
|
||||
CARD oppos;
|
||||
|
||||
if (card == C_INIT)
|
||||
return;
|
||||
++Numseen[card];
|
||||
if (Play == COMP)
|
||||
switch (card) {
|
||||
case C_GAS_SAFE:
|
||||
case C_SPARE_SAFE:
|
||||
case C_DRIVE_SAFE:
|
||||
oppos = opposite(card);
|
||||
Numgos += Numcards[oppos] - Numseen[oppos];
|
||||
break;
|
||||
case C_CRASH:
|
||||
case C_FLAT:
|
||||
case C_EMPTY:
|
||||
case C_STOP:
|
||||
Numgos++;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
prompt(promptno)
|
||||
int promptno;
|
||||
{
|
||||
static const char *const names[] = {
|
||||
">>:Move:",
|
||||
"Really?",
|
||||
"Another hand?",
|
||||
"Another game?",
|
||||
"Save game?",
|
||||
"Same file?",
|
||||
"file:",
|
||||
"Extension?",
|
||||
"Overwrite file?",
|
||||
};
|
||||
static int last_prompt = -1;
|
||||
|
||||
if (promptno == last_prompt)
|
||||
move(MOVE_Y, MOVE_X + strlen(names[promptno]) + 1);
|
||||
else {
|
||||
move(MOVE_Y, MOVE_X);
|
||||
if (promptno == MOVEPROMPT)
|
||||
standout();
|
||||
addstr(names[promptno]);
|
||||
if (promptno == MOVEPROMPT)
|
||||
standend();
|
||||
addch(' ');
|
||||
last_prompt = promptno;
|
||||
}
|
||||
clrtoeol();
|
||||
}
|
||||
|
||||
void
|
||||
sort(hand)
|
||||
CARD *hand;
|
||||
{
|
||||
CARD *cp, *tp;
|
||||
CARD temp;
|
||||
|
||||
cp = hand;
|
||||
hand += HAND_SZ;
|
||||
for ( ; cp < &hand[-1]; cp++)
|
||||
for (tp = cp + 1; tp < hand; tp++)
|
||||
if (*cp > *tp) {
|
||||
temp = *cp;
|
||||
*cp = *tp;
|
||||
*tp = temp;
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user