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

Better document previous patch

Browse source 
If tte->move() != MOVE_NONE then tte->move() == ttMove

What could happen is that we have a ttMove without a tte, or,
we have a tte but tte->move() == MOVE_NONE

No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2009-11-27 11:54:07 +01:00
parent 5bec768d42
commit ae6157fcf3
1 changed files with 2 additions and 7 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
src/search.cpp
View file

@ -1139,9 +1139,8 @@ namespace {
ttMove = ss[ply].pv[ply];
tte = TT.retrieve(pos.get_key());
// Following assert could fail, for instance when we have
// moveCount == 0 we return without saving a TT entry.
/* assert(tte); */
// If tte->move() != MOVE_NONE then it equals ttMove
assert(!(tte && tte->move()) || tte->move() == ttMove);
}
// Initialize a MovePicker object for the current position, and prepare
@ -1170,8 +1169,6 @@ namespace {
// To verify this we do a reduced search on all the other moves but the ttMove,
// if result is lower then TT value minus a margin then we assume ttMove is the
// only one playable. It is a kind of relaxed single reply extension.
// Note that could be ttMove != tte->move() due to IID, so we always use tte->move()
// to avoid aliases when we probe tte->depth() and tte->type()
if ( depth >= 8 * OnePly
&& tte
&& move == tte->move()
@ -1476,8 +1473,6 @@ namespace {
// To verify this we do a reduced search on all the other moves but the ttMove,
// if result is lower then TT value minus a margin then we assume ttMove is the
// only one playable. It is a kind of relaxed single reply extension.
// Note that could be ttMove != tte->move() due to IID, so we always use tte->move()
// to avoid aliases when we probe tte->depth() and tte->type()
if ( depth >= 8 * OnePly
&& tte
&& move == tte->move()