Programming a Computer for Playing Chess

Claude E. Shannon · Philosophical Magazine, Ser. 7, Vol. 41, No. 314 (March 1950)

tlte-cite:shannon-1950-chess

Editorial gloss

Founding paper of computer chess. Source of the Shannon Number (≈10^120 game-tree lower bound), cited for game-tree vs state-space complexity distinction — mathematical fact, not history of Tamil chess.

Live source

https://www.pi.infn.it/~carosi/chess/shannon.pdf

Archive snapshot · web.archive.org

Closest capture (auto-resolved)

Snapshot now · Save Page Now

If the live source ever rots, capture a fresh copy on web.archive.org. One click — no account needed.

Dossier tags

strategy complexity foundations

Citation IDs in the tlte-cite: namespace are append-only and permanent. They can be quoted from any dossier, the Velicham assistant, or external scholarship. The canonical resolver lives atdocs.tlte.cloud/cite/<slug>.

Continue in Reference & Tools

Case Study · WTM-Geneva Reception

Cinematic case study with live Era-Clock, physics block (Venn diagram, exposure equations), and pipeline diagrams.

The Reading Room · institutional dossier kit

v1.0 slate of 18 printable dossiers shaped for institutes, UN mechanisms, OSINT/legal, parliamentary research, and press. Versioned, SHA-256 manifest, citation-anchored to the live archive.

Citations Appendix

Sourced references for the campaign archive.

Primary Evidence Ledger

First-hand documentation underpinning the case.