I have recently bought an exercise copy and there, in the cover page I got an amazing fact about chess board, "There are total $10^{120}$ board positions in a chess board."
But I was just thinking how to prove this.
My work:
I think to first find the no of board positions including all pawns(yet don't know how to do that) and then get a motivation excluding some no of pawns. Can anyone give some idea?
$10^{120}$ is the Shannon number, a lower bound estimate of the number of possible chess games.
For number of positions, this is on the Shannon number wiki:
"John Tromp estimated the number of legal chess positions with a 95% confidence level at $ 4.5\times 10^{44} \pm 0.37\times 10^{44}$ based on an efficiently computable bijection between integers and chess positions."
https://en.wikipedia.org/wiki/Shannon_number#cite_note-5 https://github.com/tromp/ChessPositionRanking