Vincent David
Vincent David,
a French computer scientist and researcher. He holds a Ph.D. in 1993 from École nationale supérieure de l’aéronautique et de l’espace (National School of Aeronautics and Space), Toulouse [1], with the title Algorithmique parallèle sur les arbres de décision et raisonnement en temps contraint. Etude et application au Minimax = Parallel Minimax algorithm for heuristic tree searching and real-time reasoning. Study and application to the Minimax [2]. The thesis was part of the Saturn studies conducted at Onera, and describes a loosely synchronized distributed alpha-beta search algorithm coined αβ*, utilizing a 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 entropic extensions near the horizon if the 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 [3].
See also
External Links
References
- ↑ Vincent David, Ecole Nationale Supérieure De L’Aéronautique Et De L’Espace (Supaero)
- ↑ 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, École nationale supérieure de l’aéronautique et de l’espace, Toulouse
- ↑ A Short Story of JCW’s Computer Chess Program by Jean-Christophe Weill
- ↑ David, Vincent informaticien