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

Test with see

Browse source 
Signed-off-by: Marco Costalba <mcostalba@gmail.com>
This commit is contained in:
Marco Costalba 2008-10-17 07:58:36 +02:00
parent 173ecc0acf
commit 06d6468ce9
1 changed files with 5 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

13
src/movepick.cpp
View file

@ -203,7 +203,7 @@ Move MovePicker::get_next_move(Lock &lock) {
/// MovePicker::pick_move_from_list().
void MovePicker::score_captures() {
// Winning and equal captures in the main search are ordered by MVV/LVA.
// Winning and equal captures in the main search are ordered by MVV.
// Suprisingly, this appears to perform slightly better than SEE based
// move ordering. The reason is probably that in a position with a winning
// capture, capturing a more valuable (but sufficiently defended) piece
@ -216,12 +216,9 @@ void MovePicker::score_captures() {
{
Move m = moves[i].move;
moves[i].score = pos.see(m);
if (moves[i].score >= 0)
{
moves[i].score = HistoryMax;
moves[i].score += move_promotion(m) ? QueenValueMidgame
: pos.midgame_value_of_piece_on(move_to(m));
}
//if (moves[i].score >= 0)
// moves[i].score = move_promotion(m) ? QueenValueMidgame
// : pos.midgame_value_of_piece_on(move_to(m));
}
}
@ -266,7 +263,7 @@ void MovePicker::score_evasions() {
void MovePicker::score_qcaptures() {
// Use MVV/LVA ordering
// Use MVV ordering
for (int i = 0; i < numOfMoves; i++)
{
Move m = moves[i].move;