opelly/Stockfish
1
0
Fork 0
mirror of https://github.com/opelly27/Stockfish.git synced 2026-05-20 06:17:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Introduce StateInfo instead of UndoInfo

Browse Source 
We don't backup anymore but use the renamed StateInfo
argument passed in do_move() to store the new position
state when doing a move.

Backup is now just revert to previous StateInfo that we know
because we store a pointer to it.
Note that now backing store is up to the caller, Position is
stateless in that regard, state is accessed through a pointer.

This patch will let us remove all the backup/restore copying,
just a pointer switch is now necessary.

Note that do_null_move() still uses StateInfo as backup.

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba
2009-02-22 20:16:21 +01:00
parent 2f6c5f00e6
commit 8f59de48f5
6 changed files with 255 additions and 280 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/search.cpp
+18 -18
View File
@@ -753,12 +753,12 @@ namespace {
if (dbg_show_hit_rate)
dbg_print_hit_rate(LogFile);
UndoInfo u;
StateInfo st;
LogFile << "Nodes: " << nodes_searched() << std::endl
<< "Nodes/second: " << nps() << std::endl
<< "Best move: " << move_to_san(p, ss[0].pv[0]) << std::endl;
p.do_move(ss[0].pv[0], u);
p.do_move(ss[0].pv[0], st);
LogFile << "Ponder move: " << move_to_san(p, ss[0].pv[1])
<< std::endl << std::endl;
}
@@ -781,7 +781,7 @@ namespace {
{
int64_t nodes;
Move move;
UndoInfo u;
StateInfo st;
Depth ext, newDepth;
RootMoveNumber = i + 1;
@@ -807,7 +807,7 @@ namespace {
newDepth = (Iteration - 2) * OnePly + ext + InitialDepth;
// Make the move, and search it
pos.do_move(move, u);
pos.do_move(move, st);
if (i < MultiPV)
{
@@ -1011,8 +1011,8 @@ namespace {
Depth newDepth = depth - OnePly + ext;
// Make and search the move
UndoInfo u;
pos.do_move(move, u);
StateInfo st;
pos.do_move(move, st);
if (moveCount == 1) // The first move in list is the PV
value = -search_pv(pos, ss, -beta, -alpha, newDepth, ply+1, threadID);
@@ -1182,8 +1182,8 @@ namespace {
{
ss[ply].currentMove = MOVE_NULL;
UndoInfo u;
pos.do_null_move(u);
StateInfo st;
pos.do_null_move(st);
int R = (depth >= 4 * OnePly ? 4 : 3); // Null move dynamic reduction
Value nullValue = -search(pos, ss, -(beta-1), depth-R*OnePly, ply+1, false, threadID);
@@ -1334,8 +1334,8 @@ namespace {
}
// Make and search the move
UndoInfo u;
pos.do_move(move, u);
StateInfo st;
pos.do_move(move, st);
// Try to reduce non-pv search depth by one ply if move seems not problematic,
// if the move fails high will be re-searched at full depth.
@@ -1513,8 +1513,8 @@ namespace {
continue;
// Make and search the move.
UndoInfo u;
pos.do_move(move, u);
StateInfo st;
pos.do_move(move, st);
Value value = -qsearch(pos, ss, -beta, -alpha, depth-OnePly, ply+1, threadID);
pos.undo_move(move);
@@ -1605,8 +1605,8 @@ namespace {
continue;
// Make and search the move.
UndoInfo u;
pos.do_move(move, u);
StateInfo st;
pos.do_move(move, st);
// Try to reduce non-pv search depth by one ply if move seems not problematic,
// if the move fails high will be re-searched at full depth.
@@ -1714,8 +1714,8 @@ namespace {
Depth newDepth = sp->depth - OnePly + ext;
// Make and search the move.
UndoInfo u;
pos.do_move(move, u);
StateInfo st;
pos.do_move(move, st);
// Try to reduce non-pv search depth by one ply if move seems not problematic,
// if the move fails high will be re-searched at full depth.
@@ -1876,12 +1876,12 @@ namespace {
if (includeMove)
{
// Find a quick score for the move
UndoInfo u;
StateInfo st;
SearchStack ss[PLY_MAX_PLUS_2];
moves[count].move = mlist[i].move;
moves[count].nodes = 0ULL;
pos.do_move(moves[count].move, u);
pos.do_move(moves[count].move, st);
moves[count].score = -qsearch(pos, ss, -VALUE_INFINITE, VALUE_INFINITE,
Depth(0), 1, 0);
pos.undo_move(moves[count].move);