25,161
edits
Changes
no edit summary
'''Jean-Christophe Weill''',<br/>
a French computer scientist and computer chess and game games programmer. He introduced the [[NegaC*]] search algorithm as a [[Negamax]] implementation of [[Kevin Coplan|Kevin Coplan's]] '''C'''*. He also created the [[ABDADA]] non-synchronized, distributed search algorithm, apparently used in [[Frenchess]]. His 1995 Ph.D. thesis in French, ''Programmes d'Échecs de Championnat: Architecture Logicielle Synthèse de Fonctions d'Évaluations, Parallélisme de Recherche'', covers [[History|history]] of computer chess, a broad range of [[Search|search]] algorithms and [[Evaluation|evaluation]], audited beside others by [[Tony Marsland]] and [[Jacques Pitrat]].
=Chess Programs=
=Selected Publications=
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf [ICGA Journal#RefDB|ICGA Reference Database] (pdf)]</ref> <ref>[http://www.recherche.enac.fr/~weill/publications.html Jean-Christophe Weill, Selected publications]</ref> <ref>[http://www.recherche.enac.fr/%7Eweill/publications/ Index of /~weill/publications]</ref>
* [[Jean-Christophe Weill]] ('''1989'''). ''Contribution a la Programmation des Jeux de Reflexion. Memoire de d.e.a.'', [[University of Paris#8|Université Paris 8]], Vincennes. (French.)
* [[Jean-Christophe Weill]] ('''1991'''). ''Experiments With the NegaC* Search - An Alternative for Othello Endgame Search.'' [[2nd Computer Olympiad#Workshop|Heuristic Programming in AI 2]]
=References=
<references />
'''[[People|Up one level]]'''
[[Category:Chess Programmer|Weill]]
[[Category:Othello Programmer|Weill]]
[[Category:Researcher|Weill]]
