From charlesreid1




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} $


Link: https://en.wikipedia.org/wiki/Shannon_number