This completes the job started with revision
4124c94583c8f61.
No functional change.
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
log << "\nSearching: " << pos.to_fen()
<< "\ninfinite: " << Limits.infinite
<< " ponder: " << Limits.ponder
log << "\nSearching: " << pos.to_fen()
<< "\ninfinite: " << Limits.infinite
<< " ponder: " << Limits.ponder
- << " time: " << Limits.times[pos.side_to_move()]
- << " increment: " << Limits.incs[pos.side_to_move()]
+ << " time: " << Limits.time[pos.side_to_move()]
+ << " increment: " << Limits.inc[pos.side_to_move()]
<< " moves to go: " << Limits.movestogo
<< endl;
}
<< " moves to go: " << Limits.movestogo
<< endl;
}
LimitsType() { memset(this, 0, sizeof(LimitsType)); }
bool use_time_management() const { return !(movetime | depth | nodes | infinite); }
LimitsType() { memset(this, 0, sizeof(LimitsType)); }
bool use_time_management() const { return !(movetime | depth | nodes | infinite); }
- int times[2], incs[2], movestogo, depth, nodes, movetime, infinite, ponder;
+ int time[2], inc[2], movestogo, depth, nodes, movetime, infinite, ponder;
// Initialize to maximum values but unstablePVExtraTime that is reset
unstablePVExtraTime = 0;
// Initialize to maximum values but unstablePVExtraTime that is reset
unstablePVExtraTime = 0;
- optimumSearchTime = maximumSearchTime = limits.times[us];
+ optimumSearchTime = maximumSearchTime = limits.time[us];
// We calculate optimum time usage for different hypothetic "moves to go"-values and choose the
// minimum of calculated search time values. Usually the greatest hypMTG gives the minimum values.
for (hypMTG = 1; hypMTG <= (limits.movestogo ? std::min(limits.movestogo, MoveHorizon) : MoveHorizon); hypMTG++)
{
// Calculate thinking time for hypothetic "moves to go"-value
// We calculate optimum time usage for different hypothetic "moves to go"-values and choose the
// minimum of calculated search time values. Usually the greatest hypMTG gives the minimum values.
for (hypMTG = 1; hypMTG <= (limits.movestogo ? std::min(limits.movestogo, MoveHorizon) : MoveHorizon); hypMTG++)
{
// Calculate thinking time for hypothetic "moves to go"-value
- hypMyTime = limits.times[us]
- + limits.incs[us] * (hypMTG - 1)
+ hypMyTime = limits.time[us]
+ + limits.inc[us] * (hypMTG - 1)
- emergencyBaseTime
- emergencyMoveTime * std::min(hypMTG, emergencyMoveHorizon);
- emergencyBaseTime
- emergencyMoveTime * std::min(hypMTG, emergencyMoveHorizon);
while (is >> token)
{
if (token == "wtime")
while (is >> token)
{
if (token == "wtime")
- is >> limits.times[WHITE];
+ is >> limits.time[WHITE];
else if (token == "btime")
else if (token == "btime")
- is >> limits.times[BLACK];
+ is >> limits.time[BLACK];
else if (token == "winc")
else if (token == "winc")
- is >> limits.incs[WHITE];
+ is >> limits.inc[WHITE];
else if (token == "binc")
else if (token == "binc")
- is >> limits.incs[BLACK];
+ is >> limits.inc[BLACK];
else if (token == "movestogo")
is >> limits.movestogo;
else if (token == "depth")
else if (token == "movestogo")
is >> limits.movestogo;
else if (token == "depth")