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

Unify scoring functions in MovePicker

Browse source 
No functional change.
This commit is contained in:
Joost VandeVondele 2017-08-09 14:04:59 +02:00 • committed by Marco Costalba
parent b40e45c1cc
commit f731bcadb7
1 changed files with 16 additions and 34 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

50
src/movepick.cpp
View file

@ -120,45 +120,27 @@ MovePicker::MovePicker(const Position& p, Move ttm, Value th)
stage += (ttMove == MOVE_NONE); stage += (ttMove == MOVE_NONE);
} }
/// score() assigns a numerical value to each move in a list, used for sorting.
/// score() assigns a numerical value to each move in a move list. The moves with /// Captures are ordered by Most Valuable Victim (MVV), preferring captures
/// highest values will be picked first. /// near our home rank. Quiets are ordered using the histories.
template<> template<GenType T>
void MovePicker::score<CAPTURES>() { void MovePicker::score() {
// Winning and equal captures in the main search are ordered by MVV, preferring
// captures near our home rank. Surprisingly, this appears to perform slightly
// better than SEE-based move ordering: exchanging big pieces before capturing
// a hanging piece probably helps to reduce the subtree size.
// In the main search we want to push captures with negative SEE values to the
// badCaptures[] array, but instead of doing it now we delay until the move
// has been picked up, saving some SEE calls in case we get a cutoff.
for (auto& m : *this)
m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
- Value(200 * relative_rank(pos.side_to_move(), to_sq(m)));
}
template<>
void MovePicker::score<QUIETS>() {
for (auto& m : *this) for (auto& m : *this)
m.value = (*mainHistory)[pos.side_to_move()][from_to(m)] if (T == CAPTURES || (T == EVASIONS && pos.capture(m)))
+ (*contHistory[0])[pos.moved_piece(m)][to_sq(m)] m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
+ (*contHistory[1])[pos.moved_piece(m)][to_sq(m)] - (T == EVASIONS ? Value(type_of(pos.moved_piece(m)))
+ (*contHistory[3])[pos.moved_piece(m)][to_sq(m)]; : Value(200 * relative_rank(pos.side_to_move(), to_sq(m))));
} else if (T == QUIETS)
m.value = (*mainHistory)[pos.side_to_move()][from_to(m)]
+ (*contHistory[0])[pos.moved_piece(m)][to_sq(m)]
+ (*contHistory[1])[pos.moved_piece(m)][to_sq(m)]
+ (*contHistory[3])[pos.moved_piece(m)][to_sq(m)];
template<> else // Quiet evasions
void MovePicker::score<EVASIONS>() { m.value = (*mainHistory)[pos.side_to_move()][from_to(m)] - (1 << 28);
// Try captures ordered by MVV/LVA, then non-captures ordered by stats heuristics
for (auto& m : *this)
if (pos.capture(m))
m.value = PieceValue[MG][pos.piece_on(to_sq(m))]
- Value(type_of(pos.moved_piece(m))) + (1 << 28);
else
m.value = (*mainHistory)[pos.side_to_move()][from_to(m)];
} }
/// next_move() is the most important method of the MovePicker class. It returns /// next_move() is the most important method of the MovePicker class. It returns
/// a new pseudo legal move every time it is called, until there are no more moves /// a new pseudo legal move every time it is called, until there are no more moves
/// left. It picks the move with the biggest value from a list of generated moves /// left. It picks the move with the biggest value from a list of generated moves