But the tin box won that game, becoming the first computer to defeat a sitting world chess champion.
Chess players and computer scientists alike were stunned. Computers were by then known for doing some things better than humans could, like solving complex math problems or processing employees’ paychecks. “But everybody knew that chess required intelligence to play well, so to see that a computer could do this and compete with the best player in the world—that was sort of a wakeup call,” says Murray Campbell, one of the IBM computer scientists who developed Deep Blue, and a competitive chess player himself. “It was a sign that a lot more was coming.”
The concept of chess-playing machines dates back centuries. One of the first iterations was rather dishonest: an automaton created by Wolfgang von Kempelen, a Hungarian inventor, in the 1760s only managed to win because the human player hidden inside was pulling levers to move pieces across the board. It took humans until the 1950s to program machines to observe the rules of chess. By the 1980s, computers could conduct basic searches of potential moves and strategies, but at considerably quick speeds, searching several thousands positions per second. They started competing against skilled human players—and winning. In 1987, Deep Thought, the precursor to Deep Blue, defeated British chessmaster David Levy.
“Deep Thought sees far but notices little, remembers everything but learns nothing, neither erring egregiously nor rising above its normal strength,” the IBM scientists wrote in 1990. “Even so, it sometimes produces insights that are overlooked by even top grandmasters.”
Deep Blue was considerably more advanced. At its core, the computer was built to solve complex numerical problems. In front of a chess board, Deep Blue, equipped with data from hundreds of existing master games, would scan the board for features it recognized. Like a human player, the computer thought ahead, exploring potential moves in terms of sequences, envisioning future positions. It numerically rated the moves as it went, finally making the one that came out with the highest rating—the “best” move. Deep Blue was capable of evaluating 100 million positions per second.
Kasparov went into the historic game in 1996 feeling confident, but it soon became clear Deep Blue was a tougher competitor than he’d expected. Kasparov, already known for being an animated player, was visibly frustrated during the game, often shaking his head, says Jeffrey Popyack, a computer science professor at Drexel University who was in the room. At one point, Kasparov spent 27 minutes deliberating before moving his queen. “The thing that really sticks with me now was just the anguish that Kasparov was going through,” Popyack recalls.
Toward the end of game, Kasparov and Deep Blue were like “two sumo wrestlers battling one another at the edge of a high cliff,” as Monty Newborn, chairman of the computer chess committee for the Association of Computing Machines, once put it. Kasparov was mounting an aggressive attack on Deep Blue’s king when the machine made an unusual move—going after a pawn across the board—that suggested the machine was unaware it was in trouble. (“It would be kind of like your house was burning down and you decided to go grocery shopping,” Ashley, the American grandmaster, said.) Turns out the computer had calculated that Kasparov’s move—a bold bluff that would have intimidated a human player—wasn’t going to work. The world champion, visibly distraught, resigned a few moves later.
