There are more possible iterations of a game of chess than there are atoms in the known universe.
The Shannon number, named after Claude Shannon, is an estimated lower bound on the game-tree complexity of chess of 10120, based on about 103 initial moves for White and Black and a typical game lasting about 40 pairs of moves.
The Shannon number, named after Claude Shannon, is an estimated lower bound on the game-tree complexity of chess of 10120, based on about 103 initial moves for White and Black and a typical game lasting about 40 pairs of moves.
As a comparison, the number of atoms in the observable universe, to which it is often compared, is estimated to be between 4×1079 and 4×1081.
0 yorum :
Yorum Gönder