Changes

a loosely synchronized, [[Parallel Search|distributed search algorithm]] developed by [[Jean-Christophe Weill]]. The ABDADA search algorithm is based on [[Young Brothers Wait Concept]] (YBWC) ([[Rainer Feldmann]] et al. 1986, 1993) <ref>[[Rainer Feldmann]], [[Peter Mysliwietz]], [[Oliver Vornberger]] ('''1986'''). ''A Local Area Network Used as a Parallel Architecture''. Technical Report 31, [[Paderborn University of Paderborn]]</ref> <ref>[[Rainer Feldmann]] ('''1993'''). ''Game Tree Search on Massively Parallel Systems''. Ph.D. Thesis, [http://www2.cs.uni-paderborn.de/fachbereich/AG/monien/PUBLICATIONS/POSTSCRIPTS/feldmann_phd.pdf pdf]</ref> and αβ* ([[Vincent David]] 1993) <ref>[[Vincent David]] ('''1993'''). ''[http://cat.inist.fr/?aModele=afficheN&cpsidt=161774 Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax]'' = Parallel algorithm for heuristic tree searching and real-time reasoning. Study and application to the Minimax, Ph.D. Thesis, [https://en.wikipedia.org/wiki/%C3%89cole_nationale_sup%C3%A9rieure_de_l%27a%C3%A9ronautique_et_de_l%27espace École nationale supérieure de l'aéronautique et de l'espace], [https://en.wikipedia.org/wiki/Toulouse Toulouse], [https://en.wikipedia.org/wiki/France France]</ref> . From YBWC it retains the basic concept to allow parallel search only if the eldest son has been fully evaluated. From αβ* as well as [[Steve Otto]] and [[Ed Felten|Ed Felten's]] algorithm (1988) <ref>[[Ed Felten]], [[Steve Otto]] ('''1988'''). ''[http://portal.acm.org/citation.cfm?id=63088 Chess on a Hypercube]''. The Third Conference on Hypercube Concurrent Computers and Applications, Vol. II-Applications (ed. [http://portal.acm.org/author_page.cfm?id=81100501616&coll=GUIDE&dl=GUIDE&trk=0&CFID=90098691&CFTOKEN=72738297 G. Fox]), pp. 1329-1341</ref> which both rely on a [[Shared Hash Table]] and all processors start the search simultaneously at the [[Root|root]], ABDADA retains the simple [[Recursion|recursive]] control structure similar to a serial algorithm. With the help of additional [[Transposition Table|transposition table]] information, i.e. the number of processors searching this node, it is possible to control [https://en.wikipedia.org/wiki/Speculative_multithreading speculative parallelism].