Do not special case reductions for MultiPV case
authorMarco Costalba <mcostalba@gmail.com>
Thu, 17 Feb 2011 08:08:27 +0000 (09:08 +0100)
committerMarco Costalba <mcostalba@gmail.com>
Thu, 17 Feb 2011 08:08:27 +0000 (09:08 +0100)
Note that this introduces an asymmetry in which best move
is searched deeper then others also in MultiPV, but this is
not an error per se.

No functional change when MultiPV = 1

Signed-off-by: Marco Costalba <mcostalba@gmail.com>
src/search.cpp

index c1cbc9ef1d4d7c3328ccffaf183d6f8b1d405e55..b0d359d1955ee4f707c427207c8b2852499135f9 100644 (file)
@@ -1153,8 +1153,7 @@ split_point_start: // At split points actual search starts from here
               &&  ss->killers[0] != move
               &&  ss->killers[1] != move)
           {
-              ss->reduction = Root ? reduction<PvNode>(depth, moveCount - MultiPV + 1)
-                                   : reduction<PvNode>(depth, moveCount);
+              ss->reduction = reduction<PvNode>(depth, moveCount);
               if (ss->reduction)
               {
                   alpha = SpNode ? sp->alpha : alpha;