---
title: "Shannon's wedge"
url: https://raskell.io/notes/shannons-wedge/
author: Raffael Schneider
date: 2026-10-26
description: "In 1950 Shannon called chess programs useless and worth building anyway, as a wedge into harder problems. The wedge reached proteins."
tags: [games, intelligence, history-of-technology, game-ai, research-labs]
---

# Shannon's wedge

Claude Shannon's 1950 paper on programming a computer to play chess opens by conceding that the problem has no practical importance, and then explains why to do it anyway: a game is a problem with complete rules and a clear result, hard enough to be interesting, and the methods that crack it might serve as a wedge into problems of the same shape that matter more. Mallaby tells the story through David Levy's handbook, which is how the sentence reached a twelve-year-old Hassabis in 1988, and it is the sentence I kept returning to while [building my own three engines](https://raskell.io/articles/learning-to-play/).

The wedge did what he said. DeepMind's method was games from the first day: Atari, then Go, then chess, shogi and Go with one algorithm, and then the lab turned its learning methods on protein folding, which is not a game and was the grand challenge of a different field. The games were never the point, and they were also the only place the method could have been proven, because nowhere else gives you a scoreboard. That is the whole argument for why an amateur with a laptop should spend a month on board games in 2026, and Shannon made it before the computer he was programming existed.

## References

- Claude Shannon, [Programming a Computer for Playing Chess](https://www.computerhistory.org/chess/doc-431614f6d9b4e/), *Philosophical Magazine* (1950).
- Sebastian Mallaby, *The Infinity Machine* (Penguin Press, 2026), chapter 1.
