bn:03217743n
Noun Concept
Categories: Claude Shannon, Computer chess, Large integers, Combinatorial game theory, Mathematical chess problems
EN
Shannon number  Shannon's number
EN
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. Wikipedia
Definitions
Relations
Sources
EN
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. Wikipedia
Lower bound on the game-tree complexity for chess Wikidata
DISCOVERER OR INVENTOR
FACET OF
MAIN SUBJECT
NAMED AFTER
STUDIED BY
Wikipedia
Wikidata
Wikipedia Redirections