[4/6] Add iterative deepening with aspiration windows and TT move ordering#36
Open
luccabb wants to merge 1 commit intofeature/mvv-lva-killer-movesfrom
Open
[4/6] Add iterative deepening with aspiration windows and TT move ordering#36luccabb wants to merge 1 commit intofeature/mvv-lva-killer-movesfrom
luccabb wants to merge 1 commit intofeature/mvv-lva-killer-movesfrom
Conversation
0b53062 to
944a0e0
Compare
f205ab8 to
cda6ab5
Compare
944a0e0 to
f1001bf
Compare
cda6ab5 to
0a7dc0c
Compare
f1001bf to
98ee9e1
Compare
0a7dc0c to
134def0
Compare
🔬 Stockfish Benchmark Resultsvs Stockfish Skill Level 3
vs Stockfish Skill Level 4
Non-checkmate endings:
vs Stockfish Skill Level 5
Non-checkmate endings:
Configuration
|
…ering Implements iterative deepening for better move ordering and future time management: **Iterative Deepening:** - Search depth 1, then 2, then 3, ... up to target depth - Cache persists across all iterations (TT entries reused) - Killer moves persist across iterations - Best move from depth N-1 is tried first at depth N (via TT) **Aspiration Windows:** - After depth 1, use narrow window (±50 centipawns) around previous score - If search fails outside window, re-search with doubled window - Falls back to full window after 500cp expansion - Reduces nodes searched when score is stable **TT Move Ordering:** - Save best move from TT lookup even if score can't be used - Put TT move first in move list before searching - Significantly improves move ordering at all depths Co-Authored-By: Claude Opus 4.5 <noreply@anthropic.com>
8bab1bf to
e73ebd6
Compare
3f314f6 to
6e50edb
Compare
Owner
Author
|
/run-nps-benchmark |
⚡ NPS Benchmark Results
Per-position breakdown |
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
Details
Iterative Deepening
Instead of searching directly to depth N, we search depth 1, then 2, then 3, etc:
Benefits:
Aspiration Windows
After the first iteration, we use a narrow window around the previous score:
This reduces the number of nodes searched when the score is stable.
TT Move Ordering
Test plan
🤖 Generated with Claude Code