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 this is nowadays a common tactic, it was a relatively new idea at the time. Despite this anti-computer tactic, the game was drawn. "May 7". In this game Kasparov played the Caro–Kann Defence. Kasparov got into time trouble late in the game. The sub-optimal moves he played in a hurry may have cost him the victory. "May 10". In this game, the King's Indian Attack opening was played. As in the previous game, Deep Blue played a brilliant endgame that secured a draw, when it was looking as if Kasparov would win. If White plays 50.g8=Q then Black can force