#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include "chess.h"
#include "data.h"

/* last modified 06/02/06 */
/*
 *******************************************************************************
 *                                                                             *
 *   Bench() runs a simple six-position benchmark to gauge crafty's            *
 *   performance.  The test positons are hard-coded, and the benchmark is      *
 *   calculated much like it would with an external "test" file.  The test     *
 *   is a mix of opening, middlegame, and endgame positions, with both tactical*
 *   and positional aspects.  (For those interested, the positions chosen are  *
 *   Bratko-Kopec 2, 4, 8, 12, 22 and 23.)  This test is a speed measure only; *
 *   the actual solutions to the positions are ignored.                        *
 *                                                                             *
 *******************************************************************************
 */

void Bench(void)
{
  BITBOARD nodes = 0;
  int old_do, old_st, old_sd, total_time_used;
  FILE *old_books, *old_book;
  TREE *const tree = shared->local[0];

  total_time_used = 0;
  old_st = shared->search_time_limit;
  old_sd = search_depth;
  old_do = shared->display_options;
  shared->search_time_limit = 90000;
  shared->display_options = 1;
  old_book = book_file;
  book_file = 0;
  old_books = books_file;
  books_file = 0;
  Print(4095, "Running benchmark. . .\n");
  printf(".");
  fflush(stdout);
  strcpy(args[0], "3r1k2/4npp1/1ppr3p/p6P/P2PPPP1/1NR5/5K2/2R5");
  strcpy(args[1], "w");
  SetBoard(&tree->position[0], 2, args, 0);
  search_depth = 12;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf(".");
  fflush(stdout);
  strcpy(args[0], "rnbqkb1r/p3pppp/1p6/2ppP3/3N4/2P5/PPP1QPPP/R1B1KB1R");
  strcpy(args[1], "w");
  strcpy(args[2], "KQkq");
  SetBoard(&tree->position[0], 3, args, 0);
  search_depth = 12;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf(".");
  fflush(stdout);
  strcpy(args[0], "4b3/p3kp2/6p1/3pP2p/2pP1P2/4K1P1/P3N2P/8");
  strcpy(args[1], "w");
  SetBoard(&tree->position[0], 2, args, 0);
  search_depth = 15;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf(".");
  fflush(stdout);
  strcpy(args[0], "r3r1k1/ppqb1ppp/8/4p1NQ/8/2P5/PP3PPP/R3R1K1");
  strcpy(args[1], "b");
  SetBoard(&tree->position[0], 2, args, 0);
  search_depth = 12;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf(".");
  fflush(stdout);
  strcpy(args[0], "2r2rk1/1bqnbpp1/1p1ppn1p/pP6/N1P1P3/P2B1N1P/1B2QPP1/R2R2K1");
  strcpy(args[1], "b");
  SetBoard(&tree->position[0], 2, args, 0);
  search_depth = 13;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf(".");
  fflush(stdout);
  strcpy(args[0], "r1bqk2r/pp2bppp/2p5/3pP3/P2Q1P2/2N1B3/1PP3PP/R4RK1");
  strcpy(args[1], "b");
  strcpy(args[2], "kq");
  SetBoard(&tree->position[0], 3, args, 0);
  search_depth = 12;
  InitializeHashTables();
  last_pv.pathd = 0;
  shared->thinking = 1;
  tree->position[1] = tree->position[0];
  (void) Iterate(wtm, think, 0);
  shared->thinking = 0;
  nodes += tree->nodes_searched;
  total_time_used += (shared->program_end_time - shared->program_start_time);
  printf("\n");
  Print(4095, "Total nodes: " BMF "\n", nodes);
  Print(4095, "Raw nodes per second: %d\n", nodes / (total_time_used / 100));
  Print(4095, "Total elapsed time: %d\n", (total_time_used / 100));
  input_stream = stdin;
  early_exit = 99;
  shared->display_options = old_do;
  shared->search_time_limit = old_st;
  search_depth = old_sd;
  books_file = old_books;
  book_file = old_book;
  NewGame(0);
}