SF Search thickening with more threads

Discussion of anything and everything relating to chess playing software and machines.

Moderators: hgm, Dann Corbit, Harvey Williamson

Werewolf
Posts: 1745
Joined: Thu Sep 18, 2008 10:24 pm

SF Search thickening with more threads

Post by Werewolf »

Hi,

I know this has been asked before but I was wondering if someone could give an up-to-date answer: as the thread count increases, does Stockfish's search "thicken", or is it simply that it gets faster at reaching a certain depth?

Many thanks.
User avatar
MikeB
Posts: 4889
Joined: Thu Mar 09, 2006 6:34 am
Location: Pen Argyl, Pennsylvania

Re: SF Search thickening with more threads

Post by MikeB »

Werewolf wrote: Sun Feb 07, 2021 2:12 pm Hi,

I know this has been asked before but I was wondering if someone could give an up-to-date answer: as the thread count increases, does Stockfish's search "thicken", or is it simply that it gets faster at reaching a certain depth?

Many thanks.
Due to the inherent inefficiency of multiple threads versus a single thread, most engines will have a wider search or "a larger search tree" ( -> more commonly used terms to describe the observable behavior your are describing). There has been many patches to reduce tree size when using both single thread and multiple threads. In the end, almost all tree searches are larger when using multiple threads, but there a few exceptions when there is a singular best move, where the best move is found earlier in a multiple thread (core) mode, which may significantly reduce the tree size for a period of time versus a single thread search.
Image