void board_disp(const board_t * board) {
int file, rank, sq;
int piece, c;
char fen[256];
ASSERT(board!=NULL);
if (!board_to_fen(board,fen,256)) ASSERT(false);
my_log("POLYGLOT %s\n",fen);
my_log("POLYGLOT\n");
for (rank = 7; rank >= 0; rank--) {
my_log("POLYGLOT ");
for (file = 0; file < 8; file++) {
sq = square_make(file,rank);
piece = board->square[sq];
c = (piece != Empty) ? piece_to_char(piece) : '-';
my_log("%c ",c);
}
my_log("\n");
}
my_log("POLYGLOT\n");
my_log("POLYGLOT %s to play\n",(colour_is_black(board->turn))?"black":"white");
my_log("POLYGLOT\n");
}
void test_divide(int depth)
{
int i,move_count;
move_t ms[MOVE_STACK];
uint64 nodes;
uint64 total_nodes;
int legal_moves;
#ifdef EVASIONS
char strbuff[256];
move_t ms_test[MOVE_STACK];
#endif
if(!depth) return;
nodes = 0;
total_nodes = 0;
legal_moves = 0;
pht_init();
depth -= 1;
timer_start();
#ifdef EVASIONS
if(is_in_check(board->side))
{ move_count = move_gen_evasions(&ms[0]);
if(move_count != move_gen_legal(&ms_test[0]))
{ board_to_fen(&strbuff[0]);
printf("error: \n %s \n",strbuff);
}
}
else
{ move_count = move_gen(&ms[0]);
}
#else
move_count = move_gen(&ms[0]);
#endif
for(i = 0; i < move_count; i++)
{ if(!move_make(ms[i])) continue;
nodes = perft(depth);
print_move(ms[i].p);
legal_moves++;
printf("%I64u",nodes);
printf("\n");
move_undo();
total_nodes += nodes;
}
printf("\nNodes: %I64u",total_nodes);
printf("\nMoves: %d",legal_moves);
printf("\n\n");
timer_stop();
pht_free();
}
static void send_board(int extra_move) {
char fen[256];
int start, end;
board_t board[1];
int pos;
int move;
char string[256];
ASSERT(extra_move==MoveNone||move_is_ok(extra_move));
ASSERT(!Uci->searching);
// init
game_get_board(Game,Uci->board);
if (extra_move != MoveNone) move_do(Uci->board,extra_move);
board_to_fen(Uci->board,fen,256);
my_log("POLYGLOT FEN %s\n",fen);
ASSERT(board_can_play(Uci->board));
// more init
start = 0;
end = game_pos(Game);
ASSERT(end>=start);
// position
game_get_board(Game,board,start);
board_to_fen(board,string,256);
engine_send_queue(Engine,"position");
if (my_string_equal(string,StartFen)) {
engine_send_queue(Engine," startpos");
} else {
engine_send_queue(Engine," fen %s",string);
}
// move list
if (end > start || extra_move != MoveNone) engine_send_queue(Engine," moves");
for (pos = start; pos < end; pos++) { // game moves
move = game_move(Game,pos);
move_to_can(move,board,string,256);
engine_send_queue(Engine," %s",string);
move_do(board,move);
}
if (extra_move != MoveNone) { // move to ponder on
move_to_can(extra_move,board,string,256);
engine_send_queue(Engine," %s",string);
}
// end
engine_send(Engine,""); // newline
}
static void epd_test_file(const char file_name[]) {
FILE * file;
int hit, tot;
char epd[StringSize];
char am[StringSize], bm[StringSize], id[StringSize];
board_t board[1];
char string[StringSize];
int move;
char pv_string[StringSize];
bool correct;
double depth_tot, time_tot, node_tot;
ASSERT(file_name!=NULL);
// init
file = fopen(file_name,"r");
if (file == NULL) my_fatal("epd_test_file(): can't open file \"%s\": %s\n",file_name,strerror(errno));
hit = 0;
tot = 0;
depth_tot = 0.0;
time_tot = 0.0;
node_tot = 0.0;
// loop
while (my_file_read_line(file,epd,StringSize)) {
if (UseTrace) printf("%s\n",epd);
if (!epd_get_op(epd,"am",am,StringSize)) strcpy(am,"");
if (!epd_get_op(epd,"bm",bm,StringSize)) strcpy(bm,"");
if (!epd_get_op(epd,"id",id,StringSize)) strcpy(id,"");
if (my_string_empty(am) && my_string_empty(bm)) {
my_fatal("epd_test(): no am or bm field in EPD\n");
}
// init
uci_send_ucinewgame(Uci);
uci_send_isready_sync(Uci);
ASSERT(!Uci->searching);
// position
if (!board_from_fen(board,epd)) ASSERT(false);
if (!board_to_fen(board,string,StringSize)) ASSERT(false);
engine_send(Engine,"position fen %s",string);
// search
engine_send(Engine,"go movetime %.0f depth %d",MaxTime*1000.0,MaxDepth);
// engine_send(Engine,"go infinite");
// engine data
board_copy(Uci->board,board);
uci_clear(Uci);
Uci->searching = true;
Uci->pending_nb++;
FirstMove = MoveNone;
FirstDepth = 0;
FirstSelDepth = 0;
FirstScore = 0;
FirstTime = 0.0;
FirstNodeNb = 0;
line_clear(FirstPV);
LastMove = MoveNone;
LastDepth = 0;
LastSelDepth = 0;
LastScore = 0;
LastTime = 0.0;
LastNodeNb = 0;
line_clear(LastPV);
// parse engine output
while (engine_step()) {
// stop search?
if (Uci->depth > MaxDepth
|| Uci->time >= MaxTime
|| (Uci->depth - FirstDepth >= DepthDelta
&& Uci->depth > MinDepth
&& Uci->time >= MinTime
&& is_solution(FirstMove,board,bm,am))) {
engine_send(Engine,"stop");
}
}
move = FirstMove;
correct = is_solution(move,board,bm,am);
if (correct) hit++;
tot++;
if (correct) {
depth_tot += double(FirstDepth);
time_tot += FirstTime;
node_tot += double(FirstNodeNb);
}
printf("%s %d %4d %4d",id,correct,hit,tot);
if (!line_to_san(LastPV,Uci->board,pv_string,StringSize)) ASSERT(false);
printf(" - %2d %6.2f %9lld %+6.2f %s\n",FirstDepth,FirstTime,FirstNodeNb,double(LastScore)/100.0,pv_string);
}
printf("%d/%d",hit,tot);
if (hit != 0) {
depth_tot /= double(hit);
time_tot /= double(hit);
node_tot /= double(hit);
printf(" - %.1f %.2f %.0f",depth_tot,time_tot,node_tot);
}
printf("\n");
fclose(file);
}
void search(const board_t * board, int depth_max, double time_max) {
char string[256];
ASSERT(board_is_ok(board));
ASSERT(depth_max>=1&&depth_max<DepthMax);
ASSERT(time_max>=0.0);
// engine
Depth = 0;
BestMove = MoveNone;
BestValue = 0;
line_clear(BestPV);
NodeNb = 0;
LeafNb = 0;
Time = 0.0;
Move = MoveNone;
MovePos = 0;
MoveNb = 0;
// init
uci_send_ucinewgame(Uci);
uci_send_isready_sync(Uci);
// position
if (!board_to_fen(board,string,256)) ASSERT(false);
engine_send(Engine,"position fen %s",string);
// search
engine_send_queue(Engine,"go");
engine_send_queue(Engine," movetime %.0f",time_max*1000.0);
engine_send_queue(Engine," depth %d",depth_max);
engine_send(Engine,""); // newline
// wait for feed-back
while (true) {
engine_get(Engine,string,256);
if (false) {
} else if (match(string,"bestmove * ponder *")) {
BestMove = move_from_can(Star[0],board);
ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));
break;
} else if (match(string,"bestmove *")) {
BestMove = move_from_can(Star[0],board);
ASSERT(BestMove!=MoveNone&&move_is_legal(BestMove,board));
break;
}
}
printf("\n");
}
uint64 perft(int depth)
{
int i,move_count;
move_t ms[MOVE_STACK];
uint64 nodes;
uint64 val;
#ifdef EVASIONS
char strbuff[256];
move_t ms_test[MOVE_STACK];
#endif
#ifdef BITS
bitboard_t bb;
#endif
if(depth == 0) return 1;
if((val = probe_hash(depth)) != 0)
return val;
nodes = 0;
val = 0;
#ifdef BITS
bb = 0;
for(i = PLS(WP); i <= H8; i = PLN(i))
bitset(&bb, rsz[i]);
if(bb != board->bb_pawns[W])
printf("pawn_error\n");
bb = 0;
for(i = PLS(BP); i <= H8; i = PLN(i))
bitset(&bb, rsz[i]);
if(bb != board->bb_pawns[B])
printf("pawn_error\n");
#endif
#ifdef EVASIONS
if(is_in_check(board->side))
{ move_count = move_gen_evasions(&ms[0]);
if(move_count != move_gen_legal(&ms_test[0]))
{ board_to_fen(&strbuff[0]);
printf("error: \n %s \n",strbuff);
}
}
else
{ move_count = move_gen(&ms[0]);
}
#else
move_count = move_gen(&ms[0]);
#endif
for(i = 0; i < move_count; i++)
{ if(!move_make(ms[i])) continue;
if(depth == 1)
nodes++;
else
nodes += perft(depth - 1);
move_undo();
}
record_hash(depth,nodes);
return (nodes);
}
