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

⚡ Stop checking for two/threefold repetition and 50 moves draws in QSearch #673

Merged
merged 2 commits into from
Feb 20, 2024

Conversation

eduherminio
Copy link
Member

@eduherminio eduherminio commented Feb 19, 2024

As of now, QSearch only searches captures, pawn promotions and castling moves.
Only the latter could produce a 50 moves repetition, and none of them could produce a two/threefold one.

So it's pointless to check for repetition inside of QSearch.

Test  | search/no-repetition-in-qsearch
Elo   | 0.61 +- 2.93 (95%)
SPRT  | 8.0+0.08s Threads=1 Hash=32MB
LLR   | -2.29 (-2.25, 2.89) [0.00, 5.00]
Games | N: 33522 W: 10468 L: 10409 D: 12645
Penta | [1180, 3828, 6779, 3701, 1273]
https://openbench.lynx-chess.com/test/179/

> python.exe .\sprt.py -w 10468 -l 10409 -d 12645 -e0 -5 -e1 0
ELO: 0.612 +- 2.93 [-2.32, 3.54]
LLR: 5.27 [-5.0, 0.0] (-2.94, 2.94)
H1 Accepted

@eduherminio eduherminio marked this pull request as ready for review February 20, 2024 02:19
@eduherminio eduherminio enabled auto-merge (squash) February 20, 2024 02:20
@eduherminio eduherminio merged commit 80f1afb into main Feb 20, 2024
28 checks passed
@eduherminio eduherminio deleted the search/no-repetition-in-qsearch branch February 20, 2024 02:20
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.

1 participant