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

Add and use move_is_killer() helper

Browse source 
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2008-11-15 18:10:34 +01:00
parent 93bc05cf69
commit 2e778445d5
1 changed files with 21 additions and 12 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

33
src/search.cpp
View file

@ -244,14 +244,13 @@ namespace {
void update_pv(SearchStack ss[], int ply); void update_pv(SearchStack ss[], int ply);
void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply); void sp_update_pv(SearchStack *pss, SearchStack ss[], int ply);
bool connected_moves(const Position &pos, Move m1, Move m2); bool connected_moves(const Position &pos, Move m1, Move m2);
Depth extension(const Position &pos, Move m, bool pvNode, bool check, bool move_is_killer(Move m, const SearchStack& ss);
bool singleReply, bool mateThreat); Depth extension(const Position &pos, Move m, bool pvNode, bool check, bool singleReply, bool mateThreat);
bool ok_to_do_nullmove(const Position &pos); bool ok_to_do_nullmove(const Position &pos);
bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d); bool ok_to_prune(const Position &pos, Move m, Move threat, Depth d);
bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply); bool ok_to_use_TT(const TTEntry* tte, Depth depth, Value beta, int ply);
bool ok_to_history(const Position &pos, Move m); bool ok_to_history(const Position &pos, Move m);
void update_history(const Position& pos, Move m, Depth depth, void update_history(const Position& pos, Move m, Depth depth, Move movesSearched[], int moveCount);
Move movesSearched[], int moveCount);
bool fail_high_ply_1(); bool fail_high_ply_1();
int current_search_time(); int current_search_time();
@ -998,8 +997,7 @@ namespace {
&& !move_promotion(move) && !move_promotion(move)
&& !moveIsPassedPawnPush && !moveIsPassedPawnPush
&& !move_is_castle(move) && !move_is_castle(move)
&& move != ss[ply].killers[0] && !move_is_killer(move, ss[ply]))
&& move != ss[ply].killers[1])
{ {
ss[ply].reduction = OnePly; ss[ply].reduction = OnePly;
value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID); value = -search(pos, ss, -alpha, newDepth-OnePly, ply+1, true, threadID);
@ -1272,8 +1270,7 @@ namespace {
&& !move_promotion(move) && !move_promotion(move)
&& !moveIsPassedPawnPush && !moveIsPassedPawnPush
&& !move_is_castle(move) && !move_is_castle(move)
&& move != ss[ply].killers[0] && !move_is_killer(move, ss[ply]))
&& move != ss[ply].killers[1])
{ {
ss[ply].reduction = OnePly; ss[ply].reduction = OnePly;
value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID); value = -search(pos, ss, -(beta-1), newDepth-OnePly, ply+1, true, threadID);
@ -1556,8 +1553,7 @@ namespace {
&& !moveIsPassedPawnPush && !moveIsPassedPawnPush
&& !move_promotion(move) && !move_promotion(move)
&& !move_is_castle(move) && !move_is_castle(move)
&& move != ss[sp->ply].killers[0] && !move_is_killer(move, ss[sp->ply]))
&& move != ss[sp->ply].killers[1])
{ {
ss[sp->ply].reduction = OnePly; ss[sp->ply].reduction = OnePly;
value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID); value = -search(pos, ss, -(sp->beta-1), newDepth - OnePly, sp->ply+1, true, threadID);
@ -1664,8 +1660,7 @@ namespace {
&& !moveIsPassedPawnPush && !moveIsPassedPawnPush
&& !move_promotion(move) && !move_promotion(move)
&& !move_is_castle(move) && !move_is_castle(move)
&& move != ss[sp->ply].killers[0] && !move_is_killer(move, ss[sp->ply]))
&& move != ss[sp->ply].killers[1])
{ {
ss[sp->ply].reduction = OnePly; ss[sp->ply].reduction = OnePly;
value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID); value = -search(pos, ss, -sp->alpha, newDepth - OnePly, sp->ply+1, true, threadID);
@ -2050,6 +2045,20 @@ namespace {
} }
// move_is_killer() checks if the given move is among the
// killer moves of that ply.
bool move_is_killer(Move m, const SearchStack& ss) {
const Move* k = ss.killers;
for (int i = 0; i < KILLER_MAX; i++, k++)
if (*k == m)
return true;
return false;
}
// extension() decides whether a move should be searched with normal depth, // extension() decides whether a move should be searched with normal depth,
// or with extended depth. Certain classes of moves (checking moves, in // or with extended depth. Certain classes of moves (checking moves, in
// particular) are searched with bigger depth than ordinary moves. // particular) are searched with bigger depth than ordinary moves.