Changes

Almost all [[Parallel Search|parallel search]] algorithms on [[SMP]]- or [[NUMA]] systems profit from probing hash entries written by other instances of the search, in its most simple form by instances of a sequential search algorithm which simultaneously search the same root position. The gains come from the effect of nondeterminism. Each processor will finish the various subtrees in varying amounts of time, and as the search continues, these effects grow making the search trees diverge. The [https://en.wikipedia.org/wiki/Speedup speedup] is then based on how many nodes the main processor is able to skip from transposition table entries. It had the reputation of little speedup on a mere 2 processors, and to scale quite badly after this. However, the [[Nodes per secondSecond|NPS]] scaling is nearly perfect.