Shannon number
Estimate of number of possible chess games
Shannon number
The Shannon number, named after the American mathematician Claude Shannon, is a conservative lower bound of the game-tree complexity of chess of 10120, based on an average of about 103 possibilities for a pair of moves consisting of a move for White followed by a move for Black, and a typical game lasting about 40 such pairs of moves. His influential 1950 paper on it, "Programming a Computer for Playing Chess", introduced the field of computer chess.
Read on Wikipedia · Image Jacobs, Konrad, CC BY-SA 2.0 de
Open boosters, collect cards and trade them. Free to play.
Play for free