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 to exchange the queens. That would have allowed his pawn, which was about to promote, to advance. "May 3". The 1997 rematch began with the King's Indian Attack, which led Kasparov to victory in 45 moves. Deep Blue's 44th move in this game puzzled Kasparov, and he attributed it to "superior intelligence". Allegedly, the move was a result of a bug in which Deep Blue, unable to determine a desirable move, resorted to a fail-safe. Nate Silver proposes that Kasparov "concluded that the counterintuitive play must be a sign of superior intelligence", leading him to lose the second game. "May