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

Synchronize sp_search() with search() part II

Browse source 
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Joona Kiiski 2010-02-24 17:36:45 +02:00 • committed by Marco Costalba
parent 936cd5b83d
commit 62f6d39204
1 changed files with 8 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/search.cpp
View file

@ -1790,6 +1790,7 @@ namespace {
Position pos(*sp->pos); Position pos(*sp->pos);
CheckInfo ci(pos); CheckInfo ci(pos);
SearchStack* ss = sp->sstack[threadID]; SearchStack* ss = sp->sstack[threadID];
StateInfo st;
Value value = -VALUE_INFINITE; Value value = -VALUE_INFINITE;
Move move; Move move;
int moveCount; int moveCount;
@ -1845,11 +1846,10 @@ namespace {
} }
} }
// Make and search the move. // Step 13. Make the move
StateInfo st;
pos.do_move(move, st, ci, moveIsCheck); pos.do_move(move, st, ci, moveIsCheck);
// Try to reduce non-pv search depth by one ply if move seems not problematic, // Step 14. Reduced search
// if the move fails high will be re-searched at full depth. // if the move fails high will be re-searched at full depth.
bool doFullDepthSearch = true; bool doFullDepthSearch = true;
@ -1866,16 +1866,19 @@ namespace {
} }
} }
if (doFullDepthSearch) // Go with full depth non-pv search // Step 15. Full depth search
if (doFullDepthSearch)
{ {
ss[sp->ply].reduction = Depth(0); ss[sp->ply].reduction = Depth(0);
value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID); value = -search(pos, ss, -(sp->beta - 1), newDepth, sp->ply+1, true, threadID);
} }
// Step 16. Undo move
pos.undo_move(move); pos.undo_move(move);
assert(value > -VALUE_INFINITE && value < VALUE_INFINITE); assert(value > -VALUE_INFINITE && value < VALUE_INFINITE);
// New best move? // Step 17. Check for new best move
lock_grab(&(sp->lock)); lock_grab(&(sp->lock));
if (value > sp->bestValue && !TM.thread_should_stop(threadID)) if (value > sp->bestValue && !TM.thread_should_stop(threadID))