Changes

<ref>[[Vincent David]] ('''1993'''). ''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 of 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]</ref>. The thesis was part of the [https://en.wikipedia.org/wiki/Saturn Saturn] studies conducted at [https://en.wikipedia.org/wiki/Office_National_d%27%C3%89tudes_et_de_Recherches_A%C3%A9rospatiales Onera], and describes a loosely synchronized distributed [[Alpha-Beta|alpha-beta]] search algorithm coined '''αβ*''', utilizing a [[Shared Hash Table|shared transposition table]], but according to [[Jean-Christophe Weill]], who advanced '''αβ*''' to [[ABDADA]], with an ineffective controller and not considering the eldest son. Further, Vincent David introduced [https://en.wikipedia.org/wiki/Entropy_%28information_theory%29 entropic] [[Extensions|extensions]] near the horizon if the [[Chess Position|position]] was not stable enough. The idea was implemented by Jean-Christophe Weill and [[Marc-François Baudot]] in [[Joker]], but despite some impressive play, later abandoned<ref>[http://recherche.enac.fr/~weill/chess.html A Short Story of JCW's Computer Chess Program] by [[Jean-Christophe Weill]]</ref>.