static void parse_go(char string[]) {
const char * ptr;
bool infinite, ponder;
int depth, mate, movestogo;
sint64 nodes;
double binc, btime, movetime, winc, wtime;
double time, inc;
double time_max, alloc;
// init
infinite = false;
ponder = false;
depth = -1;
mate = -1;
movestogo = -1;
nodes = -1;
binc = -1.0;
btime = -1.0;
movetime = -1.0;
winc = -1.0;
wtime = -1.0;
// parse
ptr = strtok(string," "); // skip "go"
for (ptr = strtok(NULL," "); ptr != NULL; ptr = strtok(NULL," ")) {
if (false) {
} else if (string_equal(ptr,"binc")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
binc = double(atoi(ptr)) / 1000.0;
ASSERT(binc>=0.0);
} else if (string_equal(ptr,"btime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
btime = double(atoi(ptr)) / 1000.0;
ASSERT(btime>=0.0);
} else if (string_equal(ptr,"depth")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
depth = atoi(ptr);
ASSERT(depth>=0);
} else if (string_equal(ptr,"infinite")) {
infinite = true;
} else if (string_equal(ptr,"mate")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
mate = atoi(ptr);
ASSERT(mate>=0);
} else if (string_equal(ptr,"movestogo")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
movestogo = atoi(ptr);
ASSERT(movestogo>=0);
} else if (string_equal(ptr,"movetime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
movetime = double(atoi(ptr)) / 1000.0;
ASSERT(movetime>=0.0);
} else if (string_equal(ptr,"nodes")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
nodes = my_atoll(ptr);
ASSERT(nodes>=0);
} else if (string_equal(ptr,"ponder")) {
ponder = true;
} else if (string_equal(ptr,"searchmoves")) {
// dummy
} else if (string_equal(ptr,"winc")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
winc = double(atoi(ptr)) / 1000.0;
ASSERT(winc>=0.0);
} else if (string_equal(ptr,"wtime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
wtime = double(atoi(ptr)) / 1000.0;
ASSERT(wtime>=0.0);
}
}
// init
search_clear();
// depth limit
// JAS
int option_depth = 0;
option_depth = option_get_int("Search Depth");
if (option_depth > 0) {
depth = option_depth;
}
// JAS end
if (depth >= 0) {
SearchInput->depth_is_limited = true;
SearchInput->depth_limit = depth;
} else if (mate >= 0) {
SearchInput->depth_is_limited = true;
SearchInput->depth_limit = mate * 2 - 1; // HACK: move -> ply
}
// time limit
if (COLOUR_IS_WHITE(SearchInput->board->turn)) {
time = wtime;
inc = winc;
} else {
time = btime;
inc = binc;
}
if (movestogo <= 0 || movestogo > 30) movestogo = 20; // HACK was 30
if (inc < 0.0) inc = 0.0;
// JAS
int option_movetime = 0;
option_movetime = option_get_int("Search Time");
if (option_movetime > 0) {
movetime = option_movetime;
}
// JAS end
if (movetime >= 0.0) {
// fixed time
SearchInput->time_is_limited = true;
SearchInput->time_limit_1 = movetime * 5.0; // HACK to avoid early exit
SearchInput->time_limit_2 = movetime;
} else if (time >= 0.0) {
// dynamic allocation
time_max = time * 0.95 - 1.0;
if (time_max < 0.0) time_max = 0.0;
SearchInput->time_is_limited = true;
alloc = (time_max + inc * double(movestogo-1)) / double(movestogo);
alloc *= (option_get_bool("Ponder") ? PonderRatio : NormalRatio);
if (alloc > time_max) alloc = time_max;
SearchInput->time_limit_1 = alloc;
alloc = (time_max + inc * double(movestogo-1)) * 0.5;
if (alloc < SearchInput->time_limit_1) alloc = SearchInput->time_limit_1;
if (alloc > time_max) alloc = time_max;
SearchInput->time_limit_2 = alloc;
}
if (infinite || ponder) SearchInput->infinite = true;
// search
ASSERT(!Searching);
ASSERT(!Delay);
Searching = true;
Infinite = infinite || ponder;
Delay = false;
search();
search_update_current();
ASSERT(Searching);
ASSERT(!Delay);
Searching = false;
Delay = Infinite;
if (!Delay) send_best_move();
}
static void parse_go(char string[]) {
const char * ptr;
bool infinite, ponder;
int depth, mate, movestogo;
sint64 nodes;
double binc, btime, movetime, winc, wtime;
double time, inc;
// init
infinite = false;
ponder = false;
depth = -1;
mate = -1;
movestogo = -1;
nodes = -1;
binc = -1.0;
btime = -1.0;
movetime = -1.0;
winc = -1.0;
wtime = -1.0;
// parse
ptr = strtok(string," "); // skip "go"
for (ptr = strtok(NULL," "); ptr != NULL; ptr = strtok(NULL," ")) {
if (false) {
} else if (string_equal(ptr,"binc")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
binc = double(atoi(ptr)) / 1000.0;
ASSERT(binc>=0.0);
} else if (string_equal(ptr,"btime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
btime = double(atoi(ptr)) / 1000.0;
ASSERT(btime>=0.0);
} else if (string_equal(ptr,"depth")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
depth = atoi(ptr);
ASSERT(depth>=0);
} else if (string_equal(ptr,"infinite")) {
infinite = true;
} else if (string_equal(ptr,"mate")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
mate = atoi(ptr);
ASSERT(mate>=0);
} else if (string_equal(ptr,"movestogo")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
movestogo = atoi(ptr);
ASSERT(movestogo>=0);
} else if (string_equal(ptr,"movetime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
movetime = double(atoi(ptr)) / 1000.0;
ASSERT(movetime>=0.0);
} else if (string_equal(ptr,"nodes")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
nodes = my_atoll(ptr);
ASSERT(nodes>=0);
} else if (string_equal(ptr,"ponder")) {
ponder = true;
} else if (string_equal(ptr,"searchmoves")) {
// dummy
} else if (string_equal(ptr,"winc")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
winc = double(atoi(ptr)) / 1000.0;
ASSERT(winc>=0.0);
} else if (string_equal(ptr,"wtime")) {
ptr = strtok(NULL," ");
if (ptr == NULL) my_fatal("parse_go(): missing argument\n");
wtime = double(atoi(ptr)) / 1000.0;
ASSERT(wtime>=0.0);
}
}
// init
search_clear();
tb_clear();
egbb_clear();
eval_init_options();
// depth limit
if (depth >= 0) {
SearchInput->depth_is_limited = true;
SearchInput->depth_limit = depth;
} else if (mate >= 0) {
SearchInput->depth_is_limited = true;
SearchInput->depth_limit = mate * 2 - 1; // HACK: move -> ply
}
// nodes limit
if (nodes > 0) {
if (nodes < 1000) nodes = 1000;
SearchInput->nodes_is_limited = true;
SearchInput->nodes = nodes;
}
// time limit
if (COLOUR_IS_WHITE(SearchInput->board->turn)) {
time = wtime;
inc = winc;
} else {
time = btime;
inc = binc;
}
if (movestogo <= 0 || movestogo > 30) movestogo = 30; // HACK
if (inc < 0.0) inc = 0.0;
if (movetime >= 0.0) {
// fixed time
SearchInput->time_is_limited = true;
SearchInput->time_limit_1 = movetime * 5.0; // HACK to avoid early exit
SearchInput->time_limit_2 = movetime;
} else if (time >= 0.0) {
SearchInput->time_is_limited = true;
time_allocation(time,inc,movestogo);
}
if (infinite || ponder) SearchInput->infinite = true;
// search
ASSERT(!Searching);
ASSERT(!Delay);
Searching = true;
Infinite = infinite || ponder;
Delay = false;
search();
search_update_current();
ASSERT(Searching);
ASSERT(!Delay);
Searching = false;
Delay = Infinite;
if (!Delay) send_best_move();
}
static void loop_step() {
char string[65536];
// read a line
get(string,65536);
// parse
if (false) {
} else if (string_start_with(string,"debug ")) {
// dummy
} else if (string_start_with(string,"go ")) {
if (!Searching && !Delay) {
init();
parse_go(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"isready")) {
if (!Searching && !Delay) {
init();
}
send("readyok"); // no need to wait when searching (dixit SMK)
} else if (string_equal(string,"ponderhit")) {
if (Searching) {
ASSERT(Infinite);
SearchInput->infinite = false;
Infinite = false;
} else if (Delay) {
send_best_move();
Delay = false;
} else {
ASSERT(false);
}
} else if (string_start_with(string,"position ")) {
if (!Searching && !Delay) {
init();
parse_position(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"quit")) {
ASSERT(!Searching);
ASSERT(!Delay);
exit(EXIT_SUCCESS);
} else if (string_start_with(string,"setoption ")) {
if (!Searching && !Delay) {
parse_setoption(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"stop")) {
if (Searching) {
SearchInfo->stop = true;
Infinite = false;
} else if (Delay) {
send_best_move();
Delay = false;
}
} else if (string_equal(string,"uci")) {
ASSERT(!Searching);
ASSERT(!Delay);
send("id name Gambit Fruit " VERSION);
send("id author Ryan Benitez, Thomas Gaksch and Fabien Letouzey");
option_list();
send("uciok");
} else if (string_equal(string,"ucinewgame")) {
if (!Searching && !Delay && Init) {
trans_clear(Trans);
} else {
ASSERT(false);
}
}
}
void loop_step(const char * input) {
char string[65536];
char buffer[256];
// read a line
if (input != NULL) {
get_local(string,65536,input);
} else {
get_stdin(string,65536);
}
// parse
if (false) {
} else if (string_start_with(string,"debug ")) {
if (!Searching) {
parse_debug(string);
} else {
ASSERT(false);
}
} else if (string_start_with(string,"go ")) {
if (!Searching && !Delay) {
init();
parse_go(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"isready")) {
if (!Searching && !Delay) {
init();
}
send("readyok"); // no need to wait when searching (fixit SMK)
} else if (string_equal(string,"ponderhit")) {
if (Searching) {
ASSERT(Infinite);
SearchInput->infinite = false;
Infinite = false;
} else if (Delay) {
send_best_move();
Delay = false;
} else {
ASSERT(false);
}
} else if (string_start_with(string,"position ")) {
if (!Searching && !Delay) {
init();
parse_position(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"quit")) {
ASSERT(!Searching); // violated by Arena UI
ASSERT(!Delay);
if (Searching && option_get_int("Threads") > 1) {
// Arena issue
SearchInfo->stop = true;
Infinite = false;
smp_sleep();
}
trans_free();
tb_close();
egbb_close();
smp_close();
exit(EXIT_SUCCESS);
} else if (string_start_with(string,"setoption ")) {
if (!Searching && !Delay) {
parse_setoption(string);
} else {
ASSERT(false);
}
} else if (string_equal(string,"stop")) {
if (Searching) {
SearchInfo->stop = true;
Infinite = false;
} else if (Delay) {
send_best_move();
Delay = false;
}
} else if (string_equal(string,"uci")) {
ASSERT(!Searching);
ASSERT(!Delay);
send("id name Fruit reloaded %s", my_version(buffer));
send("id author Fabien Letouzey, Ryan Benitez and Daniel Mehrmann");
option_list();
send("uciok");
} else if (string_equal(string,"ucinewgame")) {
if (!Searching && !Delay && Init) {
trans_clear();
pawn_clear();
material_clear();
} else {
ASSERT(false);
}
}
}
