Convert History table H in a local variable

This is a first step for future patches and in
any case seems a nice thing to do.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2009-06-02 09:57:15 +01:00
parent e1ed67aacb
commit c1b60269a2
5 changed files with 14 additions and 12 deletions

View File

@@ -207,6 +207,9 @@ namespace {
// Search depth at iteration 1
const Depth InitialDepth = OnePly /*+ OnePly/2*/;
// History tables
History H;
// Node counters
int NodesSincePoll;
int NodesBetweenPolls = 30000;
@@ -330,8 +333,6 @@ int ActiveThreads = 1;
// but it could turn out to be useful for debugging.
Lock IOLock;
History H; // Should be made local?
// SearchStack::init() initializes a search stack. Used at the beginning of a
// new search from the root.
@@ -1056,7 +1057,7 @@ namespace {
// Initialize a MovePicker object for the current position, and prepare
// to search all moves
MovePicker mp = MovePicker(pos, true, ttMove, depth, &ss[ply]);
MovePicker mp = MovePicker(pos, true, ttMove, depth, H, &ss[ply]);
Move move, movesSearched[256];
int moveCount = 0;
@@ -1317,7 +1318,7 @@ namespace {
// Initialize a MovePicker object for the current position, and prepare
// to search all moves:
MovePicker mp = MovePicker(pos, false, ttMove, depth, &ss[ply]);
MovePicker mp = MovePicker(pos, false, ttMove, depth, H, &ss[ply]);
Move move, movesSearched[256];
int moveCount = 0;
@@ -1538,7 +1539,7 @@ namespace {
// Initialize a MovePicker object for the current position, and prepare
// to search the moves. Because the depth is <= 0 here, only captures,
// queen promotions and checks (only if depth == 0) will be generated.
MovePicker mp = MovePicker(pos, pvNode, ttMove, depth);
MovePicker mp = MovePicker(pos, pvNode, ttMove, depth, H);
Move move;
int moveCount = 0;
Bitboard dcCandidates = mp.discovered_check_candidates();