kate/BadFish
1
0
Fork 0
mirror of https://github.com/sockspls/badfish synced 2025-07-12 03:59:15 +00:00
Code Issues Releases Wiki Activity

Remove unused currentMoveCaptureValue from search stack

Browse source 
No functional change.

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2009-04-07 09:54:32 +02:00
parent 17ef886fc3
commit 95aadb5e53
2 changed files with 0 additions and 14 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/search.cpp
View file

@ -325,7 +325,6 @@ void SearchStack::init(int ply) {
pv[ply] = pv[ply + 1] = MOVE_NONE; pv[ply] = pv[ply + 1] = MOVE_NONE;
currentMove = threatMove = MOVE_NONE; currentMove = threatMove = MOVE_NONE;
reduction = Depth(0); reduction = Depth(0);
currentMoveCaptureValue = Value(0);
} }
void SearchStack::initKillers() { void SearchStack::initKillers() {
@ -1015,12 +1014,6 @@ namespace {
movesSearched[moveCount++] = ss[ply].currentMove = move; movesSearched[moveCount++] = ss[ply].currentMove = move;
if (moveIsCapture)
ss[ply].currentMoveCaptureValue =
move_is_ep(move)? PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
else
ss[ply].currentMoveCaptureValue = Value(0);
// Decide the new search depth // Decide the new search depth
bool dangerous; bool dangerous;
Depth ext = extension(pos, move, true, moveIsCapture, moveIsCheck, singleReply, mateThreat, &dangerous); Depth ext = extension(pos, move, true, moveIsCapture, moveIsCheck, singleReply, mateThreat, &dangerous);
@ -1721,12 +1714,6 @@ namespace {
assert(move_is_ok(move)); assert(move_is_ok(move));
if (moveIsCapture)
ss[sp->ply].currentMoveCaptureValue =
move_is_ep(move)? PawnValueMidgame : pos.midgame_value_of_piece_on(move_to(move));
else
ss[sp->ply].currentMoveCaptureValue = Value(0);
lock_grab(&(sp->lock)); lock_grab(&(sp->lock));
int moveCount = ++sp->moves; int moveCount = ++sp->moves;
lock_release(&(sp->lock)); lock_release(&(sp->lock));

1
src/search.h
View file

@ -55,7 +55,6 @@ const int KILLER_MAX = 2;
struct SearchStack { struct SearchStack {
Move pv[PLY_MAX]; Move pv[PLY_MAX];
Move currentMove; Move currentMove;
Value currentMoveCaptureValue;
Move mateKiller; Move mateKiller;
Move threatMove; Move threatMove;
Move killers[KILLER_MAX]; Move killers[KILLER_MAX];