Changes

This technique is a very simple approach to [[SMP]]. The implementation requires little more than starting additional processors. Processors are simply fed the root position at the beginning of the search, and each searches the same tree with the only communication being the [[Transposition Table|transposition table]]. 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 speedup is then based on how many nodes the main processor is able to skip from transposition table entries. Many programs used this if a "quick and dirty" approach to SMP is needed. It had the reputation of little speedup on a mere 2 processors, and to scale quite badly after this.

Overview and taxonomy of parallel algorithms based on [[Alpha-Beta|alpha-beta]], given by [[Mark Brockington]], [[ICGA Journal#19_3|ICCA Journal, Vol. 19: No. 3]] in 1996 <ref>[[Mark Brockington]] ('''1996'''). ''A Taxonomy of Parallel Game-Tree Search Algorithms''. [[ICGA Journal#19_3|ICCA Journal, Vol. 19: No. 3]]</ref> <ref>[https://www.talkchess.com/forum3/viewtopic.php?f=7&t=78631 Research paper comparing various parallel search algorithms] by koedem, [[CCC]], November 10, 2021</ref>

* [http://www.open-chess.org/viewtopic.php?f=5&t=2378 DTS-like SMP] by [[Vadim Demichev|ThinkingALot]], [[Computer Chess Forums|OpenChess Forum]], July 25, 2013 » [[Gull]]