Shannon Number

From charlesreid1

Revision as of 20:57, 16 July 2017 by Admin (talk | contribs) (Created page with "{{ConstantsFlag}} Lower bound estimate on the number of possible chess games (game-tree complexity of chess): <math> \dfrac{64!}{32! 8!^2 2!^6} </math> which is <math> \...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)



Euler.jpg
Mathematical Constants


Irrational Numbers: Euler-Mascheroni Constant  · Sqrt2  · Phi  · Sqrt3  · e  · Sqrt5  · Sqrt6  · Sqrt7  · Sqrt8  · Pi  · Sqrt10  · Sqrt11  · Pi to the Pi

Prime Numbers: Prime Numbers  · Palindromic Primes  · Prime Generating Polynomials  · Belphegors Prime

Sequences: Fibonacci Numbers  · Lucas Numbers  · General Fibonacci Numbers

Number Forms: Fermat Numbers  · Mersenne Primes  ·

Counting and Combinatorics: Catalan Numbers  · Shannon Number  · Eddington Number

Tetration and Knuth's Up Notation: Tetration

Factoring and Number Theory: Divisibility  · Totient Function

Games: Four Fours  · Five Fives


https://charlesreid1.github.io/radix-tables/

The Most Beautiful Formulas


Flags  · Template:ConstantsFlag  · ConstantTemplate  · e


Lower bound estimate on the number of possible chess games (game-tree complexity of chess):

$ \dfrac{64!}{32! 8!^2 2!^6} $

which is

$ \sim 10^{43} $

Retrieved from "https://charlesreid1.com/w/index.php?title=Shannon_Number&oldid=19646"