<< " moves to go: " << movesToGo << std::endl;
- // We're ready to start thinking. Call the iterative deepening loop function
- //
- // FIXME we really need to cleanup all this LSN ugliness
- if (!loseOnTime)
+ // LSN filtering. Used only for developing purpose. Disabled by default.
+ if ( UseLSNFiltering
+ && loseOnTime)
{
- Value v = id_loop(pos, searchMoves);
- loseOnTime = ( UseLSNFiltering
- && myTime < LSNTime
- && myIncrement == 0
- && v < -LSNValue);
+ // Step 2. If after last move we decided to lose on time, do it now!
+ while (SearchStartTime + myTime + 1000 > get_system_time())
+ ; // wait here
}
- else
+
+ // We're ready to start thinking. Call the iterative deepening loop function
+ Value v = id_loop(pos, searchMoves);
+
+ // LSN filtering. Used only for developing purpose. Disabled by default.
+ if (UseLSNFiltering)
{
- loseOnTime = false; // reset for next match
- while (SearchStartTime + myTime + 1000 > get_system_time())
- ; // wait here
- id_loop(pos, searchMoves); // to fail gracefully
+ // Step 1. If this is sudden death game and our position is hopeless,
+ // decide to lose on time.
+ if ( !loseOnTime // If we already lost on time, go to step 3.
+ && myTime < LSNTime
+ && myIncrement == 0
+ && movesToGo == 0
+ && v < -LSNValue)
+ {
+ loseOnTime = true;
+ }
+ else if (loseOnTime)
+ {
+ // Step 3. Now after stepping over the time limit, reset flag for next match.
+ loseOnTime = false;
+ }
}
if (UseLogFile)
// To verify this we do a reduced search on all the other moves but the ttMove,
// if result is lower then TT value minus a margin then we assume ttMove is the
// only one playable. It is a kind of relaxed single reply extension.
- if ( depth >= 4 * OnePly
+ if ( depth >= 8 * OnePly
&& move == ttMove
&& ext < OnePly
&& is_lower_bound(tte->type())
if (abs(ttValue) < VALUE_KNOWN_WIN)
{
- Depth d = Max(Min(depth / 2, depth - 4 * OnePly), OnePly);
- Value excValue = search(pos, ss, ttValue - SingleReplyMargin, d, ply, false, threadID, ttMove);
+ Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, ttMove);
// If search result is well below the foreseen score of the ttMove then we
// assume ttMove is the only one realistically playable and we extend it.
// To verify this we do a reduced search on all the other moves but the ttMove,
// if result is lower then TT value minus a margin then we assume ttMove is the
// only one playable. It is a kind of relaxed single reply extension.
- if ( depth >= 4 * OnePly
+ if ( depth >= 8 * OnePly
&& !excludedMove // do not allow recursive single-reply search
&& move == ttMove
&& ext < OnePly
if (abs(ttValue) < VALUE_KNOWN_WIN)
{
- Depth d = Max(Min(depth / 2, depth - 4 * OnePly), OnePly);
- Value excValue = search(pos, ss, ttValue - SingleReplyMargin, d, ply, false, threadID, ttMove);
+ Value excValue = search(pos, ss, ttValue - SingleReplyMargin, depth / 2, ply, false, threadID, ttMove);
// If search result is well below the foreseen score of the ttMove then we
// assume ttMove is the only one realistically playable and we extend it.
if (excValue < ttValue - SingleReplyMargin)
- ext = (depth >= 8 * OnePly) ? OnePly : ext + OnePly / 2;
+ ext = OnePly;
}
}