# Deep Blue

> Source: https://aiwiki.ai/wiki/deep_blue
> Updated: 2026-06-24
> Categories: Artificial Intelligence
> From AI Wiki (https://aiwiki.ai), a free encyclopedia of artificial intelligence. Quote with attribution.

**Deep Blue** was a chess-playing supercomputer built by [IBM](/wiki/ibm_ai) that, on May 11, 1997, became the first machine to defeat a reigning world chess champion in a full match under standard tournament time controls, beating [Garry Kasparov](/wiki/garry_kasparov) by a score of 3.5 to 2.5 in a six-game rematch in New York City [7]. It found its moves not by learning but by brute force: a 30-node IBM RS/6000 SP supercomputer wired to 480 custom chess chips that together evaluated up to about 200 million chess positions per second using [alpha-beta search](/wiki/alpha_beta_pruning) and a grandmaster-tuned evaluation function [3][4]. The win was a watershed moment in the history of [artificial intelligence](/wiki/artificial_intelligence), capturing worldwide media attention and sparking a broad cultural conversation about the capabilities and limits of machines.

Deep Blue's approach relied on massive computational power and specialized hardware rather than [machine learning](/wiki/machine_learning) or neural networks. It evaluated chess positions using a combination of brute-force [search algorithms](/wiki/search_algorithm) and a hand-tuned evaluation function, making it the most prominent example of [symbolic AI](/wiki/symbolic_ai), the search-and-knowledge-engineering paradigm that dominated [game AI](/wiki/game_ai) before the rise of learning-based systems, applied to a specific, well-defined domain. As Deep Blue team member Murray Campbell later put it, "Chess is an enormously complex game, and that's why it took us, as a field, 50 years of development to finally beat the world champion." [14]

## Where did Deep Blue come from?

Deep Blue's roots trace back to a graduate project at Carnegie Mellon University. In 1985, Feng-hsiung Hsu, a Taiwanese-born computer science doctoral student, began developing a chess chip called ChipTest. Working alongside fellow students Murray Campbell and Thomas Anantharaman, the project evolved into a more powerful system called Deep Thought, which in 1988 became the first computer to defeat a grandmaster (Bent Larsen) in tournament play [1].

IBM recruited Hsu and Campbell in 1989, and the project moved to IBM's Thomas J. Watson Research Center in Yorktown Heights, New York. Under IBM's backing, the team set about building a far more powerful successor. The system was renamed Deep Blue, a play on IBM's nickname "Big Blue" and the earlier name Deep Thought (itself a reference to the computer in Douglas Adams's *The Hitchhiker's Guide to the Galaxy*) [2].

The development team grew to include several key contributors beyond Hsu and Campbell. A. Joseph Hoane Jr. joined as the primary programmer. Joel Benjamin, a grandmaster and three-time U.S. Chess Champion, was brought on as a consultant to help refine the evaluation function and opening book. The team spent years iterating on both hardware and software, with the 1997 machine representing a substantial upgrade over the version that had played Kasparov in 1996 [1].

## What hardware did Deep Blue use?

Deep Blue's power came from its custom-designed hardware. The 1997 version that defeated Kasparov was built on the following architecture:

| Component | Specification |
|-----------|---------------|
| Base system | IBM RS/6000 SP supercomputer |
| General processors | 30 PowerPC 604e nodes (28 at 120 MHz, 2 at 135 MHz) |
| Custom chess chips | 480 VLSI chess processors (16 per node) |
| Chip fabrication | 600 nm CMOS process |
| Search speed | Approximately 200 million positions per second (peak theoretical throughput of all 480 chips roughly 1 billion per second) |
| Operating system | AIX (IBM's Unix variant) |
| Processing power | 11.38 GFLOPS (billion floating-point operations per second) |
| Weight | Approximately 1.4 tons |

The 1997 machine roughly doubled the speed of the 1996 version. IBM's own account notes that the earlier Deep Blue could explore "up to 100 million possible chess positions per second," while the upgraded 1997 system could search "up to 200 million options per second, depending on the pawns' position on the board." [14]

### How did the chess chips work?

Each of the 480 custom chess chips contained four major functional blocks:

| Block | Function | Details |
|-------|----------|---------|
| Move generator | Produced legal chess moves from a given position | Generated all pseudo-legal moves and verified legality in hardware |
| Smart-move stack | Included a regular move stack and a repetition detector | Maintained move ordering and detected three-fold repetition |
| Evaluation unit | Assessed the quality of a chess position | Implemented roughly 8,000 pattern-recognition features in silicon |
| Search control unit | Managed the [alpha-beta pruning](/wiki/alpha_beta_pruning) search tree | Coordinated the distributed search across all 480 chips |

Each individual chip could evaluate roughly 2 to 2.5 million chess positions per second. With 480 chips working in parallel, the system reached a peak theoretical throughput of about 1 billion positions per second and a sustained match throughput of approximately 200 million positions per second [3].

### How was the search parallelized?

The 30 PowerPC processors were organized hierarchically. One processor served as the master, coordinating the search. The remaining processors each controlled 16 chess chips. The master processor ran the top levels of the search tree in software, then distributed subtrees to the worker nodes for parallel exploration. This hybrid approach combined the flexibility of software-based search at the top level with the raw speed of hardware-based search at the lower levels [4].

## How did Deep Blue play chess?

Deep Blue's playing strategy was fundamentally different from how humans play chess. While grandmasters rely heavily on intuition, pattern recognition, and deep strategic understanding, Deep Blue used brute-force computation combined with sophisticated evaluation.

### Alpha-Beta Search

At its core, Deep Blue employed the [alpha-beta search](/wiki/alpha_beta_pruning) algorithm, a refinement of the [minimax](/wiki/minimax) algorithm used in game-playing programs. Alpha-beta search systematically explores a game tree by considering possible moves, the opponent's likely responses, counter-responses, and so on, while pruning branches that cannot possibly influence the final decision.

Deep Blue could search to a typical depth of 6 to 8 moves ahead in the main search, with selective extensions pushing the search to 20 or more moves in critical lines (such as forced sequences of captures or checks). In some cases, the search extended as deep as 40 plies (half-moves) along forced tactical lines [4].

The search incorporated several enhancements beyond basic alpha-beta:

| Enhancement | Purpose |
|-------------|---------|
| Iterative deepening | Searched progressively deeper, using earlier results to improve move ordering |
| Null-move pruning | Skipped a turn to test whether the position was so good that further search was unnecessary |
| Quiescence search | Extended the search in "noisy" positions with captures and checks to avoid horizon effects |
| Singular extensions | Extended search on moves that appeared uniquely strong |
| Transposition tables | Stored previously evaluated positions to avoid redundant work |

### Evaluation Function

The evaluation function was where human chess expertise entered the system. IBM's team, which included grandmaster Joel Benjamin as a consultant, hand-tuned the evaluation function to assess positions based on over 8,000 features. The evaluation was split into 8,000 distinct parts, many designed for special positions or rare configurations. Each feature was assigned a weight, and the function summed these weighted features to produce a numerical score for each position [3][5]. Campbell credited this richer evaluation for much of the 1997 improvement: "Part of the improvement is we detected more patterns in a chess position and could put values on them and therefore evaluate chess positions more accurately." [14]

The features ranged from very simple (such as the presence of a particular piece on a particular square) to highly complex (such as patterns involving multiple pieces in specific configurations). Key categories of features included:

| Feature Category | Examples | Approximate Weight |
|-----------------|---------|-------------------|
| Material balance | Piece values, material advantage | Highest priority |
| King safety | Pawn shield, open files near king, attacking pieces | Very high |
| Pawn structure | Isolated pawns, doubled pawns, passed pawns, pawn chains | High |
| Piece mobility | Number of legal moves, squares controlled | Medium-high |
| Center control | Occupation and influence over central squares | Medium |
| Piece coordination | Rook on open file, bishop pair, connected rooks | Medium |
| Endgame-specific | King activity, pawn promotion potential, opposition | Context-dependent |

This was not machine learning. The evaluation function's parameters were set by the development team, not learned from data. Between games in a match, the team could (and did) adjust these parameters to address weaknesses that Kasparov had exploited. This inter-game tuning was explicitly permitted under the match rules and became a point of contention after the 1997 match [5].

### Opening Book

Deep Blue had an extensive opening book, a database of known opening sequences drawn from grandmaster games. For the first several moves of each game, Deep Blue would consult this database rather than calculating from scratch. The opening book for the 1997 match was particularly extensive, drawing on a database of roughly 700,000 grandmaster games and 4,000 specially prepared positions [4].

The opening book was not merely a lookup table. It included what the team called an "extended book" that combined traditional book moves with evaluations from Deep Blue's search engine, allowing the system to transition smoothly from book play to calculated play. Grandmaster Joel Benjamin played a central role in preparing the opening book, selecting lines that would steer games into positions favorable to Deep Blue's strengths [1].

### Endgame Databases

Deep Blue used endgame tablebases, pre-computed databases that contain the perfect play for all positions with a given number of pieces on the board. The system included:

| Database Type | Coverage | Source |
|---------------|----------|--------|
| All 4-piece endgames | Complete perfect play | Ken Thompson CD-ROMs |
| All 5-piece endgames | Complete perfect play | Ken Thompson CD-ROMs |
| Selected 6-piece endgames | Including positions with blocked pawn pairs | Lewis Stiller databases |

Ken Thompson, the legendary computer scientist at Bell Labs, had built the first comprehensive endgame tablebases starting in 1977. His work shocked grandmasters by revealing that certain positions (such as king and queen versus king and rook) required up to 61 moves to win, far beyond what any human could calculate [12].

The 4-piece and important 5-piece databases were replicated on the local disk of each of the 30 general-purpose processors. The larger 6-piece databases were stored on two 20-GB RAID disk arrays shared across the system [4].

Interestingly, the endgame databases did not play a decisive role in the 1997 match against Kasparov. Only Game 4 of the match approached an endgame position where the databases might have been consulted, and even then the chess chips' built-in evaluation was sufficient to handle the rook and pawn endgame correctly [4].

## What happened in the 1996 Kasparov match?

The first match between Deep Blue and Garry Kasparov took place in Philadelphia, Pennsylvania, from February 10 to 17, 1996. This was organized as a six-game match under standard tournament time controls.

| Game | Result | Notes |
|------|--------|-------|
| Game 1 | Deep Blue wins | First time a computer beats a reigning world champion in a game under standard time controls |
| Game 2 | Kasparov wins | Kasparov adjusts his strategy |
| Game 3 | Draw | |
| Game 4 | Draw | |
| Game 5 | Kasparov wins | |
| Game 6 | Kasparov wins | |
| **Final Score** | **Kasparov 4, Deep Blue 2** | |

Deep Blue's victory in Game 1 was historic: it marked the first time a computer had beaten a reigning world chess champion in a game played under standard time controls. However, Kasparov recovered and won the match convincingly with a final score of 4-2. After the first game, Kasparov adopted an "anti-computer" strategy, making moves that were positionally strong but difficult for a computer to evaluate properly [6].

The 1996 loss was not the end for IBM. The team spent the next year making significant upgrades: doubling the number of chess chips from 256 to 480, refining the evaluation function based on analysis of the 1996 games, expanding the opening book, and improving the search extensions. The 1997 machine was roughly twice as fast as its 1996 predecessor and had a substantially improved positional understanding [1].

## How did Deep Blue beat Kasparov in 1997?

The rematch took place from May 3 to 11, 1997, at the Equitable Center in New York City. IBM had spent the intervening year significantly upgrading Deep Blue's hardware and, critically, its evaluation function. Prize money for the match was $1.1 million, with $700,000 going to the winner and $400,000 to the loser [7]. Deep Blue won the match 3.5 to 2.5, the first time in history that a machine had beaten a reigning world champion over a full match under standard time controls [7].

### Game-by-Game Summary

**Game 1 (May 3): Kasparov wins.** Kasparov played aggressively with the white pieces, choosing the Reti Opening. He outmaneuvered Deep Blue in a complex middlegame and forced resignation after 45 moves. The victory suggested that Kasparov had prepared effective anti-computer strategies.

**Game 2 (May 4): Deep Blue wins.** This game proved to be the psychological turning point of the entire match. Deep Blue, playing white, adopted an unusual approach and made a subtle positional sacrifice. On move 37, Deep Blue played Be4, a quiet, strategically motivated move that appeared to demonstrate long-term positional planning, something computers were not expected to do. Kasparov was so unsettled that he later attributed the move to "the hand of God," and resigned the game on move 45. Post-match analysis later showed the final position was in fact drawable: after 45...Qe3, Black could force a draw by perpetual check [7].

It was later revealed that Deep Blue's 44th move in the same game may have resulted from a software bug: an "emergency escape" routine that caused Deep Blue to play an essentially random legal move when its search became stuck in a loop. This possibility only deepened the irony of the match's psychological dynamics, since the machine's flawless reputation rested partly on a move that may have been a fallback rather than a calculated choice [8].

**Game 3 (May 6): Draw.** A tense game that ended in a draw after 48 moves. Both sides played cautiously.

**Game 4 (May 7): Draw.** Another hard-fought draw, this time in 56 moves. This game featured the closest approach to an endgame position in the match.

**Game 5 (May 10): Draw.** Kasparov pressed for a win with the white pieces but could not break through. The game was drawn after 49 moves.

**Game 6 (May 11): Deep Blue wins.** The decisive and most controversial game. With the score tied at 2.5-2.5, everything depended on the final game.

| Game | Date | Result | Moves | Opening |
|------|------|--------|-------|---------|
| Game 1 | May 3 | Kasparov wins | 45 | Reti Opening |
| Game 2 | May 4 | Deep Blue wins | 45 | Ruy Lopez |
| Game 3 | May 6 | Draw | 48 | Semi-Slav Defense |
| Game 4 | May 7 | Draw | 56 | Semi-Slav Defense |
| Game 5 | May 10 | Draw | 49 | Scotch Game |
| Game 6 | May 11 | Deep Blue wins | 19 | Caro-Kann Defense |
| **Final Score** | | **Deep Blue 3.5, Kasparov 2.5** | | |

## Why was Game 6 so controversial?

Game 6 was the most controversial of the entire match. Kasparov, playing Black, chose the Caro-Kann Defense but deviated from standard opening theory early. Deep Blue exploited an inaccuracy in Kasparov's opening play. Playing as white, Deep Blue sacrificed a knight on move 8 with Nxe6, a bold tactical shot. Kasparov never recovered from this stunning move, and after just 19 moves and barely more than an hour of play, Kasparov resigned.

The brevity of the game stunned observers. It was the first time in Kasparov's career that he had resigned a game so early. Post-game analysis suggested that Kasparov's position, while difficult, may not have been completely lost at the point of resignation. Many chess commentators believed Kasparov was psychologically broken by this point, still rattled from Game 2 [9].

After the match, Kasparov made several accusations:

- He claimed that IBM had allowed human grandmasters to intervene during the games, effectively cheating.
- He demanded to see the computer's log files to verify that no human assistance had been given.
- He requested a rematch under more transparent conditions.

IBM denied any improper human intervention, stating that the only adjustments made between games (modifying the evaluation function to address revealed weaknesses) were permitted under the match rules. IBM eventually published the log files on the Internet but did not grant Kasparov's request for a rematch. Years later, in 2016, Kasparov acknowledged that after analyzing the games more carefully, he retracted his cheating accusations [7].

## What was Deep Blue's cultural impact?

The 1997 match was a global media event. It was covered extensively by newspapers, television networks, and the then-emerging World Wide Web. The match attracted an estimated 74 million hits on IBM's website, a staggering number for the era [10].

The cultural impact went well beyond chess:

**Public perception of AI.** For many people, Deep Blue's victory was their first encounter with the idea that a computer could outperform a human at a task widely considered to require intelligence. It prompted widespread discussion about what computers could and could not do.

**The "so what" response.** Conversely, some AI researchers downplayed the achievement, arguing that Deep Blue's brute-force approach did not represent "real" intelligence. [John McCarthy](/wiki/john_mccarthy), who coined the term [artificial intelligence](/wiki/artificial_intelligence), remarked that Deep Blue played chess the way an airplane flies: powerful but not the same as how birds (or humans) do it.

**Chess community.** The match changed competitive chess. It demonstrated that even the strongest human players could be defeated by sufficiently powerful computers. Over the following decades, chess engines became ubiquitous training tools. Today, programs like [Stockfish](/wiki/stockfish) and [AlphaZero](/wiki/alphazero) are far stronger than any human player.

**IBM's brand.** The match was an enormous public relations success for IBM, associating the company with cutting-edge technology in the public imagination. The phrase "Deep Blue" became shorthand for computational power.

The match was also the subject of a 2003 documentary film, *Game Over: Kasparov and the Machine*, which explored the controversy from Kasparov's perspective.

## Why did IBM retire Deep Blue?

After the 1997 victory, IBM chose not to grant Kasparov a rematch and retired Deep Blue from competitive play. The decision fueled conspiracy theories and Kasparov's accusations, but IBM maintained that the project had achieved its goal and there was nothing more to prove.

The Deep Blue hardware was partly dismantled. One of the RS/6000 SP towers used in the match is now on display at the National Museum of American History, part of the Smithsonian Institution, in Washington, D.C. Another is at the Computer History Museum in Mountain View, California [2].

### Aftermath for IBM

The Deep Blue project had lasting effects on IBM beyond the chess match itself. The high-profile victory validated IBM's investment in massively parallel computing and custom chip design. The public relations value was enormous, but the project also generated technical insights that influenced subsequent IBM initiatives.

IBM's next major AI demonstration project was Watson, the question-answering system that defeated human champions on the television game show *Jeopardy!* in 2011. While Watson used fundamentally different technology (natural language processing, statistical analysis, and information retrieval rather than game-tree search), it shared Deep Blue's DNA as a high-profile demonstration of machine capability in a domain traditionally dominated by humans [2].

Several members of the Deep Blue team went on to contribute to Watson and other IBM research projects. Murray Campbell remained at IBM Research and continued working on AI and game-playing systems. Feng-hsiung Hsu published *Behind Deep Blue: Building the Computer that Defeated the World Chess Champion* in 2002, providing an insider's account of the project's history [1].

| Deep Blue Team Member | Post-Deep Blue Career |
|----------------------|----------------------|
| Feng-hsiung Hsu | Moved to Microsoft Research Asia; published memoir in 2002 |
| Murray Campbell | Remained at IBM Research; contributed to Watson project |
| A. Joseph Hoane Jr. | Continued at IBM Research |
| Joel Benjamin | Returned to competitive chess; authored chess books |

## How does Deep Blue compare to modern chess AI?

Deep Blue's approach to chess, built on massively parallel hardware and the alpha-beta search algorithm, represented the culmination of a line of research stretching back to Claude Shannon's 1950 paper "Programming a Computer for Playing Chess." It was not, however, the future of AI.

The key distinction is that Deep Blue was engineered specifically for chess. Its 480 custom chips, its hand-tuned evaluation function, and its opening book were all chess-specific. The system could not play Go, understand language, or recognize images. This narrow focus led some researchers to argue that, impressive as it was, Deep Blue did not represent a general advance in AI.

### Evolution of Computer Chess After Deep Blue

In the years following Deep Blue's victory, the landscape of computer chess changed dramatically. Custom hardware gave way to software running on commodity processors, and the playing strength of chess engines continued to rise.

| Year | Engine / System | Key Innovation | Estimated Elo |
|------|----------------|----------------|---------------|
| 1997 | Deep Blue | Custom VLSI chips, massively parallel search | ~2,750 |
| 2005 | Rybka | Advanced evaluation, search optimizations | ~3,100 |
| 2010 | Stockfish (early) | Open-source, community-developed | ~3,200 |
| 2017 | AlphaZero | Self-play reinforcement learning, neural network evaluation | ~3,700+ |
| 2020 | Stockfish + NNUE | Hybrid: traditional search + neural network evaluation | ~3,500+ |
| 2026 | Stockfish 17 | Continued NNUE refinement, massive community testing | ~3,650+ |

Modern chess engines running on a standard laptop are estimated to be hundreds of Elo points stronger than Deep Blue was. Stockfish, an open-source engine, has achieved an estimated Elo rating above 3,600 on standard hardware, compared to Deep Blue's estimated 2,750. This means a modern phone running Stockfish could likely defeat the machine that beat Kasparov [5][13].

### How does Deep Blue differ from AlphaZero?

In 2017, [DeepMind](/wiki/deepmind)'s AlphaZero took a fundamentally different approach. Instead of hand-crafted evaluation functions and specialized hardware, AlphaZero used [deep reinforcement learning](/wiki/reinforcement_learning) to teach itself chess (as well as Go and shogi) from scratch, with no human knowledge beyond the rules of the game. Starting from random play, AlphaZero reached a higher Elo rating than Stockfish 8 after only four hours of self-play, and after nine hours of training it played a 100-game match against Stockfish 8, the world's strongest traditional chess engine at the time. AlphaZero won 28 games, lost zero, and drew 72 [11].

A striking illustration of the two philosophies is raw search volume. Deep Blue and its descendants search enormous trees: AlphaZero, by contrast, "searches just 80,000 positions per second in chess... compared to 70 million for Stockfish," relying on a neural network to focus its attention on the most promising moves rather than examining vastly more of them [11]. AlphaZero's playing style was notably different from traditional engines. It often sacrificed material for long-term positional advantages, played with a dynamic, attacking style that resembled the play of great human champions, and frequently found creative solutions that surprised chess experts. One grandmaster described the resulting games as "chess from another dimension." [11]

| Feature | Deep Blue (1997) | AlphaZero (2017) | Stockfish 17 (2024) |
|---------|-----------------|------------------|---------------------|
| Approach | Brute-force search + hand-crafted evaluation | [Deep reinforcement learning](/wiki/reinforcement_learning) | Alpha-beta search + NNUE neural network |
| Chess knowledge | Extensive (grandmaster-tuned evaluation, opening book) | Rules only | Learned through training on self-play games |
| Search speed | ~200 million positions/second | ~80,000 positions/second | ~100+ million positions/second (hardware dependent) |
| Hardware | Custom VLSI chess chips | [TPUs](/wiki/tensor_processing_unit_tpu) (general-purpose AI accelerators) | Standard CPUs |
| Other games | Chess only | Chess, Go, Shogi | Chess only |
| Learning | None (fixed evaluation) | Self-play from scratch | NNUE trained on billions of positions |
| Estimated Elo | ~2,750 | ~3,700+ | ~3,650+ |
| Cost | Millions of dollars in custom hardware | Google TPU cluster | Free, runs on consumer hardware |

The contrast between Deep Blue and AlphaZero illustrates a broader shift in AI from hand-engineered, domain-specific systems to general-purpose learning systems. Deep Blue represented the peak of the "knowledge engineering" approach, where human experts painstakingly encode their knowledge into a system. AlphaZero demonstrated that a learning system, given enough computation and the right architecture, can discover that knowledge on its own, and sometimes surpass it.

### Leela Chess Zero

Following AlphaZero's publication, an open-source community project called Leela Chess Zero (Lc0) replicated the AlphaZero approach using distributed volunteer computing. Lc0 has become one of the strongest chess engines in the world, regularly competing with Stockfish at the top of computer chess rating lists. Together, Stockfish and Lc0 represent the two dominant paradigms in modern computer chess: enhanced traditional search (Stockfish with NNUE) and pure neural network approaches (Lc0) [5][13].

## Broader Significance

Deep Blue's victory over Kasparov is sometimes cited as a milestone marking the moment when computers proved they could match human performance in a domain long considered a benchmark for intelligence. Chess had been a target for AI researchers since the field's inception at the [Dartmouth Conference](/wiki/dartmouth_conference) in 1956, and Deep Blue's win represented the fulfillment of that early ambition, albeit through methods that differed from what most AI pioneers had envisioned.

The match also illustrated a recurring pattern in AI history: once a problem is solved by a computer, it tends to be reclassified as "not really intelligence." After Deep Blue's victory, the AI community largely moved on to harder problems, including Go (solved by [AlphaGo](/wiki/alphago) in 2016), natural language understanding, and general reasoning. Within the longer [history of AI](/wiki/history_of_ai), Deep Blue marks the high-water mark of the symbolic, search-based era just before the deep-learning revolution.

Deep Blue remains an important chapter in AI history, not because of the techniques it used, but because of what it represented: the first time a machine triumphed over the best human mind in an activity that had long been considered a hallmark of human intellectual achievement.

## References

1. Hsu, F. (2002). *Behind Deep Blue: Building the Computer that Defeated the World Chess Champion.* Princeton University Press.
2. "Deep Blue." IBM History. https://www.ibm.com/history/deep-blue
3. Hsu, F. et al. (1999). "IBM's Deep Blue Chess Grandmaster Chips." IEEE Micro, 19(2), 70-81.
4. Campbell, M., Hsu, F., & Tan, G. (2002). "Deep Blue." Artificial Intelligence, 134(1-2), 57-83. https://www.sciencedirect.com/science/article/pii/S0004370201001291/pdf
5. "Deep Blue (chess computer)." Wikipedia. https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer)
6. "Chess champion Garry Kasparov defeats IBM's Deep Blue." HISTORY. https://www.history.com/this-day-in-history/february-17/kasparov-defeats-chess-playing-computer
7. "Deep Blue versus Garry Kasparov." Wikipedia. https://en.wikipedia.org/wiki/Deep_Blue_versus_Garry_Kasparov
8. "Deep Blue's cheating move." ChessBase. https://en.chessbase.com/post/deep-blue-s-cheating-move
9. "Deep Blue versus Kasparov, 1997, Game 6." Wikipedia. https://en.wikipedia.org/wiki/Deep_Blue_versus_Kasparov,_1997,_Game_6
10. "Deep Blue defeats Garry Kasparov in chess match." HISTORY. https://www.history.com/this-day-in-history/may-11/deep-blue-defeats-garry-kasparov-in-chess-match
11. Silver, D. et al. (2018). "A general reinforcement learning algorithm that masters chess, shogi, and Go through self-play." Science, 362(6419), 1140-1144.
12. "Thompson's Databases." Chessprogramming wiki. https://www.chessprogramming.org/Thompson%27s_Databases
13. "From Deep Blue to AlphaZero: The Rise of AI in Contemporary Chess." Chess.com. https://www.chess.com/blog/sourabhjoshi01/from-deep-blue-to-alphazero-the-rise-of-ai-in-contemporary-chess
14. "How IBM's Deep Blue Beat World Champion Chess Player Garry Kasparov." IEEE Spectrum. https://spectrum.ieee.org/how-ibms-deep-blue-beat-world-champion-chess-player-garry-kasparov