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.
Jacques Pitrat (1976). A Program to Learn to Play Chess. Pattern Recognition and Artificial Intelligence, pp. 399-419. Academic Press Ltd. London, UK. ISBN 0-12-170950-7.
Jacques Pitrat (1976). Realization of a Program Learning to Find Combinations at Chess. Computer Oriented Learning Processes (ed. J. Simon). Noordhoff, Groningen, The Netherlands.
a French AI-researcher and Professor Emeritus at Pierre and Marie Curie University, Paris. His research interests include General Game Playing, Learning and Metaknowledge [1].
Table of Contents
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
Bootstrapping Artificial Intelligence
References
What links here?
Up one level