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 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216
|
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "chess.h"
#include "data.h"
/* last modified 01/22/01 */
/*
*******************************************************************************
* *
* OutputMove() is responsible for converting the internal move format to a *
* string that can be displayed. first, it simply converts the from/to *
* squares to fully-qualified algebraic (which includes O-O and O-O-O for *
* castling moves). next, we try several "shortcut" forms and call *
* input_move(silent=1) to let it silently check the move for uniqueness. *
* as soon as we get a non-ambiguous move, we return that text string. *
* *
*******************************************************************************
*/
char *OutputMove(TREE * RESTRICT tree, int move, int ply, int wtm)
{
static char text_move[10], new_text[10];
int *mvp;
char *text;
static const char piece_names[8] = { ' ', 'P', 'N', 'K', ' ', 'B', 'R', 'Q' };
text = text_move;
/*
special case for null-move, used only in tracing the search
by dumping the tree of everything searched.
*/
if (move == 0) {
strcpy(text, "null");
return (text);
}
do {
/*
check for castling first
*/
if ((Piece(move) == king) && (abs(From(move) - To(move)) == 2)) {
if (wtm) {
if (To(move) == 2)
strcpy(text_move, "O-O-O");
else
strcpy(text_move, "O-O");
} else {
if (To(move) == 58)
strcpy(text_move, "O-O-O");
else
strcpy(text_move, "O-O");
}
break;
}
/*
not a castling move. convert to fully-qualified algebraic form
first.
*/
text = new_text;
if ((int) Piece(move) > pawn)
*text++ = piece_names[Piece(move)];
*text++ = File(From(move)) + 'a';
*text++ = Rank(From(move)) + '1';
if (Captured(move))
*text++ = 'x';
*text++ = File(To(move)) + 'a';
*text++ = Rank(To(move)) + '1';
if (Promote(move)) {
*text++ = '=';
*text++ = piece_names[Promote(move)];
}
*text = '\0';
strcpy(text_move, new_text);
if (output_format > 0)
break;
/*
now, try some short forms. if the moving piece is a pawn, and
it is not capturing anything, simply try the destination square
first: (e2e4->e4)
*/
if (Piece(move) == pawn) {
if (!Captured(move)) {
strcpy(text_move, new_text + 2);
if (OutputGood(tree, text_move, ply, wtm))
break;
}
/*
if the move is a pawn capturing a piece, try the short-form for pawn
capture moves: (e4xf5->exf5)
*/
text_move[0] = new_text[0];
strcpy(text_move + 1, new_text + 2);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
punt, return the fully-qualified move.
*/
strcpy(text_move, new_text);
break;
}
/*
if the move is a piece move, but not a capture, then try the short-
form for non-capturing moves: (Ng1f3->Nf3)
*/
if (!Captured(move)) {
text_move[0] = new_text[0];
strcpy(text_move + 1, new_text + 3);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
now try to qualify with the origin file only: (Ng1f3->Ngf3)
*/
text_move[0] = new_text[0];
text_move[1] = new_text[1];
strcpy(text_move + 2, new_text + 3);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
now try to qualify with the origin rank only: (Ng1f3->N1f3)
*/
text_move[0] = new_text[0];
strcpy(text_move + 1, new_text + 2);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
punt, return the fully-qualified move.
*/
strcpy(text_move, new_text);
break;
} else {
/*
if the move is a piece move, and a capture, then try the short-
form for capturing moves: (Ng1xf3->Nxf3)
*/
text_move[0] = new_text[0];
strcpy(text_move + 1, new_text + 3);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
next, try adding in the origin file: (Ng1xf3->Ngxf3)
*/
text_move[0] = new_text[0];
text_move[1] = new_text[1];
strcpy(text_move + 2, new_text + 3);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
next, try adding in the origin rank: (Ng1xf3->N1xf3)
*/
text_move[0] = new_text[0];
strcpy(text_move + 1, new_text + 2);
if (OutputGood(tree, text_move, ply, wtm))
break;
/*
punt, return the fully-qualified move.
*/
strcpy(text_move, new_text);
break;
}
} while (0);
/*
determine if it's a checking move, or if it's mate. if so,
append "+" or "#" as appropriate.
*/
text = text_move + strlen(text_move);
tree->position[MAXPLY] = tree->position[ply];
MakeMove(tree, MAXPLY, move, wtm);
if (Check(Flip(wtm))) {
mvp =
GenerateCheckEvasions(tree, MAXPLY + 1, Flip(wtm),
tree->move_list + 4800);
if (mvp == (tree->move_list + 4800))
*text++ = '#';
else
*text++ = '+';
}
UnmakeMove(tree, MAXPLY, move, wtm);
*text = 0;
return (text_move);
}
/* last modified 03/11/98 */
/*
*******************************************************************************
* *
* OutputMoveICS() is responsible for producing the rather primitive move *
* format that the ics interface wants, namely [from][to][promote]. *
* *
*******************************************************************************
*/
char *OutputMoveICS(int move)
{
static char text_move[10];
char *text;
static const char piece_names[8] = { ' ', 'P', 'N', 'K', ' ', 'B', 'R', 'Q' };
/*
convert to fully-qualified algebraic form first.
*/
text = text_move;
*text++ = File(From(move)) + 'a';
*text++ = Rank(From(move)) + '1';
*text++ = File(To(move)) + 'a';
*text++ = Rank(To(move)) + '1';
if (Promote(move))
*text++ = piece_names[Promote(move)];
*text = '\0';
return (text_move);
}
int OutputGood(TREE * RESTRICT tree, char *text, int ply, int wtm)
{
int new_move;
new_move = InputMove(tree, text, ply, wtm, 1, 0);
return (Piece(new_move));
}
|