Difference between revisions of "Jacques Pitrat"

From Chessprogramming wiki
Jump to: navigation, search
 
Line 12: Line 12:
  
 
=Selected Publications=  
 
=Selected Publications=  
<ref>[http://ilk.uvt.nl/icga/journal/docs/References.pdf ICGA Reference Database] (pdf)</ref><ref>[http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/p/Pitrat:Jacques.html Jacques Pitrat from List of publications from the DBLP Bibliography Server]</ref>
+
<ref>[[ICGA Journal#RefDB|ICGA Reference Database]]</ref><ref>[http://www.informatik.uni-trier.de/%7Eley/db/indices/a-tree/p/Pitrat:Jacques.html Jacques Pitrat from List of publications from the DBLP Bibliography Server]</ref>
 
==1966 ...==  
 
==1966 ...==  
 
* [[Jacques Pitrat]] ('''1966'''). ''Réalisation de programmes de démonstration de théorèmes utilisant des méthodes heuristiques''. Ph.D. thesis, [[University of Paris]], advisor [[Mathematician#JVille|Jean Ville]]
 
* [[Jacques Pitrat]] ('''1966'''). ''Réalisation de programmes de démonstration de théorèmes utilisant des méthodes heuristiques''. Ph.D. thesis, [[University of Paris]], advisor [[Mathematician#JVille|Jean Ville]]

Latest revision as of 17:20, 16 November 2020

Home * People * Jacques Pitrat

Jacques Pitrat [1]

Jacques Pitrat, (February 27, 1934 – October 14, 2019)
was a French AI-researcher and professor emeritus at Pierre and Marie Curie University, Paris. His research interests include General Game Playing, Learning and Metaknowledge [2].

Pitrat's Chess Program

In the 70s, Jacques Pitrat worked on a experimental chess program that tried to limit the width of the tree, so that it can increase its depth. The idea is to generate a node if and only if there is a reason to do so. The program performs a very sophisticated analysis of the given position, to generate a set of plans. Each plan consists of a sequence of moves considered by the search.

Selected Publications

[3][4]

1966 ...

1970 ...

1980 ...

1990 ...

2000 ...

External Links

References

Up one level