David A. McAllester of the American Association of Artificial Intelligence since 1997. He has authored over 100 refereed publications. McAllester's research areas include machine learning theory, the theory of programming languages, automated reasoning, AI planning, computer game playing (computer chess), and computational linguistics. A 1991 paper on AI planning proved to be one of the most influential papers of the decade in that area. A 1993 paper on computer game algorithms influenced the design of the algorithms used in the Deep Blue system that defeated Garry Kasparov. A 1998 paper on machine learning theory introduced PAC-Bayesian theorems which combine Bayesian and non-Bayesian methods.
Deep Blue versus Garry Kasparov the only game in the match that Black won. "February 17". The sixth game was an illustration of just how badly computers can play in some positions. Employing anti-computer tactics and keeping the focus of the game on long-term planning, Kasparov slowly improved his position throughout the mid-game while Deep Blue wasted time doing nothing. By the end of the game, Deep Blue's pieces were crammed into its queenside corner, with no moves to make aside from shuffling its king. Kasparov had all the time in the world to finish the rout. Kasparov's next move would probably have been 44.Qe7