Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Sometimes do a reduced search in case LMR is skipped #4290

Closed
wants to merge 1 commit into from

Conversation

lonfom169
Copy link
Contributor

@lonfom169 lonfom169 commented Dec 19, 2022

If the node doesn't go through LMR and r is too big, reduce search depth by one ply.

STC:
LLR: 2.94 (-2.94,2.94) <0.00,2.00>
Total: 664888 W: 176375 L: 175169 D: 313344
Ptnml(0-2): 1965, 73754, 179851, 74858, 2016
https://tests.stockfishchess.org/tests/view/6399414c93ed41c57ede8fb8

LTC:
LLR: 2.94 (-2.94,2.94) <0.50,2.50>
Total: 150784 W: 40553 L: 40031 D: 70200
Ptnml(0-2): 76, 14668, 45387, 15180, 81
https://tests.stockfishchess.org/tests/view/639dee6e11c576d919dc2b38

Bench: 3727508

@lonfom169
Copy link
Contributor Author

Suggestions welcome for code comments and structure.

@Vizvezdenec
Copy link
Contributor

Probably can be written like
// Step 18. Full depth search when LMR is skipped.
If expected reduction is high reduce it depth by 1.
Although this is up to maintainers.

@vondele
Copy link
Member

vondele commented Dec 19, 2022

Please rebase this patch on current master and fix the comment as suggested.

Bench: 3727508
@lonfom169
Copy link
Contributor Author

Done.

@vondele vondele closed this in c2d5070 Dec 19, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

3 participants