1
0
Fork 0

Store node evaluation in SearchStack

This info will be used by future patches.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
sf_2.3.1_base
Marco Costalba 2010-01-10 17:19:49 +01:00
parent e817a55bc6
commit 007285be2d
2 changed files with 4 additions and 0 deletions

View File

@ -652,6 +652,7 @@ void SearchStack::init(int ply) {
pv[ply] = pv[ply + 1] = MOVE_NONE;
currentMove = threatMove = MOVE_NONE;
reduction = Depth(0);
eval = VALUE_NONE;
}
void SearchStack::initKillers() {
@ -1391,6 +1392,7 @@ namespace {
const int FutilityValueMargin = 112 * bitScanReverse32(int(depth) * int(depth) / 2);
// Enhance score accuracy with TT value if possible
ss[ply].eval = staticValue;
futilityValue = staticValue + FutilityValueMargin;
staticValue = refine_eval(tte, staticValue, ply);

View File

@ -27,6 +27,7 @@
#include "depth.h"
#include "move.h"
#include "value.h"
////
@ -54,6 +55,7 @@ struct SearchStack {
Move threatMove;
Move killers[KILLER_MAX];
Depth reduction;
Value eval;
void init(int ply);
void initKillers();