std::ofstream LogFile;
// Natural logarithmic lookup table and its getter function
- double lnArray[512];
- inline double ln(int i) { return lnArray[i]; }
+ float lnArray[512];
+ inline float ln(int i) { return lnArray[i]; }
// MP related variables
int ActiveThreads = 1;
bool ok_to_prune(const Position& pos, Move m, Move threat);
bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
Value refine_eval(const TTEntry* tte, Value defaultEval, int ply);
- Depth calculate_reduction(double baseReduction, int moveCount, Depth depth, double reductionInhibitor);
+ void reduction_parameters(float base, float Inhibitor, Depth depth, float& logLimit, float& gradient);
+ Depth reduction(int moveCount, const float LogLimit, const float BaseRed, const float Gradient);
void update_history(const Position& pos, Move move, Depth depth, Move movesSearched[], int moveCount);
void update_killers(Move m, SearchStack& ss);
void update_gains(const Position& pos, Move move, Value before, Value after);
// Init our logarithmic lookup table
for (i = 0; i < 512; i++)
- lnArray[i] = log(double(i)); // log() returns base-e logarithm
+ lnArray[i] = float(log(double(i))); // log() returns base-e logarithm
for (i = 0; i < THREAD_MAX; i++)
Threads[i].activeSplitPoints = 0;
value = - VALUE_INFINITE;
+ // Precalculate reduction parameters
+ float LogLimit, Gradient, BaseReduction = 0.5;
+ reduction_parameters(BaseReduction, 6.0, depth, LogLimit, Gradient);
+
while (1) // Fail high loop
{
&& !captureOrPromotion
&& !move_is_castle(move))
{
- ss[0].reduction = calculate_reduction(0.5, RootMoveNumber - MultiPV + 1, depth, 6.0);
+ ss[0].reduction = reduction(RootMoveNumber - MultiPV + 1, LogLimit, BaseReduction, Gradient);
if (ss[0].reduction)
{
value = -search(pos, ss, -alpha, newDepth-ss[0].reduction, 1, true, 0);
CheckInfo ci(pos);
MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
+ // Precalculate reduction parameters
+ float LogLimit, Gradient, BaseReduction = 0.5;
+ reduction_parameters(BaseReduction, 6.0, depth, LogLimit, Gradient);
+
// Loop through all legal moves until no moves remain or a beta cutoff
// occurs.
while ( alpha < beta
&& !captureOrPromotion
&& !move_is_castle(move)
&& !move_is_killer(move, ss[ply]))
- {
- ss[ply].reduction = calculate_reduction(0.5, moveCount, depth, 6.0);
+ {
+ ss[ply].reduction = reduction(moveCount, LogLimit, BaseReduction, Gradient);
if (ss[ply].reduction)
{
value = -search(pos, ss, -alpha, newDepth-ss[ply].reduction, ply+1, true, threadID);
// Do a "stand pat". If we are above beta by a good margin then
// return immediately.
- // FIXME: test with added condition 'allowNullmove || depth <= OnePly' and !value_is_mate(beta)
- // FIXME: test with modified condition 'depth < RazorDepth'
if ( !isCheck
- && depth < SelectiveDepth
+ && allowNullmove
+ && depth < RazorDepth
&& staticValue - FutilityMargins[int(depth)] >= beta)
return staticValue - FutilityMargins[int(depth)];
MovePicker mp = MovePicker(pos, ttMove, depth, H, &ss[ply]);
CheckInfo ci(pos);
+ // Precalculate reduction parameters
+ float LogLimit, Gradient, BaseReduction = 0.5;
+ reduction_parameters(BaseReduction, 3.0, depth, LogLimit, Gradient);
+
// Loop through all legal moves until no moves remain or a beta cutoff occurs
while ( bestValue < beta
&& (move = mp.get_next_move()) != MOVE_NONE
Depth predictedDepth = newDepth;
//FIXME: We are ignoring condition: depth >= 3*OnePly, BUG??
- ss[ply].reduction = calculate_reduction(0.5, moveCount, depth, 3.0);
+ ss[ply].reduction = reduction(moveCount, LogLimit, BaseReduction, Gradient);
if (ss[ply].reduction)
predictedDepth -= ss[ply].reduction;
&& !move_is_castle(move)
&& !move_is_killer(move, ss[ply]))
{
- ss[ply].reduction = calculate_reduction(0.5, moveCount, depth, 3.0);
+ ss[ply].reduction = reduction(moveCount, LogLimit, BaseReduction, Gradient);
if (ss[ply].reduction)
{
value = -search(pos, ss, -(beta-1), newDepth-ss[ply].reduction, ply+1, true, threadID);
const int FutilityMoveCountMargin = 3 + (1 << (3 * int(sp->depth) / 8));
+ // Precalculate reduction parameters
+ float LogLimit, Gradient, BaseReduction = 0.5;
+ reduction_parameters(BaseReduction, 3.0, sp->depth, LogLimit, Gradient);
+
while ( lock_grab_bool(&(sp->lock))
&& sp->bestValue < sp->beta
&& !thread_should_stop(threadID)
&& !move_is_castle(move)
&& !move_is_killer(move, ss[sp->ply]))
{
- ss[sp->ply].reduction = calculate_reduction(0.5, moveCount, sp->depth, 3.0);
+ ss[sp->ply].reduction = reduction(moveCount, LogLimit, BaseReduction, Gradient);
if (ss[sp->ply].reduction)
{
value = -search(pos, ss, -(sp->beta-1), newDepth-ss[sp->ply].reduction, sp->ply+1, true, threadID);
int moveCount;
Move move;
+ // Precalculate reduction parameters
+ float LogLimit, Gradient, BaseReduction = 0.5;
+ reduction_parameters(BaseReduction, 6.0, sp->depth, LogLimit, Gradient);
+
while ( lock_grab_bool(&(sp->lock))
&& sp->alpha < sp->beta
&& !thread_should_stop(threadID)
&& !move_is_castle(move)
&& !move_is_killer(move, ss[sp->ply]))
{
- ss[sp->ply].reduction = calculate_reduction(0.5, moveCount, sp->depth, 6.0);
+ ss[sp->ply].reduction = reduction(moveCount, LogLimit, BaseReduction, Gradient);
if (ss[sp->ply].reduction)
{
Value localAlpha = sp->alpha;
return defaultEval;
}
- // calculate_reduction() returns reduction in plies based on
- // moveCount and depth. Reduction is always at least one ply.
- Depth calculate_reduction(double baseReduction, int moveCount, Depth depth, double reductionInhibitor) {
+ // reduction_parameters() precalculates some parameters used later by reduction. Becasue
+ // floating point operations are involved we try to recalculate reduction at each move, but
+ // we do the most consuming computation only once per node.
- double red = baseReduction + ln(moveCount) * ln(depth / 2) / reductionInhibitor;
+ void reduction_parameters(float baseReduction, float reductionInhibitor, Depth depth, float& logLimit, float& gradient)
+ {
+ // Precalculate some parameters to avoid to calculate the following formula for each move:
+ //
+ // red = baseReduction + ln(moveCount) * ln(depth / 2) / reductionInhibitor;
+ //
+ logLimit = depth > OnePly ? (1 - baseReduction) * reductionInhibitor / ln(depth / 2) : 1000;
+ gradient = depth > OnePly ? ln(depth / 2) / reductionInhibitor : 0;
+ }
- if (red >= 1.0)
- return Depth(int(floor(red * int(OnePly))));
- else
+
+ // reduction() returns reduction in plies based on moveCount and depth.
+ // Reduction is always at least one ply.
+
+ Depth reduction(int moveCount, float logLimit, float baseReduction, float gradient) {
+
+ if (ln(moveCount) < logLimit)
return Depth(0);
+ float red = baseReduction + ln(moveCount) * gradient;
+ return Depth(int(floor(red * int(OnePly))));
}
+
// update_history() registers a good move that produced a beta-cutoff
// in history and marks as failures all the other moves of that ply.
projects / stockfish / blobdiff