The Shannon number is an estimated lower bound on the game-tree complexity of chess, calculated by information theorist Claude Shannon as an aside in his 1950 paper "Programming a Computer for Playing Chess".
Shannon calculated it as an aside in his 1950 paper "Programming a Computer for Playing Chess". The Shannon number, named after Claude Shannon, is an estimated lower bound on the game-tree complexity of chess.
The Shannon number, named after Claude Shannon, is an estimated lower bound on the game-tree complexity of chess. Shannon calculated it as an aside in his 1950 paper "Programming a Computer for Playing Chess".
The Shannon number, named after Claude Shannon, is an estimated lower bound on the game-tree complexity of chess. Shannon calculated it as an aside in his 1950 paper "Programming a Computer for Playing Chess".