along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
-#include <algorithm>
#include <cassert>
#include "movegen.h"
}
-/// History class method definitions
-
-void History::clear() {
- memset(history, 0, sizeof(history));
- memset(gains, 0, sizeof(gains));
-}
-
-void History::update(Piece p, Square to, Value bonus) {
- if (abs(history[p][to] + bonus) < History::Max)
- history[p][to] += bonus;
-}
-
-void History::update_gain(Piece p, Square to, Value gain) {
- gains[p][to] = std::max(gain, gains[p][to] - 1);
-}
-
-
/// Constructors of the MovePicker class. As arguments we pass information
/// to help it to return the presumably good moves first, to decide which
/// moves to return (in the quiescence search, for instance, we only want to
/// move ordering is at the current node.
MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h,
- Search::Stack* s, Value beta) : pos(p), H(h), depth(d) {
+ Search::Stack* s, Value beta) : pos(p), Hist(h), depth(d) {
assert(d > DEPTH_ZERO);
}
MovePicker::MovePicker(const Position& p, Move ttm, Depth d, const History& h,
- Square sq) : pos(p), H(h), cur(moves), end(moves) {
+ Square sq) : pos(p), Hist(h), cur(moves), end(moves) {
assert(d <= DEPTH_ZERO);
}
MovePicker::MovePicker(const Position& p, Move ttm, const History& h, PieceType pt)
- : pos(p), H(h), cur(moves), end(moves) {
+ : pos(p), Hist(h), cur(moves), end(moves) {
assert(!pos.checkers());
for (MoveStack* it = moves; it != end; ++it)
{
m = it->move;
- it->score = H[pos.piece_moved(m)][to_sq(m)];
+ it->score = Hist[pos.piece_moved(m)][to_sq(m)];
}
}
it->score = PieceValue[MG][pos.piece_on(to_sq(m))]
- type_of(pos.piece_moved(m)) + History::Max;
else
- it->score = H[pos.piece_moved(m)][to_sq(m)];
+ it->score = Hist[pos.piece_moved(m)][to_sq(m)];
}
}