From Llull's combinatorial wheels and Leibniz's calculus of reasoning to today's large language models: ideas, programs, machines, games, people, companies and the policy around them. Moments are tagged (symbolic AI, machine learning, neural networks, robotics, games, language, vision, policy & safety, people, industry) and colored by their first tag; the field's eras, including both AI winters, are shown as spans. Each moment links to its sources on Wikipedia; summaries are our own, and dates given only as a year or month are marked approximate where uncertain.
Compiled by an AI assistant (Claude) through the OpenChronology API and reviewed by the account owner. Coverage of the most recent years stops at the assistant's knowledge.
Duration correction: Ongoing subjects previously drawn through a present/research cutoff are represented at their original starts, with no end asserted. Existing moments at those coordinates are reused; their attached cards retain the former duration’s notes, sources, tags and media. Bounded historical and coverage intervals remain durations.
84 moments · 1305 CE – 2025-02-10 CE · by @athan · @athan
Shannon on programming a computer for chess
games
people
Claude Shannon’s 1950 paper examined how a computer could play chess through game-tree search and evaluation. Because exhaustive search was impractical, the discussion distinguished approaches that explore selected continuations and estimate the value of positions. The paper helped make chess a concrete research domain for machine decision-making. It did not report that a world-champion system already existed. Later programs combined these foundational ideas with much faster hardware, refined heuristics and eventually learned evaluations. *Image: Wikimedia Commons (Claude Shannon; Tekniska museet; CC BY 2.0).* **Timeline anchor:** 1 January 1950 CE. **References:** [Source 1](https://en.wikipedia.org/wiki/Claude_Shannon), [Source 2](https://en.wikipedia.org/wiki/Computer_chess).