Sort moves partially: linear depth dependence
authorJoost VandeVondele <Joost.VandeVondele@gmail.com>
Sun, 23 Apr 2017 15:37:55 +0000 (08:37 -0700)
committerJoona Kiiski <joona@zoox.com>
Sun, 23 Apr 2017 15:37:55 +0000 (08:37 -0700)
STC: http://tests.stockfishchess.org/tests/view/58f98d260ebc59035df33d5e
LLR: 2.96 (-2.94,2.94) [0.00,5.00]
Total: 58958 W: 10862 L: 10485 D: 37611

LTC: http://tests.stockfishchess.org/tests/view/58fa45d40ebc59035df33d86
LLR: 2.95 (-2.94,2.94) [0.00,5.00]
Total: 18607 W: 2427 L: 2251 D: 13929

Bench: 6065528

Closes #1079

src/movepick.cpp

index 796649ab02d9a821d99cb70ac61650f0152f5bd4..cc79528027b25334be0316e2499137cd29c3c3e6 100644 (file)
@@ -242,8 +242,7 @@ Move MovePicker::next_move(bool skipQuiets) {
       endMoves = generate<QUIETS>(pos, cur);
       score<QUIETS>();
 
-      partial_insertion_sort(cur, endMoves,
-                             depth < 3 * ONE_PLY ? 0 : INT_MIN);
+      partial_insertion_sort(cur, endMoves, -4000 * depth / ONE_PLY);
       ++stage;
 
   case QUIET: