The Shannon number, named after the mathematician and electrical engineer Claude Shannon, is an estimate of the lower bound of the game-tree complexity of chess. It represents the total number of possible unique chess positions that can arise during a game. The Shannon number is approximately \(10^{120}\), which illustrates the vast complexity of chess and indicates that there are far more possible chess games than there are atoms in the observable universe.

Ancestors (5)

  1. Combinatorial game theory
  2. Combinatorics
  3. Fields of mathematics
  4. Mathematics
  5. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version