kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-05-01 01:03:09 +00:00
Code Issues Releases Wiki Activity

Accurate pv: rename update_pv()

Browse source 
Explicitly set the current move and clearly
show that we copy into current pv starting
from position 1 and not zero.

No functional change.
This commit is contained in:
Marco Costalba 2014-11-17 16:41:19 +01:00
parent 881e184b94
commit 478f62f9e6
1 changed files with 14 additions and 16 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

28
src/search.cpp
View file

@ -87,7 +87,7 @@ namespace {
void id_loop(Position& pos); void id_loop(Position& pos);
Value value_to_tt(Value v, int ply); Value value_to_tt(Value v, int ply);
Value value_from_tt(Value v, int ply); Value value_from_tt(Value v, int ply);
void update_pv(Move* pv, Move move, Move* child); void copy(Move* dst, Move* src);
void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt); void update_stats(const Position& pos, Stack* ss, Move move, Depth depth, Move* quiets, int quietsCnt);
string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta); string uci_pv(const Position& pos, Depth depth, Value alpha, Value beta);
@ -903,8 +903,8 @@ moves_loop: // When in check and at SpNode search starts from here
rm.score = value; rm.score = value;
rm.pv.resize(1); rm.pv.resize(1);
for (int i = 0; (ss+1)->pv[i] != MOVE_NONE; ++i) for (Move* m = (ss+1)->pv; *m != MOVE_NONE; ++m)
rm.pv.push_back((ss+1)->pv[i]); rm.pv.push_back(*m);
// We record how often the best move has been changed in each // We record how often the best move has been changed in each
// iteration. This information is used for time management: When // iteration. This information is used for time management: When
@ -930,11 +930,11 @@ moves_loop: // When in check and at SpNode search starts from here
if (PvNode && value < beta) // Update alpha! Always alpha < beta if (PvNode && value < beta) // Update alpha! Always alpha < beta
{ {
alpha = SpNode ? splitPoint->alpha = value : value; alpha = SpNode ? splitPoint->alpha = value : value;
*ss->pv = SpNode ? *splitPoint->ss->pv = move : move;
update_pv(ss->pv, move, (ss+1)->pv); copy(ss->pv+1, (ss+1)->pv);
if (SpNode) if (SpNode)
update_pv(splitPoint->ss->pv, move, (ss+1)->pv); copy(splitPoint->ss->pv+1, (ss+1)->pv);
} }
else else
{ {
@ -1182,13 +1182,11 @@ moves_loop: // When in check and at SpNode search starts from here
if (value > alpha) if (value > alpha)
{ {
if (PvNode)
update_pv(ss->pv, move, (ss+1)->pv);
if (PvNode && value < beta) // Update alpha here! Always alpha < beta if (PvNode && value < beta) // Update alpha here! Always alpha < beta
{ {
alpha = value; alpha = value;
bestMove = move; bestMove = *ss->pv = move;
copy(ss->pv+1, (ss+1)->pv);
} }
else // Fail high else // Fail high
{ {
@ -1241,13 +1239,13 @@ moves_loop: // When in check and at SpNode search starts from here
} }
// update_pv() copies child node pv[] adding current move // copy() copies src into dst until MOVE_NONE included
void update_pv(Move* pv, Move move, Move* child) { void copy(Move* dst, Move* src) {
for (*pv++ = move; *child != MOVE_NONE; ) do
*pv++ = *child++; *dst++ = *src;
*pv = MOVE_NONE; while (*src++ != MOVE_NONE);
} }
// update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high // update_stats() updates killers, history, countermoves and followupmoves stats after a fail-high