On August 18 and 19, 1980, at Stanford U n i v e r s i t y during at Stanford U n i v e r s i t y, with the actual game on i n a c l o s e d the A A A I conference, the f i r s t of a projected p a i r of annual room containing o n l y the player, computer terminal operators c h e s s competitions pitting the w o r l d ' s best computer programs (L a r r y A t k i n and David Cahlander of Control Data Corporation) against rated human p l a y e r s of approximately the same and the referee. U p s t a i r s was a large demonstration strength was held. These matches are part of the F r e d k i n p r i z e room where two boards, one for the actual position and one competition, wherein a sum of $100,000, established by the for a n a l y s i s, were used to keep the audience abreast of what F r e d k i n Foundation of Cambridge, Mass, i s to be awarded to was happening and could be expected to happen. The moves the creators of a program that can defeat the W o r l d Chess were communicated through a telecommunications setup Champion i n o f f i c i a l competition. The program i n t h i s match was C H E S S 4.9 of Northwestern In the f i r s t game, C H E S S 4.9 played the White s i d e of a U n i v e r s i t y, authored by David S l a t e and L a r r y A t k i n.

Presented at the NATO Symposium Human and Artificial Intelligence, Lyon, France, October, 1981. CMU Technical Report CMU-CS-82-104. We examine computer games in order to develop concepts of the relative roles of knowledge and search. The paper concentrates on the relation between knowledge applied at leaf nodes of a search and the depth of the search that is being conducted. Each knowledge of an advantage has a projection ability (time to convert to a more permanent advantage) associated with it. The best programs appear to have the longest projection ability knowledge in them. If the application of knowledge forces a single view of a terminal situation, this may at times be very wrong. We consider the advantages of knowledge delivering a range as its output, a method for which some theory exists, but which is as yet unproven.