-
Notifications
You must be signed in to change notification settings - Fork 7
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
Multithreaded search. #30
Comments
Is this called Lazy SMP? https://www.chessprogramming.org/Lazy_SMP |
Lazy SMP has different depths for different threads. |
It's almost the same. LazySMP afaik runs from different depths to enforce more "randomness" in populating TT We could have lazysmp immediately if anyone decides what I described in original post is too easy :P i believe lazysmp might be better from what I suggested |
I'm fine with a simpler solution. It would be even better to actually implement it first and then benchmark how much we gained from "real" LazySMP |
We want to enable simple multithreaded search as follows:
setoption
command like this:setoption name Threads value <int>
which will set desired number of threads (1 by default)
Let's say N = number of threads
info
orbestmove
etc)The main reason we do that is additional threads will populate transposition table making main thread search quicker.
This is not ideal utilization of multiple threads but it is good enough for us for now.
The text was updated successfully, but these errors were encountered: