Museum Wire
Law 0 · Katie's LawEvery system is shaped by the human drive to do less work. This is not a flaw. It is the economic force that produces all software — and all software failure.◆Law I · Boundary CollapseWhen data crosses into a system that interprets structure, without being constrained, it becomes executable.◆◆ 2026 IncidentAxios. 70 Million Downloads a Week. North Korea Inside.◆Law II · Ambient AuthorityWhen a system trusts the presence of a credential instead of verifying the intent behind it, authentication becomes indistinguishable from authorization.◆◈ AXM-001Set Theory — Membership, Boundaries, and Belonging◆Law III · Transitive TrustWhen a system inherits trust from a source it did not verify, the attack surface extends to everything that source touches.◆◆ 2026 IncidentClaude Code — The Accept-Data-Loss Flag◆Law IV · Complexity AccretionSystems do not become complex. They accumulate complexity — one reasonable decision at a time — until no single person can hold the whole in their head.◆Law V · Temporal CouplingCode that assumes sequential execution, stable state, or consistent timing will fail the moment concurrency, scale, or latency proves the assumption wrong.◆◆ 2026 IncidentCopy Fail — 732 Bytes to Root on Every Linux Distribution◆◈ AXM-002Boolean & Propositional Logic — True, False, and the Excluded Middle◆Law VI · Observer InterferenceWhen the system that monitors health becomes a participant in the system it monitors, observation becomes a failure vector.◆◆ 2025Amazon Kiro — The 13-Hour Outage◆◆ 2025Operation Chrysalis: The Notepad++ Supply Chain Hijack◆◆ 2025Replit Agent — The Vibe Code Wipe◆◆ 2025Shai-Hulud — The npm Worm That Ate Its Own Ecosystem◆◆ 2024Air Canada Chatbot — The Policy That Wasn't◆◆ 2024Change Healthcare — One-Third of US Healthcare, One Missing MFA◆◆ 2024CrowdStrike — The Security Update That Broke the World◆◆ 2024Google Gemini Image Generation — The Six-Day Pause◆◆ 2024XZ Utils — The Two-Year Infiltration◆◆ 20233CX — The Supply Chain That Ate Another Supply Chain◆◆ 2023Amazon Prime Video — The Per-Frame State Machine◆◆ 2023Bing Sydney — The Chatbot That Went Rogue◆◆ 2023Samsung ChatGPT Leak — The Employee Who Pasted the Secret◆EFFODE · LEGE · INTELLEGE◆Law 0 · Katie's LawEvery system is shaped by the human drive to do less work. This is not a flaw. It is the economic force that produces all software — and all software failure.◆Law I · Boundary CollapseWhen data crosses into a system that interprets structure, without being constrained, it becomes executable.◆◆ 2026 IncidentAxios. 70 Million Downloads a Week. North Korea Inside.◆Law II · Ambient AuthorityWhen a system trusts the presence of a credential instead of verifying the intent behind it, authentication becomes indistinguishable from authorization.◆◈ AXM-001Set Theory — Membership, Boundaries, and Belonging◆Law III · Transitive TrustWhen a system inherits trust from a source it did not verify, the attack surface extends to everything that source touches.◆◆ 2026 IncidentClaude Code — The Accept-Data-Loss Flag◆Law IV · Complexity AccretionSystems do not become complex. They accumulate complexity — one reasonable decision at a time — until no single person can hold the whole in their head.◆Law V · Temporal CouplingCode that assumes sequential execution, stable state, or consistent timing will fail the moment concurrency, scale, or latency proves the assumption wrong.◆◆ 2026 IncidentCopy Fail — 732 Bytes to Root on Every Linux Distribution◆◈ AXM-002Boolean & Propositional Logic — True, False, and the Excluded Middle◆Law VI · Observer InterferenceWhen the system that monitors health becomes a participant in the system it monitors, observation becomes a failure vector.◆◆ 2025Amazon Kiro — The 13-Hour Outage◆◆ 2025Operation Chrysalis: The Notepad++ Supply Chain Hijack◆◆ 2025Replit Agent — The Vibe Code Wipe◆◆ 2025Shai-Hulud — The npm Worm That Ate Its Own Ecosystem◆◆ 2024Air Canada Chatbot — The Policy That Wasn't◆◆ 2024Change Healthcare — One-Third of US Healthcare, One Missing MFA◆◆ 2024CrowdStrike — The Security Update That Broke the World◆◆ 2024Google Gemini Image Generation — The Six-Day Pause◆◆ 2024XZ Utils — The Two-Year Infiltration◆◆ 20233CX — The Supply Chain That Ate Another Supply Chain◆◆ 2023Amazon Prime Video — The Per-Frame State Machine◆◆ 2023Bing Sydney — The Chatbot That Went Rogue◆◆ 2023Samsung ChatGPT Leak — The Employee Who Pasted the Secret◆EFFODE · LEGE · INTELLEGE◆
Keyboard Navigation
W↑
A←
S↓
D→
or arrow keys · M for map · Q to exit
← Back to Hall of Heroes
IBM Deep Blue pixel portrait
⬡ Pioneerboth

IBM Deep Blue

Deep Blue / Deeper Blue

The Machine That Beat the World Champion Nobody Expected It To

nineties_late · 3 min read · Decommissioned
“I'm a human being. When I see something that is beyond my understanding, I'm afraid.”

The Machine

Deep Blue was a parallel computer using 30 IBM RS/6000 processors enhanced with 480 custom VLSI chess chips, capable of evaluating 200 million chess positions per second. Its chess evaluation was a combination of handcrafted evaluation functions — written by chess grandmaster Joel Benjamin, among others — and a search algorithm that examined positions to depths of 6-8 plies in normal play, with selective extensions to 20-40 plies in tactical sequences.

The machine was not learning chess. It was searching chess: examining a tree of possible move sequences and selecting the branch with the best evaluated endpoint. The chess knowledge was in the evaluation function. The brute force was in the search. The custom chips made the search fast enough to beat anyone.

The Match

The 1996 match ended Kasparov 4–2. He won. The rematch in May 1997 — with an upgraded machine renamed Deeper Blue — was different. Kasparov won Game 1. The machine won Game 2 in a fashion that visibly disturbed Kasparov: a move in the final stages that appeared to sacrifice a positional advantage for a subtle long-term gain — the kind of play associated with deep understanding rather than brute-force search. Kasparov suspected the IBM team had violated match rules and consulted human grandmasters between or during games.

Game 2 remains controversial. Analyses conducted afterward suggested the move in question was a search artifact — the program's evaluation function produced a specific numerical result that caused it to prefer an unusual move — rather than evidence of deep understanding. Kasparov's request to see Deep Blue's logs was refused by IBM. The match continued. The machine won 3.5–2.5.

IBM retired Deep Blue immediately after the match. It has never played chess since.

The Exhibit

Deep Blue belongs in the museum for two reasons. The technical achievement is genuine: it was the first computer to defeat the world's strongest chess player, and the engineering behind the evaluation function and search algorithm represents one of the most focused and successful applications of domain-specific hardware in computer science history.

The controversy is the exhibit: a machine won a match, the logs were not disclosed, and we cannot fully explain the move that may have decided the outcome. This is Observer Interference (Law VI) at the machine level — the observer (IBM's post-game analysis) could not be fully independent because IBM had a commercial interest in the result. The specific move that shook Kasparov's confidence remains ambiguous.

Deep Blue beat the world champion. Whether it beat him fairly is undocumented, because the documentation was withheld.

The most powerful chess computer in history defeated the best chess player in human history. Then it was retired. Then the logs were never released. The museum documents what was established and what was not.