In March 1950, Claude Shannon published in Philosophical Magazine "Programming a Computer for Playing Chess", the first technical article to mathematically structure how to program a complete game of chess on a general-purpose computer. Shannon distinguishes two strategies: Type A (brute force, exhaustively exploring the move tree to a fixed depth) and Type B (intelligent selection, exploring only the most promising lines). The article explicitly cites the Torres Quevedo precedent: "A more honest attempt to design a chess-playing machine was made in 1914 by Torres y Quevedo, who constructed a device which played an end game of king and rook against king", with a bibliographic reference to Vigneron's 1914 article describing the mechanism. Shannon's paper is purely theoretical — he did not program or run an actual game — but it became the reference framework for all subsequent computer chess.