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 Kasparov, 1997, Game 6 first time that a computer had defeated a World Champion in a match of several games. This, as well as the fact that Kasparov had lasted only 19 moves in a game lasting barely more than an hour, attracted much media attention. White: Deep Blue Black: Garry Kasparov Opening: Caro–Kann Defense, Steinitz Variation ("ECO" B17) 1. e4 c6 2. d4 d5 3. Nc3 dxe4 4. Nxe4 Nd7 5. Ng5 (see diagram) 5... Ngf6 6. Bd3 e6 7. N1f3 h6? (see diagram) 8. Nxe6! 8... Qe7 9. 0-0 9... fxe6 10. Bg6+ Kd8 11. Bf4 (see diagram) 11... b5? 12. a4