Still working to recover. Please don't edit quite yet.
Difference between revisions of "Novemtrigintillion"
| Line 2: | Line 2: | ||
==Shannon number== | ==Shannon number== | ||
| − | One novemtriginillion is known as the '''shannon | + | One novemtriginillion is known as the '''shannon number. The shannon number is an estimation of the [[game-tree complexity]] of [[chess]]. It was first calculated by [[Claude Shannon]], the father of [[information theory]]. According to him, on average, 40 moves are played in a chess game and each player chooses one move among 30 (but in fact, there may be as few as zero -in the case of [[checkmate]] or [[stalemate]]- or as many as [http://www.softdecc.com/pdb/search.pdb?expression=PROBID='P0004126' 218]). Therefore, (30×30)<sup>40</sup>, [[List_of_Latin_phrases#I|i.e.]] 900<sup>40</sup> chess games are possible. This number is about 10<sup>120</sup>, as the solution of the equation 900<sup>40</sup>=10<sup>x</sup> is x=40×''log'' 900. |
The [[game-tree complexity]] of chess is now evaluated at approximately 10<sup>123</sup> (the number of legal positions in the game of [[chess]] is estimated to be between 10<sup>43</sup> and 10<sup>50</sup>). As a comparison, the number of [[atoms]] in the [[Universe]], to which it is often compared, is estimated to be between 4×10<sup>78</sup> and 6×10<sup>79</sup>. | The [[game-tree complexity]] of chess is now evaluated at approximately 10<sup>123</sup> (the number of legal positions in the game of [[chess]] is estimated to be between 10<sup>43</sup> and 10<sup>50</sup>). As a comparison, the number of [[atoms]] in the [[Universe]], to which it is often compared, is estimated to be between 4×10<sup>78</sup> and 6×10<sup>79</sup>. | ||
Revision as of 16:22, 2 December 2009
Novemtrigintillion is a very large number. It's ten to the power of 120 or 10120.
Shannon number
One novemtriginillion is known as the shannon number. The shannon number is an estimation of the game-tree complexity of chess. It was first calculated by Claude Shannon, the father of information theory. According to him, on average, 40 moves are played in a chess game and each player chooses one move among 30 (but in fact, there may be as few as zero -in the case of checkmate or stalemate- or as many as 218). Therefore, (30×30)40, i.e. 90040 chess games are possible. This number is about 10120, as the solution of the equation 90040=10x is x=40×log 900.
The game-tree complexity of chess is now evaluated at approximately 10123 (the number of legal positions in the game of chess is estimated to be between 1043 and 1050). As a comparison, the number of atoms in the Universe, to which it is often compared, is estimated to be between 4×1078 and 6×1079.
