Fun Facts📚

Claude Elwood Shannon, an American polymath did a calculation in his paper "Programming a Computer for Playing Chess" showing the lower bound (a value that is less than or equal to every element in a set) of the game tree complex of chess is 10^120. 

Scientist estimate that there are approximately 10^82 atoms in the observable universe. 

This means that, in theory, there are more possible chess games than there are atoms in the observable universe.